Hostname: page-component-6bf8c574d5-mggfc Total loading time: 0 Render date: 2025-02-14T23:35:15.509Z Has data issue: false hasContentIssue false
  • English
  • Français

Hermite-Fejer interpolation at the ‘practical’ Chebyshev nodes

Published online by Cambridge University Press:  17 April 2009

R.D. Riess
R.D. Riess
Affiliation:
Department of Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Berman has raised the question in his work of whether Hermite-Fejér interpolation based on the so-called “practical” Chebyshev points, , 0(1)n, is uniformly convergent for all continuous functions on the interval [−1, 1]. In spite of similar negative results by Berman and Szegö, this paper shows this result is true, which is in accord with the great similarities of Lagrangian interpolation based on these points versus the points , 1(1)n.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 9 , Issue 3 , December 1973 , pp. 379 - 390
Copyright
Copyright © Australian Mathematical Society 1973

References

[1]Berman, D.L., “A study of the Hermite-Fejér interpolation process”, Soviet Math. Dokl. 10 (1969), 813–816.Google Scholar
[2]Berman, D.L., “Extended Hermite-Fejér interpolation processes diverging everywhere”, Soviet Math. Dokl. 11 (1970), 830–833.Google Scholar
[3]Cheney, E.W., Introduction to approximation theory (McGraw-Hill, New York, 1966).Google Scholar
[4]Davis, Philip J., Interpolation and approximation (Blaisdell, New York, Toronto, London, 1963; reprinted, 1965).Google Scholar
[5]Fejér, Leopold, “Ueber Interpolation”, Nachr. K. Ges. Wiss. Göttingen, Math.-Phys. Kl. 1916, 66–91.Google Scholar
[6]Goldstein, Allen A., Constructive real analysis (Harper and Row, New York, Evanston, London; John Weatherhill, Tokyo; 1967).Google Scholar
[7]Salzer, H.E., “Lagrangian interpolation at the Chebyshev points xn, v ≡ cos(vπ/n), v = 0(1)n; some unnoted advantages”, Computer J. 15 (1972), 156–159.CrossRefGoogle Scholar
[8]Snyder, Martin Avery, Chebyshev methods in numerical approximation (Prentice-Hall, Englewood Cliffs, New Jersey, 1966).Google Scholar
[9]Szegö, Gabon, Orthogonal polynomials (Colloquium Publ. 23. Amer. Math. Soc., New York, 1939; revised edition 1959, reprinted with corrections 1967).Google Scholar