Rate of convergence of the discrete Pólya algorithm

DOI10.1016/0021-9045(90)90070-7zbMath0692.41028OpenAlexW2101851340MaRDI QIDQ583535

A. G. Egger, Robert Huotari

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0021-9045(90)90070-7

zbMATH Keywords

linear programmingextrapolatory schemesPólya's algorithmstrict uniform approximation

Mathematics Subject Classification ID

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

Related Items (11)

The Pólya algorithm on tubular sets ⋮ Large data limit for a phase transition model with the p-Laplacian on point clouds ⋮ The linear discrete Pólya algorithm ⋮ Asymptotic behaviour of best \(l_p\)-approximations from affine subspaces ⋮ Polya properties in ⋮ Leximin optimality and fuzzy set-theoretic operations. ⋮ 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

• The Pólya algorithm on convex sets
• Dependence on p of the best \(L^ p\) approximation operator
• The Polya algorithm on cylindrical sets
• On the convergence of Polya's algorithm
• Natural choice of \(L_ 1-\)approximants
• Approximation of norms
• Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
• Approximations in $L^p $ and Chebyshev Approximations

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