Rate of convergence of the linear discrete Pólya 1-algorithm

DOI10.1006/jath.2002.3727zbMath1374.41051OpenAlexW4245115057MaRDI QIDQ1680866

J. Fernández-Ochoa, Juan Martínez Moreno, Juan Navas, José María Quesada

Publication date: 17 November 2017

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

Full work available at URL: https://doi.org/10.1006/jath.2002.3727

zbMATH Keywords

rate of convergencebest approximationPólya algorithmnatural approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25)

Related Items

Taylor expansion of best \(l_{p}\)-approximations about \(p\) = 1

Cites Work

• The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
• Natural choice of \(L_ 1-\)approximants
• Rate of convergence of the discrete Pólya-1 algorithm
• Rate of convergence of the linear discrete Pólya algorithm
• Unnamed Item
• Unnamed Item