Experimental Mathematics · 1992 · 70 citations · 2 references
ComputingComputer ScienceAlgorithmsComputational GeometryData StructuresData ReductionDimension ReductionDimensionality ReductionMatrix ComputationNumerical Linear AlgebraDense Matrix AlgorithmsGaussian EliminationHeuristic AlgorithmsSparse Linear AlgebraSparse Matrix AlgorithmsSparse Matrix ComputationSparse Matrix TechniquesStructured Matrix Computation
We present a heuristic method for the reduction modulo 2 of a large,\nsparse bit matrix to a smaller, dense bit matrix that can then be solved\nby conventional means, such as Gaussian elimination.\nThis method worked effectively for us in reducing matrices\nas large as 100,000${}\\times{}$100,000 to much smaller, but denser\nsquare matrices.
2