Rate of convergence of the Pólya algorithm from polyhedral sets
From MaRDI portal
Publication:2567267
DOI10.1016/j.jat.2005.03.007zbMath1075.41016OpenAlexW2064026224MaRDI QIDQ2567267
Robert Huotari, Miguel Marano, Juan Navas, José María Quesada
Publication date: 29 September 2005
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2005.03.007
rate of convergencePólya algorithmpolyhedral setstrict uniform approximationbest discrete \({l_p}\)-approximation
Cites Work
- Unnamed Item
- Unnamed Item
- The Pólya algorithm on convex sets
- Rate of convergence of the discrete Pólya algorithm
- The Polya algorithm on cylindrical sets
- The Pólya algorithm on tubular sets
- The linear discrete Pólya algorithm
- Tchebycheff approximation in a compact metric space
- Approximations in $L^p $ and Chebyshev Approximations
- Rate of convergence of the linear discrete Pólya algorithm