Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

On the conditional equivalence of two starting methods for the second algorithm of Remez


Author: R. E. Huddleston
Journal: Math. Comp. 28 (1974), 569-572
MSC: Primary 65D15
MathSciNet review: 0341804
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D15

Retrieve articles in all journals with MSC: 65D15


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1974-0341804-6
Keywords: Approximation by rational functions, min-max rational approximations, Remez algorithm, starting procedures for min-max rational approximations
Article copyright: © Copyright 1974 American Mathematical Society