The Pólya algorithm on convex sets

DOI10.1016/0021-9045(89)90110-XzbMath0692.41027OpenAlexW1988600973MaRDI QIDQ583534

A. G. Egger, Robert Huotari

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0021-9045(89)90110-x

zbMATH Keywords

best p-norm approximationsstrict uniform best approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Related Items

The Pólya algorithm on tubular sets ⋮ Polya properties in ⋮ Rate of convergence of the discrete Pólya algorithm ⋮ Rate of convergence of the Pólya algorithm from polyhedral sets

Cites Work

• Unnamed Item
• Dependence on p of the best \(L^ p\) approximation operator
• The Polya algorithm on cylindrical sets
• Natural choice of \(L_ 1-\)approximants
• Approximations in $L^p $ and Chebyshev Approximations

This page was built for publication: The Pólya algorithm on convex sets