For f # C [&1, 1], let H m, n ( f, x) denote the (0, 1, ..., m) Hermite Feje r (HF) interpolation polynomial of f based on the Chebyshev nodes. That is, H m, n ( f, x) is the polynomial of least degree which interpolates f (x) and has its first m derivatives vanish at each of the zeros of the nth Ch
On the Positivity of the Fundamental Polynomials for Generalized Hermite–Fejér Interpolation on the Chebyshev Nodes
✍ Scribed by Simon J. Smith
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 90 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that the fundamental polynomials for (0, 1, ..., 2m+1) Hermite Feje r interpolation on the zeros of the Chebyshev polynomials of the first kind are nonnegative for &1 x 1, thereby generalising a well-known property of the original Hermite Feje r interpolation method. As an application of the result, Korovkin's theorem on monotone operators is used to present a new proof that the (0, 1, ..., 2m+1) Hermite Feje r interpolation polynomials of f # C[&1, 1], based on n Chebyshev nodes, converge uniformly to f as n Ä .
1999 Academic Press H (r) m, n (X, f, x k, n )=$ 0, r f (x k, n ), 1 k n, 0 r m.
📜 SIMILAR VOLUMES
It is shown that the interval where the nodes of a ``good'' interpolation polynomial are situated is strongly connected with the Mhaskar Rahmanov Saff number. 2000 Academic Press \* n (x)=w(x) : n k=0 |l k (x)| w(x k ) ,