On the convergence of Polya's algorithm

DOI10.1016/0021-9045(80)90015-5zbMath0459.41019OpenAlexW2058417999MaRDI QIDQ1152053

András Kroó

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0021-9045(80)90015-5

zbMATH Keywords

modulus of continuityalgorithms of computationTchebycheff norm

Mathematics Subject Classification ID

Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Related Items (2)

Dependence on p of the best \(L^ p\) approximation operator ⋮ Rate of convergence of the discrete Pólya algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The correctness problem for best approximations by trigonometric polynomials in the class \(W^r_0H[\omega _c\)]
• A comparison of uniform and discrete polynomial approximation
• Approximation of norms
• On the modulus of continuity of the operator of best approximation in the space of continuous functions
• Some theorems on Cebysev approximation
• Least pth Power Polynomials on a Finite Point Set
• Least pth Power Polynomials on a Real Finite Point Set

This page was built for publication: On the convergence of Polya's algorithm