Matrix Rank Certification - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2001

Matrix Rank Certification

(1) , (1) , (1)


Randomized algorithms are given for computing the rank of a matrix over a field of characteristic zero. The matrix is treated as a black box. Only the capability to compute matrix x column-vector and row-vector x matrix products is used. The methods are exact, sometimes called seminumeric. They are appropriate for example for matrices with integer or rational entries. The rank algorithms are probabilistic of the Las Vegas type; the correctness of the result is guaranteed.
Fichier principal
Vignette du fichier
RR2001-30.pdf (249.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02102007 , version 1 (17-04-2019)


  • HAL Id : hal-02102007 , version 1


David Saunders, Arne Storjohann, Gilles Villard. Matrix Rank Certification. [Research Report] LIP RR-2001-30, Laboratoire de l'informatique du parallélisme. 2001, 2+6p. ⟨hal-02102007⟩
19 View
121 Download


Gmail Facebook Twitter LinkedIn More