Adaptive Polynomial Interpolation on Evenly Spaced Meshes

DOI10.1137/050625667zbMath1133.65007MaRDI QIDQ5432388

Martin Berzins

Publication date: 3 January 2008

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/625c7b34e789b65c7a14ca10703a23912d88413b

zbMATH Keywords

numerical results; divided differences; adaptive polynomial interpolation; data-bounded polynomials; Runge's function

Mathematics Subject Classification ID

65D05: Numerical interpolation

65D25: Numerical differentiation

Related Items

Structure-Preserving Function Approximation via Convex Optimization, A new method for Chebyshev polynomial interpolation based on cosine transforms, A new class of nonlinear monotone Hermite interpolants, On the constrained mock-Chebyshev least-squares, Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation, A nonlinear algorithm for monotone piecewise bicubic interpolation, ENO reconstruction and ENO interpolation are stable, Nonlinear data-bounded polynomial approximations and their applications in ENO methods, AAA interpolation of equispaced data, ENO-based high-order data-bounded and constrained positivity-preserving interpolation

Uses Software

• pchip