Discretization for uniform polynomial approximation

DOI10.1016/0021-9045(84)90117-5zbMath0532.41008OpenAlexW1981401979MaRDI QIDQ788927

Robert J. Whitley

Publication date: 1984

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

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

zbMATH Keywords

discretizationMarkov's inequalityBernstein's inequality

Mathematics Subject Classification ID

Approximation by polynomials (41A10)

Related Items (1)

Bernstein's asymptotic best bound for the kth derivative of a polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of uniform and discrete polynomial approximation
• Markov and Bernstein's inequalities and compact and strictly singular operators
• Some new characterizations of the Chebyshev polynomials
• Best approximation with respect to nearby norms
• Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
• Approximation of norms
• Approximation by alternating families on subsets
• Least pth Power Polynomials on a Finite Point Set
• Convergence of Approximating Polynomials
• A note on discrete Čebysev approximation
• Rate of Convergence of Discretization in Chebyshev Approximation
• On the Rate of Convergence of Discretization in Chebyshev Approximation
• Efficiency of Chebyshev Approximation on Finite Subsets
• A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
• Inequalities for the Derivatives of Polynomials

This page was built for publication: Discretization for uniform polynomial approximation