A comparison of uniform and discrete polynomial approximation

DOI10.1007/BF02079348zbMath0426.41020OpenAlexW2323728092MaRDI QIDQ1136010

András Kroó

Publication date: 1979

Published in: Analysis Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02079348

zbMATH Keywords

uniform approximationdiscrete polynomial approximation

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Related Items (7)

On the convergence of Polya's algorithm ⋮ Deviation of best discrete and uniform polynomial approximants ⋮ On the uniform modulus of continuity of the operator of best approximation in the space of periodic functions ⋮ The Lipschitz constant of the operator of best approximation ⋮ Gram polynomials and the Kummer function ⋮ A note on discrete Čebysev approximation ⋮ Discretization for uniform polynomial approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of norms
• Some theorems on Cebysev approximation
• The Brauer-Manin Obstruction and III[2]
• Least pth Power Polynomials on a Finite Point Set
• A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof

This page was built for publication: A comparison of uniform and discrete polynomial approximation