Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures

DOI10.1016/0021-9045(84)90033-9zbMath0559.41022OpenAlexW2062011358MaRDI QIDQ2266195

Bruce L. Chalmers, Mohamed S. Bani

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0021-9045(84)90033-9

zbMATH Keywords

Remez algorithmiterative Hilbert space techniques

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

The Hausdorff nearest circle to a convex compact set in the plane, Convex \(L^ p\) approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of nearest points in the \(L^ p\), p even, and \(L^ \infty\) norms. I
• The Remez Exchange Algorithm for Approximation With Linear Restrictions
• A Moment Problem in L 1 Approximation
• Convex \(L^ p\) approximation