The order of Lebesgue constant of Lagrange interpolation on several intervals (Q1677542): Difference between revisions

Let (1) \(\,-1=a_0<b_0<a_1<b_1<\dots<a_s<b_1=1\) be a finite partition of the interval \([-1,1]\) and \(E_s:=\bigcup_{i=0}^s[a_i,b_i]\). Consider the Lagrange interpolation on the nodes (2) \(\, -1\leq x_n<x_{n-1}<\dots<x_1\leq 1\), \(x_k\in E_s\), \(k=1,2,\dots,n\). Denoting \(\omega_n(x):=\prod_{k=1}^n(x-x_k)\) and \( \ell_k(x):=\omega_n(x)/[(x-x_k)\omega'_n(x_k)],\) the Lebesgue function is \(\lambda_n(x,\omega_n,E_s):=\sum_{k=1}^n| \ell_k(x)| \) and the uniform norm of this function, \( \lambda_n(\omega_n,E_s):=\| \lambda_n(x,\omega_n,E_s)\|_{E_s},\) is called the Lebesgue constant. \smallskip The authors observe first that, for any system of nodes (2), the following lower estimate holds: \(\lambda_n(\omega_n,E_s)\geq c(E_s)\log n\), where \(c(E_s)\) is a constant depending on the partition (1) (Theorem 1.1). Also, for any finite partition (1) of the interval \([-1,1]\), there exists a set of nodes (2) such that \(\lambda_n(\omega_n,E_s)\leq C(E_s)\log n\) with a constant \(C(E_s)>0\) depending on the partition (1) (Theorem 2.2). \smallskip For two symmetric intervals \(E(a):=[-1,-a]\cup [a,1]\) for \(0<a<1,\) one considers the nodes \(x_{\pm k}:=\sqrt{\frac{1-a^2}2 y_k+\frac{1+a^2}2},\) where \(y_k=\cos\left(\frac{2k-1}{2n}\pi\right)\), \(k=1,2,\dots,n\). Then \( \lambda_{2n}(\omega_{2n},E(a))\leq a^{-1}\,\Lambda_n+ (1-a^2)/(8a^2),\) where \(\Lambda_n\sim \frac2n\, \log n \) is the Lebesgue constant for the Chebyshev nodes. \smallskip An upper estimate in the case of two non-symmetric intervals is also obtained.