Optimal interpolation with polynomials having fixed roots
From MaRDI portal
Publication:1107753
DOI10.1016/0021-9045(87)90075-XzbMath0653.41004MaRDI QIDQ1107753
Publication date: 1987
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Best approximation, Chebyshev systems (41A50) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)
Related Items (6)
A lower bound on the norm of interpolation with an extended Tchebycheff system ⋮ Optimal interpolation in a general setting - a beginning ⋮ On the simultaneous approximation of derivatives by Lagrange and Hermite interpolation ⋮ Best interpolation with polynomials lacking the linear term ⋮ Optimal interpolation with exponentially weighted polynomials on an unbounded interval ⋮ A minimax problem admitting the equioscillation characterization of Bernstein and Erdös
Cites Work
- Optimal interpolation with incomplete polynomials
- A note on functions with interlacing roots
- A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
- Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
- Optimization of the norm of the Lagrange interpolation operator
- Some remarks on polynomials
This page was built for publication: Optimal interpolation with polynomials having fixed roots