Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On a rational approximation problem in the real Hardy space H2
Baratchart L., Olivi M., Wielonsky F. Theoretical Computer Science94 (2):175-197,1992.Type:Article
Date Reviewed: Jun 1 1993

An algorithm for determining a rational function that approximates a holomorphic function on a domain of the complex plane is described. One application the authors have in mind is the construction of a concise description of a discrete time system. Several theorems are given on the existence and uniqueness of solutions to the problem posed. A fairly detailed conceptual algorithm is presented, but no numerical examples are reported. The style of this research paper is fairly technical, and the reader is supposed to master both the theory of analytic functions and some functional analysis. The list of references is adequate.

Reviewer:  S.-Å. Gustafson Review #: CR116771
Bookmark and Share
 
Rational Approximation (G.1.2 ... )
 
 
Miscellaneous (G.2.m )
 
Would you recommend this review?
yes
no
Other reviews under "Rational Approximation": Date
Approximation of nonlinear dynamic systems by rational series
Hespel C., Jacob G. Theoretical Computer Science 79(1): 151-162, 1991. Type: Article
Dec 1 1991
Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
Cabay S., Jones A., Labahn G. ACM Transactions on Mathematical Software 23(1): 91-110, 1997. Type: Article
Sep 1 1997
Interpolating arithmetic read-once formulas in parallel
Bshouty N., Cleve R. SIAM Journal on Computing 27(2): 401-413, 1998. Type: Article
Aug 1 1999
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy