The Lebesgue constant for Lagrange interpolation on equidistant nodes

1992 ◽  
Vol 61 (1) ◽  
pp. 111-115 ◽  
Author(s):  
T. M. Mills ◽  
S. J. Smith
2004 ◽  
Vol 20 (4) ◽  
pp. 323-331 ◽  
Author(s):  
A. Eisinberg ◽  
G. Fedele ◽  
G. Franzè

2000 ◽  
Vol 62 (3) ◽  
pp. 357-368 ◽  
Author(s):  
Michael Revers

A well-known result due to S.N. Bernstein is that sequence of Lagrange interpolation polynomials for |x| at equally spaced nodes in [−1, 1] diverges everywhere, except at zero and the end-points. In this paper we present a quantitative version concerning the divergence behaviour of the Lagrange interpolants for |x|3 at equidistant nodes. Furthermore, we present the exact rate of convergence for the interpolatory parabolas at the point zero.


2016 ◽  
Vol 8 (4) ◽  
pp. 118 ◽  
Author(s):  
Maha Youssef ◽  
Hany A. El-Sharkawy ◽  
Gerd Baumann

This paper gives an explicit construction of multivariate Lagrange interpolation at Sinc points. A nested operator formula for Lagrange interpolation over an $m$-dimensional region is introduced. For the nested Lagrange interpolation, a proof of the upper bound of the error is given showing that the error has an exponentially decaying behavior. For the uniform convergence the growth of the associated norms of the interpolation operator, i.e., the Lebesgue constant has to be taken into consideration. It turns out that this growth is of logarithmic nature $O((log n)^m)$. We compare the obtained Lebesgue constant bound with other well known bounds for Lebesgue constants using different set of points.


2016 ◽  
Vol 59 ◽  
pp. 71-78 ◽  
Author(s):  
Chongyang Deng ◽  
Shankui Zhang ◽  
Yajuan Li ◽  
Wenbiao Jin ◽  
Yi Zhao

Sign in / Sign up

Export Citation Format

Share Document