Lee, Chee-Mou2024-08-142024-08-1419711971https://hdl.handle.net/1828/18653A 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.87 pagesAvailable to the World Wide WebAlgorithms for rational Chebyshev approximationThesis