Abstract
Best one-sided minimax approximations from above on an interval by alternating families have an alternating characterization and may be computed by a simple modification of the classical Remez algorithm for ordinary Chebyshev approximation.
Zusammenfassung
Beste einseitige Minimax-Approximationen von oben auf einem Intervall mit Hilfe von alternierenden Familien besitzen eine Charakterisierung als Alternanten. Die Approximationen können durch eine einfache Abänderung des klassischen Remez Algorithmus für gewöhnliche Tschebyscheff-Approximationen berechnet werden.
This is a preview of subscription content, log in via an institution to check access.
References
Dunham, C. B.: Chebyshev approximation with respect to a weight function. J. Approximation Theory2, 223–232 (1969).
Dunham, C. B.: Alternating Chebyshev approximation. Trans. Amer. Math. Soc.178, 95–109 (1973).
Dunham, C. B.: Alternating minimax approximation with unequal restraints. J. Approximation Theory10, 199–205 (1974).
Dunham, C. B.: Diserete Chebyshev approximation: alternation and the Remez algorithm. Z. Angew. Math. Mech.58, 326–328 (1979).
Meinardus, G.: Approximation of functions. Berlin-Heidelberg-New York: Springer 1967.
Rice, J.: The approximation of functions, Vol. 2. Reading, Mass.: Addison-Wesley 1969.
Dunham, C. B.: Remez algorithm for Chebyshev approximation with interpolation. Computing28, 75–78 (1982).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dunham, C.B. The one-sided Remez algorithm. Computing 30, 275–278 (1983). https://doi.org/10.1007/BF02253898
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02253898