zbMATH — the first resource for mathematics

Rational Chebyshev approximation by Remes’ algorithms. (English) Zbl 0133.39101

Full Text: DOI EuDML
[1] Achieser, N. I.: Theory of Approximation (translated byC. J. Hyman). New York: Frederick Ungar Publ. Co. 1956. · Zbl 0072.28403
[2] Fraser, W., andJ. F. Hart: On the Computation of Rational Approximations to Continuous Functions. Comm. ACM5, 401-403 (1962). · Zbl 0107.33801 · doi:10.1145/368273.368578
[3] Novodvorskii, E. N., andI. S. Pinsker: On a Process of Equalization of Maxima. Uspehi Mat. Nauk.6, 174-181 (1951) (translation byA. Shenitzer available from New York University library).
[4] Remes, E.: Sur le Calcul Effectif des Polynomes d’Approximation de Tchebichef. C. R. Acad. Sci. Paris96, 337-340 (1934). · Zbl 0010.01702
[5] Rice, J. R.: The Characterization of Best Nonlinear Approximations. Trans. Amer. Math. Soc.96, 322-340 (1960). · Zbl 0146.08204 · doi:10.1090/S0002-9947-1960-0117490-3
[6] ?: The Approximation of Functions, vol. 1. Reading, Mass.: Addison-Wesley 1964. · Zbl 0152.06303
[7] Stoer, J.: A Direct Method for Chebyshev Approximation by Rational Functions. J. Assoc. Comput. Mach.11, 59-69 (1964). · Zbl 0133.09002
[8] Tornheim, L.: Onn-parameter Families of Functions and Associated Convex Functions. Trans. Amer. Math. Soc.69, 457-467 (1950). · Zbl 0040.02901
[9] Werner, H.: Tschebyscheff-Approximationen im Bereich der rationalen Funktionen bei Vorliegen einer guten Ausgangsn?herung. Arch. Rat. Mech. Anal.10, 205-219 (1962). · Zbl 0171.37404 · doi:10.1007/BF00281188
[10] ?: Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen. Arch. Rat. Mech. Anal.11, 368-384 (1962). · Zbl 0171.37501 · doi:10.1007/BF00253944
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.