Computing all factorizations in ***
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Fraction-free row reduction of matrices of skew polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Output-sensitive modular algorithms for polynomial matrix normal forms
Journal of Symbolic Computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
ACM Communications in Computer Algebra
Solving structured linear systems with large displacement rank
Theoretical Computer Science
Computing polynomial LCM and GCD in lagrange basis
ACM Communications in Computer Algebra
Fraction-free computation of simultaneous padé approximants
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Approximate solutions to a parameterized sixth order boundary value problem
Computers & Mathematics with Applications
Fraction-free row reduction of matrices of Ore polynomials
Journal of Symbolic Computation
Normal forms for general polynomial matrices
Journal of Symbolic Computation
Journal of Symbolic Computation
Journal of Symbolic Computation
Efficient algorithms for order basis computation
Journal of Symbolic Computation
Computing high precision Matrix Padé approximants
Numerical Algorithms
Computing column bases of polynomial matrices
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
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.