On the convergence of Polya's algorithm

DOI10.1016/0021-9045(80)90015-5MaRDI QIDQ1152053zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3161329 (Why is no real title available?)
• scientific article; zbMATH DE number 3202684 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• A comparison of uniform and discrete polynomial approximation
• Approximation of norms
• Least pth Power Polynomials on a Finite Point Set
• Least pth Power Polynomials on a Real Finite Point Set
• On the modulus of continuity of the operator of best approximation in the space of continuous functions
• Some theorems on Cebysev approximation
• The correctness problem for best approximations by trigonometric polynomials in the class \(W^r_0H[\omega ]_c\)

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152053)