References
Achieser, N. I.: Vorlesungen über Approximationstheorie. Berlin: Akademie-Verlag 1953.
Hastings, C.: Approximations for Digital Computers. Princeton: University Press 1955.
Selfridge, R. G.: Approximation with Least Maximum Error. Pacific J. Math.3, No. 1, 247–255 (1953).
Motzkin, Th.: Approximation by Curves of a Unisolvent Family. Bull. Amer. Math. Soc.55, 789–793 (1949).
Remes, E.: Sur le calcul effecitif des polynomes d'approximation deTchebycheff. C. R. Acad. Sci. Paris199, 337–340 (1934).
Barth, W.: Ein Iterationsverfahren zur Approximation durch Polynome. Z. angew. Math. u. Mech.38, 258–260 (1958).
Novodvorskiì, E. P., andI. S. Pinsker: Process of Equating Maxima. [Russian.] Uspehi Mat. Nauk6, No. 6, 174–181 (1951).
Murnaghan, F. D., andJ. W. Wrench. The Approximation of Differentiable Functions by Polynomials. David Taylor Model Basin Report 1175, April 1958.
Murnaghan, F. D., andJ. W. Wrench: The Determination of the Chebyshev Approximating Polynomial for a Differentiable Function. Math. Tables and Other Aids to Computation13, No. 67, 185–193 (July 1959).
Stiefel, E. L.: Numerical Methods of Tchebycheff Approximation. In the collection “On Numerical Approximation” edit. byR. E. Langer, pp. 217 to 232. Madison 1959.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Veidinger, L. On the numerical determination of the best approximations in the Chebyshev sense. Numer. Math. 2, 99–105 (1960). https://doi.org/10.1007/BF01386215
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01386215