Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
We propose a method of solving large sparse systems of linear equations over GF(2), the field with two elements. We use the Lanczos algorithm, modified in two ways. A lookahead Lanczos algorithm is needed for the problem of dividing by an inner product whose value happens to be 0. A block version of the algorithm allows us to perform 32 matrix-vector operations for the cost of one. The resulting algorithm is competitive with structured Gaussian elimination in terms of time, and has much lower space requirements. It may be useful in the last stage of integer factorization. © 1993.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering