The linear discrete Pólya algorithm

DOI10.1016/0893-9659(95)00080-AzbMath0840.41021OpenAlexW2016156929MaRDI QIDQ1908976

Miguel Marano, J. N. Ureña

Publication date: 26 June 1996

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(95)00080-a

zbMATH Keywords

rate of convergencePólya algorithmstrict minimum

Mathematics Subject Classification ID

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

Related Items (7)

Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces ⋮ Taylor expansion of best \(l_{p}\)-approximations about \(p\) = 1 ⋮ Rate of convergence of the linear discrete Pólya algorithm ⋮ 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
• Rate of convergence of the discrete Pólya algorithm
• The Polya algorithm on cylindrical sets
• Tchebycheff approximation in a compact metric space
• Approximations in $L^p $ and Chebyshev Approximations

This page was built for publication: The linear discrete Pólya algorithm