Constrained mock-Chebyshev least squares approximation for Hermite interpolation

From MaRDI portal





The classical problem of Lagrange polynomial interpolation on a bounded interval say \([-1,1]\) is the following: In order to approximate an unknown real valued function \(f\) on \([-1,1]\) given only function evaluations at a finite number of distinct points \(X_n\) say \(x_0,x_1,...,x_n\), one computes a Lagrange interpolation polynomial of degree \(n\geq 1\), \(L_n(f)\) so that \(f(x_i)=L_{n}(f(x_i)),\, i=0,...,n\). It is folklore that if the points \(X_n\) are chosen to be equidistant say \(x_i:=-1+2i/n,\, i=0,..,n\), then approximation near the end points of \([-1,1]\) can prove disasterous for rapidly changing functions given Runge's phenomenon. One way to counter this classical problem is to approximate the functon \(f\) by a polynomial of degree \(m=[\pi\sqrt{n/2}]\) where one interpolates not at all nodes but at \(m+1\) nodes which mimic Chebyshev-Lobatto nodes \(x_{j,c}:=-\cos(j\pi/m),\, j=0,...,m\). More precisely, for \(j=0,...,m\), one computes a point \(x_j':=\min_{k=0,...,n}|x_k-x_{j,c}|.\) Such points are called mock-Chebyshev points and the interpolation process: mock-Chebyshev interpolation.\N\NThe subject of the paper under review is to study analogues of mock Chebyshev interpolation for Hermite-Fejer interpolation. The Hermite-Fejer interpolation problem is the following: Given distinct points \(X_n\) say \(x_0,x_1,...,x_n\) and values \(f(x_i)=f^{(0)}(x_i), f^{(1)}(x_i),...,f^{(k)}(x_i)\) one computes a Hermite-Fejer interpolation polynomial of degree \((k+1)(n+1)-1\), \(H_{k,n}(f)\) so that \(f^{(l)}(x_i)=H_{k,n}^{(l)}(f(x_i)),\, i=0,...,n,\, l=0,...,k\). \medskip\N\NThe paper is well written with a good set of references.



Cites work









This page was built for publication: Constrained mock-Chebyshev least squares approximation for Hermite interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288939)