Backward and forward stability analysis of Neville's algorithm for interpolation and a pyramid algorithm for the computation of Lebesgue functions

DOI10.1007/S11075-021-01163-0zbMATH Open1487.65015OpenAlexW3178642434MaRDI QIDQ2118949FDOQ2118949

André Pierro de Camargo

Publication date: 23 March 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-021-01163-0

zbMATH Keywords

Lebesgue constantLebesgue functionrounding errorsNeville's algorithm

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical interpolation (65D05) Algorithms for approximation of functions (65D15)

Cites Work

• On a certain class of Lebesgue constants
• Two results on polynomial interpolation in equally spaced points
• Accuracy and Stability of Numerical Algorithms
• Rounding error analysis of divided differences schemes: Newton's divided differences; Neville's algorithm; Richardson extrapolation; Romberg quadrature; etc.
• On the numerical stability of Newton's formula for Lagrange interpolation

Uses Software

• mctoolbox

This page was built for publication: Backward and forward stability analysis of Neville's algorithm for interpolation and a pyramid algorithm for the computation of Lebesgue functions

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