On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity
DOI10.1137/15M1025281zbMath1342.65084arXiv1411.7746OpenAlexW2963568012MaRDI QIDQ5739967
Publication date: 7 July 2016
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7746
numerical examplesconvergence ratepolynomial interpolationPeano kernellimited regularityChebyshev pointGauss-Jacobi pointJacobi-Gauss-Lobatto pointstrongly normal point systemWainerman's lemma
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)
Related Items (13)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error bounds for approximation in Chebyshev points
- A method for numerical integration on an automatic computer
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- On the Bernstein conjecture in approximation theory
- Uniform convergence of Lagrange interpolation based on the Jacobi nodes
- Two results on polynomial interpolation in equally spaced points
- Lagrange interpolation for functions of bounded variation
- Lagrangesche Interpolation und die zugehörigen konjugierten Punkte
- Infinite-dimensional compressed sensing and function interpolation
- Lagrange interpolation of functions of generalized bounded variation
- The Bernstein constant and polynomial interpolation at the Chebyshev nodes.
- One-sided convergence conditions of Lagrange interpolation based on Jacobi-type weights
- Jackson order of approximation by Lagrange interpolation. II
- Chebfun and numerical quadrature
- Fehlerfortpflanzung bei Interpolation
- Auswertung der Normen von Interpolationsoperatoren
- On interpolation. III: Interpolatory theory of polynomials
- On the theory of interpolation
- $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing
- Hermite-Fejér type interpolations. III
- Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
- Problems and results on the theory of interpolation. II
- Spectral Methods for Time-Dependent Problems
- Numerical Methods in Scientific Computing, Volume I
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- New Quadrature Formulas from Conformal Maps
- New Inequalities for the Zeros of Jacobi Polynomials
- ϱ-normal point systems
- Lagrange interpolation for continuous functions of bounded variation
- On the Lebesgue Function for Polynomial Interpolation
- Spectral Methods in MATLAB
- Barycentric Lagrange Interpolation
- The numerical stability of barycentric Lagrange interpolation
- Die allgemeine newtonsche Quadraturformel und Quadraturformeln für Stieltjesintegrale.
- Accuracy and Stability of Numerical Algorithms
- On the Convergence Rates of Gauss and Clenshaw--Curtis Quadrature for Functions of Limited Regularity
- The Fast Implementation of Higher Order Hermite--Fejér Interpolation
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- On the convergence rates of Legendre approximation
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Error Estimation in the Clenshaw-Curtis Quadrature Formula
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- Functional analysis
This page was built for publication: On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity