Fast and stable computation of the barycentric representation of rational interpolants

DOI10.1007/BF02576010zbMath0904.65006OpenAlexW2006110936MaRDI QIDQ1127959

Luca Gemignani

Publication date: 19 January 1999

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02576010

zbMATH Keywords

complexityalgorithmsstabilityrational interpolationreductionblock triangular decompositionNewton basisHankel structurestepsize regulation

Mathematics Subject Classification ID

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

Related Items

A fast algorithm for generalized Hankel matrices arising in finite-moment problems, Bernstein-Bézoutian matrices, Fast and stable computation of the barycentric representation of rational interpolants, Polynomial algebra for Birkhoff interpolants

Uses Software

• na1

Cites Work

• Unnamed Item
• Unnamed Item
• On the partial realization problem
• Fast and stable computation of the barycentric representation of rational interpolants
• A new presentation of orthogonal polynomials with applications to their computation
• Rational interpolation via orthogonal plynomials
• Generalized companion matrices and matrix representations for generalized Bézoutians
• A multi-step algorithm for Hankel matrices
• How bad are Hankel matrices?
• A look-ahead algorithm for the solution of general Hankel systems
• Fast inversion of Chebyshev-Vandermonde matrices
• A fast algorithm for generalized Hankel matrices arising in finite-moment problems
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• Polynomial Interpolation: Lagrange versus Newton
• Some New Aspects of Rational Interpolation
• A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems