Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix

Arne Storjohann (1) , Gilles Villard (2)

1 UWO - School of Computer Science [Waterloo]
2 LIP - Laboratoire de l'Informatique du Parallélisme

We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace algorithm using about the same number of operations as for multiplying two matrices of dimension n and degree d. If the latter multiplication is done in MM(n,d)=softO(n^omega d) operations, with omega the exponent of matrix multiplication over K, then the algorithm uses softO(MM(n,d)) operations in K. The softO notation indicates some missing logarithmic factors. The method is randomized with Las Vegas certification. We achieve our results in part through a combination of matrix Hensel high-order lifting and matrix minimal fraction reconstruction, and through the computation of minimal or small degree vectors in the nullspace seen as a K[x]-module

Mots clés: linear algebra:polynomial matrix:matrix rank:nullspace basis:minimal polynomial basis

Domaines: Informatique; Calcul formel [cs.SC]; Complexité [cs.CC]

Arne Storjohann, Gilles Villard. Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix. 2005, Beijing, pp.309-316. ⟨hal-00004832⟩