On the conditional equivalence of two starting methods for the second algorithm of Remez
HTML articles powered by AMS MathViewer
- by R. E. Huddleston PDF
- Math. Comp. 28 (1974), 569-572 Request permission
Abstract:
In computing best min-max rational approximations by the second algorithm of Remez (which is an iterative procedure), one must provide a starting approximation. A method proposed by Ralston and one by Werner are shown to be equivalent under reasonable conditions.References
-
R. E. Huddleston, REHRAT—A Program for Best Min-Max Rational Approximation, Report #(SCL-DR-72-370), Sandia Laboratories, Livermore, California, 1972.
- Eugene Isaacson and Herbert Bishop Keller, Analysis of numerical methods, John Wiley & Sons, Inc., New York-London-Sydney, 1966. MR 0201039
- Anthony Ralston, A first course in numerical analysis, McGraw-Hill Book Co., New York-Toronto-London, 1965. MR 0191070
- H. Werner, J. Stoer, and W. Bommas, Handbook Series Methods of Approximation: Rational Chebyshev approximation, Numer. Math. 10 (1967), no. 4, 289–306. MR 1553955, DOI 10.1007/BF02162028
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Math. Comp. 28 (1974), 569-572
- MSC: Primary 65D15
- DOI: https://doi.org/10.1090/S0025-5718-1974-0341804-6
- MathSciNet review: 0341804