Rate of convergence of the linear discrete Pólya algorithm

DOI10.1006/jath.2000.3552zbMath0986.41016OpenAlexW2047232225MaRDI QIDQ5937257

José María Quesada, Juan Navas

Publication date: 27 May 2002

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

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

zbMATH Keywords

\(\ell^p\)-normbest approximationaffine spacePólya algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Related Items (7)

Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces ⋮ Rate of convergence of the linear discrete Pólya 1-algorithm ⋮ Taylor expansion of best \(l_{p}\)-approximations about \(p\) = 1 ⋮ Asymptotic expression of the linear discrete best \(\ell_{p}\)-approximation ⋮ The Pólya algorithm in sequence spaces ⋮ Rate of convergence of the Pólya algorithm from polyhedral sets ⋮ On best \(p\)-approximation from affine subspaces: Asymptotic expansion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rate of convergence of the discrete Pólya algorithm
• The linear discrete Pólya algorithm
• Approximations in $L^p $ and Chebyshev Approximations

This page was built for publication: Rate of convergence of the linear discrete Pólya algorithm