On the theory and computation of nonperfect Pade´-Hermite approximants
Journal of Computational and Applied Mathematics
Algorithms for computer algebra
Algorithms for computer algebra
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
SIAM Journal on Matrix Analysis and Applications
Recursiveness in matrix rational interpolation problems
Journal of Computational and Applied Mathematics - Special issue: ROLLS symposium
Factorization of differential operators with rational functions coefficients
Journal of Symbolic Computation
Shifted normal forms of polynomial matrices
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
SIAM Journal on Matrix Analysis and Applications
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
In this paper we give a new, fast algorithm for solving the simultaneous Padé approximation problem. The algorithm is fraction-free and is suitable for computation in domains where growth of coefficients in intermediate computations are a central concern. The algorithm 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 previously done by the authors. The improvements are both in terms of bit complexity and in reduced size of the intermediate quantities.