A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices

DOI10.1137/0614053MaRDI QIDQ3136546zbMATHOpenAlexFDO

Authors Stan Cabay, Ron Meleshko

Publication date 18 October 1993

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0614053

zbMATH Keywords

Experimental resultsinversion of Toeplitz matricesPadé approximantsalgorithm NPADEinversion of Hankel matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms for approximation of functions (65D15) Padé approximation (41A21)

Recommendations

• scientific article; zbMATH DE number 17943
• An algorithm for computing a Padé approximant with minimal degree denominator
• scientific article; zbMATH DE number 3883495
• Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
• scientific article; zbMATH DE number 1043087

Cited in

(31)

• Hankel minors and Padé approximations
• A fast Hankel solver based on an inversion formula for Loewner matrices
• Numerical reconstruction of convex polytopes from directional moments
• Algebraic properties of robust Padé approximants
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
• Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
• scientific article; zbMATH DE number 3883495 (Why is no real title available?)
• Recursiveness in matrix rational interpolation problems
• Inversion of a block Löwner matrix
• A lookahead algorithm for the solution of block Toeplitz systems
• Breakdowns in the implementation of the Lánczos method for solving linear systems
• Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations
• A note on the structured perturbation analysis for the inversion formula of Toeplitz matrices
• The inverses of block Toeplitz matrices
• A stabilized superfast solver for indefinite Hankel systems
• High performance algorithms for Toeplitz and block Toeplitz matrices
• Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
• The stable computation of formal orthogonal polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Solving Toeplitz systems after extension and transformation
• Inversion of mosaic Hankel matrices via matrix polynomial systems
• Look-ahead methods for block Hankel systems
• The multipoint Padé table and general recurrences for rational interpolation
• Generalized inverse matrix Padé approximation on the basis of scalar products
• Fast and stable computation of the barycentric representation of rational interpolants
• A look-ahead method for computing vector Padé-Hermite approximants
• A generalized minimal partial realization problem
• VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems
• scientific article; zbMATH DE number 17943 (Why is no real title available?)
• A look-ahead algorithm for the solution of general Hankel systems

This page was built for publication: A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices

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