Skip to Main content Skip to Navigation
Conference papers

Sparse Gaussian Elimination modulo p: an Update

Abstract : This paper considers elimination algorithms for sparse matrices over finite fields. We mostly focus on computing the rank, because it raises the same challenges as solving linear systems, while being slightly simpler. We developed a new sparse elimination algorithm inspired by the Gilbert-Peierls sparse LU factorization, which is well-known in the numerical computation community. We benchmarked it against the usual right-looking sparse gaussian elimination and the Wiedemann algorithm using the Sparse Integer Matrix Collection of Jean-Guillaume Dumas. We obtain large speedups (1000× and more) on many cases. In particular , we are able to compute the rank of several large sparse matrices in seconds or minutes, compared to days with previous methods.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Charles Bouillaguet <>
Submitted on : Saturday, June 18, 2016 - 2:28:27 PM
Last modification on : Friday, November 27, 2020 - 2:20:03 PM


Files produced by the author(s)


  • HAL Id : hal-01333670, version 1


Charles Bouillaguet, Claire Delaplace. Sparse Gaussian Elimination modulo p: an Update. Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. ⟨hal-01333670⟩



Record views


Files downloads