Applications of root finding methods for discrete rational Chebyshev approximation

ABSTRACT

Root finding algorithms are shown to be applicable for finding best rational Chebyshev approximations over finite point sets when the denominator of the approximating function is bounded below by a positive constant. The methods are applicable to approximation in several variables and are shown to be competitive with the differential correction algorithm.

REFERENCES

• 1: Barrodale, I ., M. J. D. Powell, and F. D. K. Roberts. "The Differential Correction Algorithm for Rational - Approximation," SIAM Journal on Numerical Analysis, 9, pp. 493-504, 1972.
• 2: Cheney, E. W. Introduction to Approximation Theory, McGraw-Hill, N. Y., 1966, pp. 169-173.
• 3: Cheney, E. W. and H. L. Loeb. "On Rational Chebyshev Approximation," Numerische Mathematik, 4, pp. 124-127, 1962.
• 4: Fox, P., A. A. Goldstein, and G. Lastman. "Rational Approximation on Finite Point Sets," in Approximation of Functions, H. L. Garabedian, ed., N. Y., Elsevier, 1965.
• 5: Isaacson, E. and H. B. Keller. Analysis of Numerical Methods, N. Y., John Wiley & Sons, 1966.
• 6: Lee,, C. M. and F. D. K. Roberts. "A Comparison of Algorithms for Rational Approximation," Math. Comp., V. 27, 1973, pp. 111-121.
• 7: Loeb, H. L. "Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms," SIAM Journal, 8, 1960, pp. 458-465.
• 8: David Franklin Mcallister, Algorithms for chebychev approximation over finite sets, 1972
• 9: Nerinckx, D. and A. Haegemans. "A Comparison of Non-Linear Equation Solvers," J. Comp. and Appl. Math., V. 2, 1976, pp. 145-148.
• 10: Rabinowitz, P. "Applications of Linear Programming to Numerical Analysis," SIAM Review, I0, pp. 121-159, 1968.
• 11: Ralston, A. and H. S. Wilf. Mathematical Methods for Digital Computers, Vol. 2, John Wiley and Sons, 1968, pp. 264-284.
• 12: Mathematical Programming System - Program Description, IBM, SH20-0968-1.