Abstract
The differential correction algorithm for generalized rational functions is described, and two theorems on convergence and order of convergence are given. An example shows that the order of convergence may deteriorate from superlinear to linear when a best generalized rational approximation does not exist.
Similar content being viewed by others
References
I. Barrodale, M. J. D. Powell, F. D. K. Roberts (1972):The differential correction algorithm for rational l∞-approximation. SIAM J. Numer. Anal.,9:493–504.
E. W. Cheney, H. L. Loeb (1961):Two new algorithms for rational approximation. Numer. Math.,3:72–75.
C. B. Dunham (1980):Stability of differential correction for rational Chebyshev approximation. SIAM J. Numer. Anal.,17:639–640.
C. B. Dunham (1984):Difficulties in rational Chebyshev approximation. Conference on Constructive Theory of Functions, Varna, Bulgaria.
E. H. Kaufman, G. D. Taylor (1981):Uniform approximation by rational functions having restricted denominators. J. Approx. Theory,32:9–26.
C. M. Lee, F. D. K. Roberts (1973):Comparison of algorithms for rational l∞-approximation. Math. Comp.,27:111–121.
Author information
Authors and Affiliations
Additional information
Communicated by Dietrich Braess.
Rights and permissions
About this article
Cite this article
Cheney, E.W., Powell, M.J.D. The differential correction algorithm for generalized rational functions. Constr. Approx 3, 249–256 (1987). https://doi.org/10.1007/BF01890568
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01890568
Key words and phrases
- Convergence analysis
- Differential correction algorithm
- Generalized rational approximation
- Rational approximation