A comparison of algorithms for rational approximation

Authors:
C. M. Lee and F. D. K. Roberts

Journal:
Math. Comp. **27** (1973), 111-121

MSC:
Primary 65D15

DOI:
https://doi.org/10.1090/S0025-5718-1973-0331719-0

Corrigendum:
Math. Comp. **33** (1979), 847-848.

Corrigendum:
Math. Comp. **33** (1979), 847.

MathSciNet review:
0331719

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Results are reported of a numerical study to compare eight algorithms for obtaining rational approximations. The algorithms investigated are Loeb's algorithm, the linear inequality algorithm, the Osborne-Watson algorithm, the differential correction algorithms I, II and III, the Remes algorithm and Maehly's algorithm. The results of the study indicate that the Remes algorithm and the differential correction algorithm III are the most satisfactory methods to use in practice.

**[1]**I. Barrodale,*Best Rational Approximation and Strict Quasi-Convexity*, M.R.C. Report 1157, University of Wisconsin, Madison, Wis., 1971.**[2]**I. Barrodale and J. C. Mason,*Two simple algorithms for discrete rational approximation*, Math. Comp.**24**(1970), 877–891. MR**0301894**, https://doi.org/10.1090/S0025-5718-1970-0301894-X**[3]**I. Barrodale, M. J. D. Powell & F. D. K. Roberts,*The Differential Correction Algorithm for Rational**Approximation*, Math. Report No. 54, University of Victoria, Victoria, British Columbia, 1971.**[4]**E. W. Cheney,*Introduction to approximation theory*, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR**0222517****[5]**E. W. Cheney and H. L. Loeb,*Two new algorithms for rational approximation*, Numer. Math.**3**(1961), 72–75. MR**0121965**, https://doi.org/10.1007/BF01386002**[6]**E. W. Cheney and H. L. Loeb,*On rational Chebyshev approximation*, Numer. Math.**4**(1962), 124–127. MR**0152108**, https://doi.org/10.1007/BF01386303**[7]**E. W. Cheney and T. H. Southard,*A survey of methods for rational approximation, with particular reference to a new method based on a forumla of Darboux*, SIAM Rev.**5**(1963), 219–231. MR**0158531**, https://doi.org/10.1137/1005065**[8]**Charles B. Dunham,*Convergence problems in Maehly’s second method*, J. Assoc. Comput. Mach.**12**(1965), 181–186. MR**0181083**, https://doi.org/10.1145/321264.321268**[9]**Charles B. Dunham,*Convergence problems in Maehly’s second method. II*, J. Assoc. Comput. Mach.**13**(1966), 108–113. MR**0188680**, https://doi.org/10.1145/321312.321320**[10]**George E. Forsythe and Cleve B. Moler,*Computer solution of linear algebraic systems*, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1967. MR**0219223****[11]**W. Fraser & J. F. Hart, "On the computation of rational approximations to continuous functions,"*Comm. Assoc. Comput. Mach.*, v. 5, 1962, pp. 401-403.**[12]**Saul I. Gass,*Linear programming. Methods and applications*, Third edition, McGraw-Hill Book Co., New York-London-Toronto, Ont., 1969. MR**0266606****[13]**H. L. Loeb,*On Rational Fraction Approximations at Discrete Points*, Convair Astronautics, Math. Preprint No. 9, 1957.**[14]**Henry L. Loeb,*Algorithms for Chebyshev approximations using the ratio of linear forms*, J. Soc. Indust. Appl. Math.**8**(1960), 458–465. MR**0119383****[15]**Hans J. Maehly,*Methods for fitting rational approximations. II, III*, J. Assoc. Comput. Mach.**10**(1963), 257–277. MR**0157474**, https://doi.org/10.1145/321172.321173**[16]**M. R. Osborne and G. A. Watson,*An algorithm for minimax approximation in the nonlinear case*, Comput. J.**12**(1969/1970), 63–68. MR**0245314**, https://doi.org/10.1093/comjnl/12.1.63**[17]**Anthony Ralston,*A first course in numerical analysis*, McGraw-Hill Book Co., New York-Toronto-London, 1965. MR**0191070****[18]**John R. Rice,*The approximation of functions. Vol. 2: Nonlinear and multivariate theory*, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969. MR**0244675****[19]**Theodore J. Rivlin,*An introduction to the approximation of functions*, Blaisdell Publishing Co. Ginn and Co., Waltham, Mass.-Toronto, Ont.-London, 1969. MR**0249885****[20]**G. A. Watson,*On an algorithm for nonlinear minimax approximation*, Comm. ACM**13**(1970), 160–162. MR**0286485**, https://doi.org/10.1145/362052.362056**[21]**Helmut Werner,*Tschebyscheff-Approximation im Bereich der rationalen Funktionen bei Vorliegen einer guten Ausgangsnäherung*, Arch. Rational Mech. Anal.**10**(1962), 205–219 (German). MR**0144448**, https://doi.org/10.1007/BF00281188

Retrieve articles in *Mathematics of Computation*
with MSC:
65D15

Retrieve articles in all journals with MSC: 65D15

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1973-0331719-0

Keywords:
Rational approximation,
linear programming

Article copyright:
© Copyright 1973
American Mathematical Society