A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
1999
Algorithmica
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. Our implementation can be run on a network cluster of SPARC-20 computers and on an SP-2 multiprocessor. Detailed timings are presented for experiments with systems that arise in RSA challenge integer factoring efforts. For example, we can solve a 252, 222 × 252, 222 system with about 11.04 million non-zero entries over
doi:10.1007/pl00008266
fatcat:57vywzc6qvgmhnclmkeve3frrm