Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs

@article{Beckermann2000FractionFreeCO,
  title={Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs},
  author={Bernhard Beckermann and George Labahn},
  journal={SIAM J. Matrix Anal. Appl.},
  year={2000},
  volume={22},
  pages={114-144}
}
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 Pade approximants, Newton--Pade, Hermite--Pade, and simultaneous Pade approximants, and more generally M-Pade 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… 
Exact computation of Simultaneous Rational Approximants
TLDR
A new, fast algorithm for solving the simultaneous Pad´ e approximation problem that gives significant improvement on previous fraction-free methods, in particular when solved via the use of vector Hermite-Pad- e approximation using the FFFG order basis algorithm previously done by the authors.
Computing minimal interpolation bases
Normal forms for general polynomial matrices
Fraction-free computation of simultaneous padé approximants
TLDR
A new, fast algorithm for solving the simultaneous Padé approximation problem that gives significant improvement on previous fraction-free methods, in particular when solved via the use of vector Hermite-Padé approximation using the FFFG order basis algorithm.
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
TLDR
To obtain the target cost for any shift, the properties of the output bases are strengthened, and of those obtained during the course of the algorithm: all the bases are computed in shifted Popov form, whose size is always O(m σ), and a divide-and-conquer scheme is designed.
Fast Order Basis and Kernel Basis Computation and Related Problems
  • W. Zhou
  • Computer Science, Mathematics
  • 2013
TLDR
The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes the computational costs more precise and tighter, and the shifted minimal bases computed by the algorithms are more general than the standard minimal bases.
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants
TLDR
This paper discusses implementation aspects for most fundamental operations: multiplication, truncated inversion, approximants, interpolants, kernels, linear system solving, determinant, and basis reduction, focusing on prime fields with a word-size modulus.
A Viskovatov algorithm for Hermite-Padé polynomials
TLDR
An algorithm for producing Hermite- Padé polynomials of type I for an arbitrary tuple of formal power series under the assumption that the series have a certain (‘general position’) nondegeneracy property is proposed.
Algorithms for normal forms for matrices of polynomials and ore polynomials
TLDR
A fraction-free algorithm for row reduction for matrices of Ore polynomials is obtained by formulating row reduction as a linear algebra problem and this algorithm is used as a basis to formulate modular algorithms for computing a row-reduced form, a weak Popov forms, and the Popov form of a polynomial matrix.
Fast computation of approximant bases in canonical form
...
...

References

SHOWING 1-10 OF 80 REFERENCES
Recursiveness in matrix rational interpolation problems
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
TLDR
A recurrence relation is presented for the computation of a basis for the corresponding linear solution space of these approximants, and these methods result in fast (and superfast) reliable algorithms for the inversion of stripedHankel, layered Hankel, and (rectangular) block-Hankel matrices.
A uniform approach for the fast computation of Matrix-type Padé approximants
TLDR
A recurrence relation is presented for the computation of a basis for the corresponding linear solution space of these approximants, which generalizes previous work by Van Barel and Bultheel and, in a more general form, by Beckermann.
Pivoting for structured matrices with applications
TLDR
It is mentioned that starting with the breakthrough work of Wilkinson, several pivoting techniques have been proposed to stabilize the numerical behavior of Gaussian elimination.
A reliable method for computing M-Pade´ approximants on arbitrary staircases
On the theory and computation of nonperfect Pade´-Hermite approximants
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants
Computation of Numerical Padé-Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
TLDR
The algorithm is weakly stable and bounds for the error in the computed solutions as a function of $\tau$ are provided and Experimental results are given which show that the bounds reflect the actual behavior of the error.
Stable and Efficient Algorithms for Structured Systems of Linear Equations
  • M. Gu
  • Computer Science
  • 1998
TLDR
A modified algorithm is presented that can perform a fast variation of Gaussian elimination with complete pivoting (GECP) and is both efficient and numerically stable, provided that the element growth in the computed factorization is not large.
Sylvester’s identity and multistep integer-preserving Gaussian elimination
A method is developed which permits integer-preserving elimination in systems of linear equations, AX = B, such that (a) the magnitudes of the coefficients in the transformed matrices are minimized,
...
...