Skip to main content
Article thumbnail
Location of Repository

F2 Lanczos revisited

By Michael Peterson and Chris Monico

Abstract

We present a new variant of the block Lanczos algorithm for finding vectors in the kernel of a symmetric matrix over F2. Our algorithm is at least as efficient as that of Peter Montgomery [6], while the sequence of matrices Wi constructed here have different algebraic properties that may be useful in eventually providing a provable upper bound on the time required to solve this problem. Namely, our Wi satisfy W T i Wj = 0 for i � = j as opposed to W

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.2062
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.ttu.edu/~cmoni... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.