Computing the Rank of Large Sparse Matrices over Finite Fields

Abstract : We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of the Krylov methods to compute the minimal polynomial or the rank of a sparse matrix.
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download
Contributor : Jean-Guillaume Dumas <>
Submitted on : Thursday, March 14, 2019 - 3:30:26 PM
Last modification on : Monday, April 8, 2019 - 1:28:02 PM
Long-term archiving on : Saturday, June 15, 2019 - 8:06:36 PM


Files produced by the author(s)


  • HAL Id : hal-02068056, version 1



Jean-Guillaume Dumas, Gilles Villard. Computing the Rank of Large Sparse Matrices over Finite Fields. Computer Algebra in Scientific Computing (CASC) 2002, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov, Sep 2002, Yalta, Ukraine. pp.47--62. ⟨hal-02068056⟩



Record views


Files downloads