A matrix for determining lower complexity barycentric representations of rational interpolants

DOI10.1023/A:1019180807534MaRDI QIDQ1587022zbMATH OpenOpenAlexFDO

Authors Jean-Paul Berrut

Publication date 22 November 2000

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019180807534

zbMATH Keywords

numerical examplesalgorithmrational interpolationnumerical complexity and stability

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by rational functions (41A20)

Recommendations

• Matrices for the direct determination of the barycentric weights of rational interpolation
• Fast and stable computation of the barycentric representation of rational interpolants
• scientific article; zbMATH DE number 992633
• scientific article; zbMATH DE number 1552697
• Properties of a barycentric rational interpolant
• The Conditioning of a Linear Barycentric Rational Interpolant
• Recent advances in linear barycentric rational interpolation
• On the numerical stability of linear barycentric rational interpolation
• An iterative approach to barycentric rational Hermite interpolation
• scientific article; zbMATH DE number 2204733

Cited in

(5)

• The AAA algorithm for rational approximation
• An Extension of the Floater–Hormann Family of Barycentric Rational Interpolants
• On the denominator values and barycentric weights of rational interpolants
• Fast and stable computation of the barycentric representation of rational interpolants
• Rational Bases and Generalized Barycentrics

This page was built for publication: A matrix for determining lower complexity barycentric representations of rational interpolants

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