The effects of rounding errors in the nodes on barycentric interpolation

DOI10.1007/S00211-016-0798-XMaRDI QIDQ504169zbMATH OpenOpenAlexFDO

Authors Walter F. Mascarenhas, André Pierro de Camargo

Publication date 25 January 2017

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.7970

zbMATH Keywords

numerical examplepolynomial barycentric interpolationrounding errors

Mathematics Subject Classification ID

Numerical interpolation (65D05) Roundoff error (65G50)

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.

Review text

The authors study a method that reduces the rounding errors in the nodes on polynomial barycentric interpolation. One strategy for reducing these errors is given. They describe a finite precision representation of the nodes that lead to smaller errors. Some numerical examples are given.

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

• A floating-point technique for extending the available precision
• Accuracy and Stability of Numerical Algorithms
• Barycentric rational interpolation with no poles and high rates of approximation
• Bounding the Lebesgue constant for Berrut's rational interpolant at general nodes
• scientific article; zbMATH DE number 3708924 (Why is no real title available?)
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages
• Method of Lagrangian curvilinear interpolation
• On the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
• Polynomial Interpolation: Lagrange versus Newton
• Rational functions for guaranteed and experimentally well-conditioned global interpolation
• The effects of rounding errors in the nodes on barycentric interpolation
• The numerical stability of barycentric Lagrange interpolation
• The stability of barycentric interpolation at the Chebyshev points of the second kind

Cited in

(11)

• Meshfree approach for solving multi-dimensional systems of Fredholm integral equations via barycentric Lagrange interpolation
• Rounding error analysis of divided differences schemes: Newton's divided differences; Neville's algorithm; Richardson extrapolation; Romberg quadrature; etc.
• Numerical algorithm based on extended barycentric Lagrange interpolant for two dimensional integro-differential equations
• On the numerical stability of Newton's formula for Lagrange interpolation
• On the condition number of Newton interpolation: Chebyshev points and monotonically ordering
• On the numerical stability of Floater-Hormann's rational interpolant
• 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 barycentric interpolation. II. Grünwald-Marcinkiewicz type theorems
• The stability of extended Floater-Hormann interpolants
• Roundoff errors for polynomial evaluation by a family of formulae

Describes a project that uses

Uses Software

• mctoolbox

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)