AbstractReductions to polynomial matrix multiplication are given for some classical problems involving a nonsingular input matrix over the ring of univariate polynomials with coefficients from a field. High-order lifting is used to compute the determinant, the Smith form, and a rational system solution with about the same number of field operations as required to multiply together two matrices having the same dimension and degree as the input matrix. Integrality certification is used to verify correctness of the output. The algorithms are space efficient
AbstractA randomized algorithm is given for solving a system of linear equations over a principal id...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
Recent methods for handling matrix problems over an integral domain are investigated from a unifying...
AbstractReductions to polynomial matrix multiplication are given for some classical problems involvi...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
AbstractThe shifted number system is presented: a method for detecting and avoiding error producing ...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
Research Report LIP RR2005-03, January 2005We reduce the problem of computing the rank and a nullspa...
Abstract An algorithm is presented that probabilistically computes the exact inverse of a nonsingula...
A new algorithm is presented for computing the resultant of two "sufficiently generic" bivariate pol...
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial o...
AbstractWe present an inversion algorithm for nonsingular n×n matrices whose entries are degree d po...
AbstractWe present an algorithm for computing a Smith form with multipliers of a regular matrix poly...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially d...
AbstractA randomized algorithm is given for solving a system of linear equations over a principal id...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
Recent methods for handling matrix problems over an integral domain are investigated from a unifying...
AbstractReductions to polynomial matrix multiplication are given for some classical problems involvi...
Linear algebra, together with polynomial arithmetic, is the foundation of computer algebra. The algo...
AbstractThe shifted number system is presented: a method for detecting and avoiding error producing ...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
Research Report LIP RR2005-03, January 2005We reduce the problem of computing the rank and a nullspa...
Abstract An algorithm is presented that probabilistically computes the exact inverse of a nonsingula...
A new algorithm is presented for computing the resultant of two "sufficiently generic" bivariate pol...
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial o...
AbstractWe present an inversion algorithm for nonsingular n×n matrices whose entries are degree d po...
AbstractWe present an algorithm for computing a Smith form with multipliers of a regular matrix poly...
AbstractWe consider a system of linear equations of the form A(x)X(x) = b(x), where A(x), b(x) are g...
We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially d...
AbstractA randomized algorithm is given for solving a system of linear equations over a principal id...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
Recent methods for handling matrix problems over an integral domain are investigated from a unifying...