scientific article; zbMATH DE number 493027

zbMATH Open0784.65009MaRDI QIDQ4276271FDOQ4276271

Authors: Amos J. Carpenter, Richard S. Varga 

Publication date: 2 February 1994

Title of this publication is not available (Why is that?)

Recommendations

• ON A CONJECTURE OF S. BERNSTEIN IN APPROXIMATION THEORY
• On the Bernstein conjecture in approximation theory
• On the Bernstein constants of polynomial approximation
• Best uniform rational approximation of \(x^ \alpha\) on \([0,1]\).
• Best uniform rational approximation of 𝑥^{𝛼} on [0,1]

zbMATH Keywords

polynomialsbest uniform approximationRemez algorithmRichardson's extrapolation

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Cited In (10)

• Extremal polynomials and entire functions of exponential type
• Asymptotics of polynomial interpolation and the Bernstein constants
• Uniform approximation to \({}X{}^ \beta\) by Sinc functions
• On the Bernstein constants of polynomial approximation
• Scaling limits of polynomials and entire functions of exponential type
• On the Bernstein conjecture in approximation theory
• Some numerical results on best uniform rational approximation of \(x^ \alpha\) on [0,1]
• Bernstein-type constants for approximation of \(| x |^\alpha\) by partial Fourier-Legendre and Fourier-Chebyshev sums
• ON A CONJECTURE OF S. BERNSTEIN IN APPROXIMATION THEORY
• Rational interpolation of a function \(|x|^ \alpha\) with Chebyshev-Markov nodes of the first kind

This page was built for publication:

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