Hybrid rational function approximation and its accuracy analysis

DOI10.1023/A:1009906513972MaRDI QIDQ5926518zbMATH OpenOpenAlexFDO

Authors Hiroshi Kai, M.-T. Noda

Publication date 7 October 2001

Published in Reliable Computing (Search for Journal in Brave)

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

zbMATH Keywords

algorithmrational interpolation in real domain

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Numerical interpolation (65D05)

Review text

The authors present two step algorithms for rational interpolation of functions. First they compute the rational interpolant. Next they determine and remove an approximate common factor from its numerator and denominator removing by this way the undesirable singularity of interpolant. The accuracy of three numerical algorithms is compared.

Recommendations

• Approximation by rational functions
• A new formal approach to the rational interpolation problem
• Some New Aspects of Rational Interpolation
• The algebraic method of rational interpolation
• A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials

Cited in

(3)

• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
• Overdetermined Weierstrass iteration and the nearest consistent system
• A new approach to the rational interpolation problem: The vector case

This page was built for publication: Hybrid rational function approximation and its accuracy analysis

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