Über Approximationseigenschaften differenzierter Hermitescher Interpolationspolynome mit Jacobischen Abszissen. (On the approximation properties of derived Hermite interpolation polynomials with Jacobian abscissa) (Q3786874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4050192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Über Approximationseigenschaften differenzierter Hermitescher Interpolationspolynome mit Jacobischen Abszissen. (On the approximation properties of derived Hermite interpolation polynomials with Jacobian abscissa) |
scientific article; zbMATH DE number 4050192 |
Statements
1985
0 references
Hermite interpolation polynomial
0 references
Jacobi orthogonal polynomial
0 references
uniform convergence
0 references
0.8588145971298218
0 references
0.8526691198348999
0 references
0.8498868346214294
0 references
Über Approximationseigenschaften differenzierter Hermitescher Interpolationspolynome mit Jacobischen Abszissen. (On the approximation properties of derived Hermite interpolation polynomials with Jacobian abscissa) (English)
0 references
The paper is devoted to the proof of the following convergence theorem: Let \(f\in C\) m[-1,1] and let \(H_ n[f]\) be the Hermite interpolation polynomial corresponding to the roots of the Jacobi orthogonal polynomial \(P_ n^{(\alpha,\beta)}(x)\), with parameters \(\alpha >-1\) and \(\beta >-1\). The sequence \(H_ n^{(m)}[f;x]\) converges to \(f^{(m)}(x)\), uniformly on \([-1+\delta,1]\) \((0<\delta <1/2)\) in the cases: i) \(m\geq 1\) or \(m=0\), \(\alpha >0\) and \(f^{(k)}\in lip(2\alpha +1-[2\alpha +1])\) for \(k=2m+[2\alpha +1]\) and ii) \(m=0\), \(-1<\alpha \leq 0\) and f' is continuous on [-1,1]. Similar conditions are given for the uniform convergence on \([-1+\delta,1-\delta]\) \((0<\delta <1/2)\). The proof, which is very long and technical, is based on nine lemmas.
0 references