Rational interpolation and the Euclidean algorithm

DOI10.1016/0024-3795(88)90185-1MaRDI QIDQ1104500zbMATH OpenOpenAlexFDO

Authors A. C. Antoulas

Publication date 1988

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(88)90185-1

zbMATH Keywords

Cauchy interpolation problemEuclidean algorithmPadé approximation problem

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by rational functions (41A20)

Review text

A general framework, leading to a parametrization of all rational functions which interpolate a given set of pairs of points, is investigated. This framework is based on the Euclidean algorithm. The resulting parametrization has the property that it keeps track of the complexity of both the numerator and of the denominator polynomials of the interpolating functions. The Cauchy interpolation problem and the related Padé approximation problem can be treated within this framework.

Recommendations

• A recursive algorithm on rational interpolation
• scientific article; zbMATH DE number 4054895
• The algebraic method of rational interpolation
• Interpolation by rational functions
• The rational interpolation problem revisited
• Number-theoretic algorithms of interpolation
• scientific article; zbMATH DE number 4078605
• scientific article; zbMATH DE number 3977601
• An abstract approach to rational interpolation
• scientific article; zbMATH DE number 1405399

Cites work

• Approximants de Padé
• scientific article; zbMATH DE number 3493262 (Why is no real title available?)
• scientific article; zbMATH DE number 3796655 (Why is no real title available?)
• scientific article; zbMATH DE number 3343200 (Why is no real title available?)
• scientific article; zbMATH DE number 3399806 (Why is no real title available?)
• scientific article; zbMATH DE number 3019906 (Why is no real title available?)
• Interpolation with positive-real functions
• On the role of the Nevanlinna–Pick problem in circuit and system theory
• On the Scalar Rational Interpolation Problem
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis

Cited in

(24)

• Functional models in linear algebra
• A new formal approach to the rational interpolation problem
• Rational interpolation via orthogonal plynomials
• Stability and McMillan degree for rational matrix interpolants
• The multipoint Padé table and general recurrences for rational interpolation
• On the scalar rational interpolation problem
• Generalized inverse matrix Padé approximation on the basis of scalar products
• The set of unattainable points for the rational Hermite interpolation problem
• The general rational interpolation problem in the scalar case and its Hankel vector
• Nearly invariant subspaces and rational interpolation
• A general approach to multivariable recursive interpolation
• On the linearization methods for univariate Birkhoff rational interpolation
• scientific article; zbMATH DE number 3877265 (Why is no real title available?)
• scientific article; zbMATH DE number 2058003 (Why is no real title available?)
• The Neville-like form of the Fitzpatrick algorithm for rational interpolation
• Subresultants, Sylvester sums and the rational interpolation problem
• Minimal solutions of the rational interpolation problem
• A Fitzpatrick algorithm for multivariate rational interpolation
• Nevanlinna-Pick interpolation: The degenerated case
• From C^2 to C^M weighted piecewise rational interpolation
• On the solution of the minimal rational interpolation problem
• A new approach to the rational interpolation problem: The vector case
• On the problem of stable rational interpolation
• A unified approach to Loewner and Hankel matrices

This page was built for publication: Rational interpolation and the Euclidean algorithm

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