Experimental Mathematics

Reduction of huge, sparse matrices over finite fields via created catastrophes

Carl Pomerance and J. W. Smith

Abstract

We present a heuristic method for the reduction modulo 2 of a large, sparse bit matrix to a smaller, dense bit matrix that can then be solved by conventional means, such as Gaussian elimination. This method worked effectively for us in reducing matrices as large as 100,000${}\times{}$100,000 to much smaller, but denser square matrices.

Article information

Source
Experiment. Math., Volume 1, Issue 2 (1992), 89-94.

Dates
First available in Project Euclid: 26 March 2003

Permanent link to this document
https://projecteuclid.org/euclid.em/1048709047

Mathematical Reviews number (MathSciNet)
MR1203868

Zentralblatt MATH identifier
0771.65023

Subjects
Primary: 65F50: Sparse matrices

Citation

Pomerance, Carl; Smith, J. W. Reduction of huge, sparse matrices over finite fields via created catastrophes. Experiment. Math. 1 (1992), no. 2, 89--94. https://projecteuclid.org/euclid.em/1048709047


Export citation