On the theory and computation of nonperfect Padé-Hermite approximants

DOI10.1016/0377-0427(92)90206-DMaRDI QIDQ1196833zbMATH OpenOpenAlexFDO

Authors Stan Cabay, G. Labahn, Bernhard Beckermann

Publication date 16 January 1993

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(92)90206-d

zbMATH Keywords

algorithmsPadé-Hermite approximationpower seriesrational approximationSylvester matrix

Mathematics Subject Classification ID

Padé approximation (41A21) Algorithms for approximation of functions (65D15)

Review text

A Padé-Hermite approximant of type \(n = (n_ 0,n_ 1, \dots, n_ k)\) is a set of \(k + 1\) polynomials \(P_ i(z)\) having degrees bounded by the \(n_ i\) and satisfying \(A_ 0(z) P_ 0(z) + \dots + A_ k (z) P_ k (z) = O(z^{n_ 0 + n_ 1 + \dots + n_ k + k})\). The \(A_ i(z)\) are \(k + 1\) given power series. The special case \(k = 1\) and \(A_ 1(z) = -1\) gives the classical Padé approximation of a single power series. Algorithms for computing Padé-Hermite approximants require the vector of the power series \(A_ i(z)\) to be perfect. This restriction is a strong one. In the present paper, a new and fast algorithm is given which can be applied to any vector of power series. Two new types of rational approximants, the weak Padé-Hermite form and the weak Padé-Hermite fraction, are introduced and discussed.

Recommendations

• The computation of non-perfect Padé-Hermite approximants
• A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• scientific article; zbMATH DE number 3976193
• A look-ahead method for computing vector Padé-Hermite approximants

Cites work

• A general module theoretic framework for vector M-Padé and matrix rational interpolation
• A Property of Euclid’s Algorithm and an Application to Padé Approximation
• Algebraic Computations of Scaled Padé Fractions
• Algebraic methods for Toeplitz-like matrices and operators
• Approximants de Padé-Hermite. II.: Programmation
• Displacement ranks of matrices and linear equations
• scientific article; zbMATH DE number 3734290 (Why is no real title available?)
• scientific article; zbMATH DE number 3493262 (Why is no real title available?)
• scientific article; zbMATH DE number 3236968 (Why is no real title available?)
• scientific article; zbMATH DE number 3242299 (Why is no real title available?)
• scientific article; zbMATH DE number 3270061 (Why is no real title available?)
• Matrix Padé Fractions and Their Computation
• On Quadratic Approximation
• On recursiveness and related topics in linear systems
• Recurrence relations in Padé-Hermite approximation
• The Inverses of Block Hankel and Block Toeplitz Matrices
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
• Vector-valued Rational Interpolants II

Cited in

(26)

• Recurrence relations in Padé-Hermite approximation
• The computation of non-perfect Padé-Hermite approximants
• A reliable method for computing M-Padé approximants on arbitrary staircases
• Inversion components of block Hankel-like matrices
• The multipoint Padé table and general recurrences for rational interpolation
• Explicit computation of Padé-Hermite approximants
• Simultaneous Frobenius-Padé approximants
• Inversion of mosaic Hankel matrices via matrix polynomial systems
• A look-ahead method for computing vector Padé-Hermite approximants
• Algorithms for simultaneous Hermite-Padé approximations
• New representations of Padé, Padé-type, and partial Padé approximants
• scientific article; zbMATH DE number 3874606 (Why is no real title available?)
• scientific article; zbMATH DE number 4157183 (Why is no real title available?)
• scientific article; zbMATH DE number 3976193 (Why is no real title available?)
• scientific article; zbMATH DE number 4078608 (Why is no real title available?)
• scientific article; zbMATH DE number 1382576 (Why is no real title available?)
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
• An algorithm for computing a Padé approximant with minimal degree denominator
• A Viskovatov algorithm for Hermite-Padé polynomials
• Recursiveness in matrix rational interpolation problems
• A generalized minimal partial realization problem
• A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
• Programs for the approximation of real and imaginary single- and multi-valued functions by means of Hermite-Padé-approximants
• Approximants de Padé-Hermite. II.: Programmation
• Vector orthogonal polynomials

This page was built for publication: On the theory and computation of nonperfect Padé-Hermite approximants

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