Improved lower and upper bounds in polynomial Chebyshev approximation based on a pre-iteration formula

DOI10.1016/0021-9045(81)90114-3zbMath0478.41007OpenAlexW2016362580MaRDI QIDQ1161104

Manfred Hollenhorst

Publication date: 1981

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(81)90114-3

zbMATH Keywords

lower bounds for the approximation error, discrete approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über Tschebyscheffsche Approximationen
• The uniform approximation of polynomials by polynomials of lower degree
• Analytical Approximations to Approximations in the Chebyshev Sense
• On a Conjecture of C. W. Clenshaw

This page was built for publication: Improved lower and upper bounds in polynomial Chebyshev approximation based on a pre-iteration formula