Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Rate of convergence of the Pólya algorithm from polyhedral sets

From MaRDI portal
Publication:2567267
Jump to:navigation, search

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


zbMATH Keywords

rate of convergencePólya algorithmpolyhedral setstrict uniform approximationbest discrete \({l_p}\)-approximation


Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)




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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2567267&oldid=15326167"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 07:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki