The effects of rounding errors in the nodes on barycentric interpolation
From MaRDI portal
Publication:504169
DOI10.1007/S00211-016-0798-XzbMATH Open1357.65017arXiv1309.7970OpenAlexW1812460224MaRDI QIDQ504169FDOQ504169
Authors: Walter F. Mascarenhas, André Pierro de Camargo
Publication date: 25 January 2017
Published in: Numerische Mathematik (Search for Journal in Brave)
Abstract: We analyze the effects of rounding errors in the nodes on barycentric interpolation. These errors are particularly relevant for the first barycentric formula with the Chebyshev points of the second kind. Here, we propose a method for reducing them.
Full work available at URL: https://arxiv.org/abs/1309.7970
Recommendations
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- Roundoff errors for polynomial evaluation by a family of formulae
- The numerical stability of barycentric Lagrange interpolation
- On barycentric interpolation. II. Grünwald-Marcinkiewicz type theorems
- On the numerical stability of Newton's formula for Lagrange interpolation
Cites Work
- Title not available (Why is that?)
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- Accuracy and Stability of Numerical Algorithms
- Rational functions for guaranteed and experimentally well-conditioned global interpolation
- Barycentric rational interpolation with no poles and high rates of approximation
- The numerical stability of barycentric Lagrange interpolation
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- The effects of rounding errors in the nodes on barycentric interpolation
- On the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
- A floating-point technique for extending the available precision
- Bounding the Lebesgue constant for Berrut's rational interpolant at general nodes
- Polynomial Interpolation: Lagrange versus Newton
- Method of Lagrangian curvilinear interpolation
Cited In (11)
- On barycentric interpolation. II. Grünwald-Marcinkiewicz type theorems
- Rounding error analysis of divided differences schemes: Newton's divided differences; Neville's algorithm; Richardson extrapolation; Romberg quadrature; etc.
- On the numerical stability of Floater-Hormann's rational interpolant
- On the numerical stability of Newton's formula for Lagrange interpolation
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- The effects of rounding errors in the nodes on barycentric interpolation
- The stability of extended Floater-Hormann interpolants
- Meshfree approach for solving multi-dimensional systems of Fredholm integral equations via barycentric Lagrange interpolation
- On the condition number of Newton interpolation: Chebyshev points and monotonically ordering
- Roundoff errors for polynomial evaluation by a family of formulae
- Numerical algorithm based on extended barycentric Lagrange interpolant for two dimensional integro-differential equations
Uses Software
This page was built for publication: The effects of rounding errors in the nodes on barycentric interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504169)