On an extremal problem concerning interpolation

From MaRDI portal





Let \(x=(x_1,x_2,\dots,x_n)\), \(n\geq 2\), satisfying the conditions \(|x_k|\leq 1\), \(k=\overline{1,n}\) and \(x_k\neq x_j\) for \(k\neq j\). For \(p\in(0,\infty)\) put \(f_i(p;x):=\sum\limits_{k=1}^i 1/ \left|x_{i+1}-x_k\right |^p\), \(i=1,2,\dots,n-1\), \(F_n(p,x):=\max\limits_{1\leq i\leq n-1} f_i(p;x)\) and \(S_n(p,x)=\sum\limits_{i=1}^{n-1} f_i(p;x)\). The author proves the following evaluations: \[ \begin{alignedat}{2} &S_n(p,x)\geq n(n-1)2^{-1-p}, &&\text{ for }p<1;\\ &S_n(p,x)\geq n(n-1)\ln n/4, &&\text{ for }p=1;\text{ and}\\ &S_n(p,x)\geq (n-1)^{1+p}2^{-p}&&\text{ for }p>1.\end{alignedat} \] These inequalities are exact with equality for the equidistant knots \(x_k=(2k-n-1)/(n-1)\), \(k=1,\dots,n\). It follows that \(F_n(p,x)\geq n2^{-1-p}\) for \(p<1\), \(\geq n\ln n/4\) for \(p=1\) and \(\geq n^p4^{-p}\) for \(p>1\). This last result extends one proved by \textit{P. Erdös} [Acta Math. Hungar. 9, 381-388 (1958; Zbl 0083.29001)]. The results of this kind are important in the study of the divergence of interpolation processes.











This page was built for publication: On an extremal problem concerning interpolation

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