You are looking at a specific version 20110805:134555 of this paper. See the latest version.

Paper 2011/416

Efficient Parallelization of Lanczos Type Algorithms

Ilya Popovyan

Abstract

We propose a new parallelization technique for Lanczos type algorithms for solving large sparse linear systems over finite fields on mesh cluster architecture. The algorithm computation time scales as $P^{-1}$ on $P processors, and the communcation times scales as $P^{-1/2}$ for reasonable choice of $P$.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
number field sieveparallel sparse linear system solver
Contact author(s)
poilyard @ gmail com
History
2011-08-05: received
Short URL
https://ia.cr/2011/416
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.