Algorithms for rational Chebyshev approximation
Date
1971
Authors
Lee, Chee-Mou
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A common problem in numerical analysis is to obtain a convenient approximation to a prescribed function. Rational approximating functions are frequently selected for this purpose. This thesis is a survey of several methods that have been proposed for obtaining best rational Chebyshev approximations to functions defined on finite point sets. Most of the methods formulate the problem as a mathematical programming problem. Numerical examples are given to compare the efficiency of the methods.