Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Asymptotically fast polynomial matrix algorithms for multivariable systems

Abstract : We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer algebra techniques, minimal basis computations and matrix fraction expansion/reconstruction, and to polynomial matrix multiplication. Such reductions eventually imply that all these problems can be solved in about the same amount of time as polynomial matrix multiplication (up to logarithmic factors and the size of the output).
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 10:17:36 AM
Last modification on : Wednesday, October 26, 2022 - 8:15:14 AM


Files produced by the author(s)


  • HAL Id : hal-02102206, version 1



Claude-Pierre Jeannerod, Gilles Villard. Asymptotically fast polynomial matrix algorithms for multivariable systems. [Research Report] LIP RR-2005-36, Laboratoire de l'informatique du parallélisme. 2005, 2+12p. ⟨hal-02102206⟩



Record views


Files downloads