A robust implementation of the Carathéodory-Fejér method for rational approximation
- First Online:
- 168 Downloads
Best rational approximations are notoriously difficult to compute. However, the difference between the best rational approximation to a function and its Carathéodory-Fejér (CF) approximation is often so small as to be negligible in practice, while CF approximations are far easier to compute. We present a robust and fast implementation of this method in the Chebfun software system and illustrate its use with several examples. Our implementation handles both polynomial and rational approximation and substantially improves upon earlier published software.
KeywordsCarathéodory-Fejér approximation Near-best rational approximation Chebfun
Mathematics Subject Classification (2000)41A50 41A20
Unable to display preview. Download preview PDF.
- 15.Takagi, T.: On an algebraic problem related to an analytic theorem of Carathéodory and Fejér and on an allied theorem of Landau. Jpn. J. Math. 1, 83–93 (1924) Google Scholar
- 19.Trefethen, L.N.: Chebyshev approximation on the unit disk. In: Werner, H., et al. (ed.) Computational Aspects of Complex Analysis, pp. 309–323. Reidel, Dordrecht (1983) Google Scholar
- 21.Trefethen, L.N.: Matlab programs for CF approximation. In: Approximation Theory V, pp. 599–602. Academic Press, Boston (1986) Google Scholar