Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 22 (1), 114-144
- https://doi.org/10.1137/s0895479897326912
Abstract
We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton--Padé, Hermite--Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given problem. Solutions for all (possibly singular) subproblems along offdiagonal paths in a solution table are also computed by stepping around singular blocks on a path corresponding to "closest" regular interpolation problems. The algorithms are suitable for computation in exact arithmetic domains where growth of coefficients in intermediate computations is a central concern. This coefficient growth is avoided by using fraction-free methods. At the same time, the methods are fast in the sense that they are at least an order of magnitude faster than existing fraction-free methods for the corresponding problems. The methods make use of linear systems having a special striped Krylov structure.Keywords
This publication has 37 references indexed in Scilit:
- Recursiveness in matrix rational interpolation problemsJournal of Computational and Applied Mathematics, 1997
- The stable computation of formal orthogonal polynomialsNumerical Algorithms, 1996
- Padé Approximants Second EditionPublished by Cambridge University Press (CUP) ,1996
- Stability analysis of a general toeplitz systems solverNumerical Algorithms, 1995
- On the Stability of the Bareiss and Related Toeplitz Factorization AlgorithmsSIAM Journal on Matrix Analysis and Applications, 1995
- A Uniform Approach for the Fast Computation of Matrix-Type Padé ApproximantsSIAM Journal on Matrix Analysis and Applications, 1994
- A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizationsNumerical Algorithms, 1992
- A reliable method for computing M-Padé approximants on arbitrary staircasesJournal of Computational and Applied Mathematics, 1992
- The structure of the singular solution table of the M-Padé approximation problemJournal of Computational and Applied Mathematics, 1990
- Greatest common divisor via generalized Sylvester and Bezout matricesIEEE Transactions on Automatic Control, 1978