Matrix Rank Certification

Abstract : 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.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02102007
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:11:51 AM
Last modification on : Wednesday, November 20, 2019 - 3:13:34 AM

File

RR2001-30.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102007, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

10

Files downloads

40