Approximation constants in equidistant Lagrange interpolation
In a previous paper [Arch. Math. 74, 385-391 (2000; Zbl 0962.41001)] the author established estimations from below and from above for \(L_n(|x|^\alpha,0)\), \(n=2m-1\), \(m\in N\), \(0\leq\alpha\leq 1\). He proved the double inequality \[ \frac 2{\pi}\frac 1{n^{\alpha}}\leq L_n(|x|^\alpha,0) \leq \frac 1{n^{\alpha}}, \] where both constants \(2/\pi\) and \(1\) are the best possible. In this paper he gives a stronger form of this theorem finding the limit of \( n^{\alpha}L_n(|x|^\alpha,0)\), when \(n=2m-1 \to \infty\) for \(\alpha\in(0,1]\).
- On Lagrange interpolatory parabolas to \(|x|^{\alpha}\) at equally spaced nodes
- On Lagrange interpolation with equidistant nodes
- On the approximation of certain functions by interpolating polynomials
- On Lagrange interpolation for \(|x|^\alpha(0<\alpha<1)\)
- The Lebesgue constant for Lagrange interpolation on equidistant nodes
This page was built for publication: Approximation constants in equidistant Lagrange interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933694)