Asymptotics of polynomial interpolation and the Bernstein constants

DOI10.1007/s00025-021-01408-3zbMath1468.41005OpenAlexW3153098042MaRDI QIDQ2038852

Michael Revers

Publication date: 7 July 2021

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00025-021-01408-3

zbMATH Keywords

Chebyshev nodesbest uniform approximationBernstein constants

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Related Items

Bernstein-type constants for approximation of \(| x |^\alpha\) by partial Fourier-Legendre and Fourier-Chebyshev sums ⋮ On one asymptotic equality proved by Revers

Uses Software

• DLMF
• Chebfun

Cites Work

• On the Bernstein conjecture in approximation theory
• The Bernstein constant and polynomial interpolation at the Chebyshev nodes.
• On the asymptotics of polynomial interpolation to \(|x|^{\alpha}\) at the Chebyshev nodes
• Extremal polynomials and entire functions of exponential type
• On the Bernstein constants of polynomial approximation
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item