ABSTRACT
Krylov-based algorithms have recently been used, in combination with other methods, to solve systems of linear equations and to perform related matrix computations over finite fields. For example, large and sparse systems of linear equations ;2; are formed during the use of the number field sieve for integer factorization, and elements of the null space of these systems are sampled.Two rather different kinds of block algorithms have recently been considered. Block Wiedemann algorithms have now been presented and fully analyzed. Block Lanczos algorithms were proposed earlier but are not yet as well understood. In particular, proofs of reliability of block Lanczos algorithms are not yet available. Nevertheless, an examination of the computational number theory literature suggests that block Lanczos algorithms continue to be preferred.This report presents a block Lanczos algorithm that is somewhat simpler than block algorithms that are presently in use and provably reliable for computations over large fields. To my knowledge, this is the first block Lanczos algorithm for which a proof of reliability is available.A different Krylov-based approach is considered for computations over small fields: It is shown that if Wiedemann's sparse matrix preconditioner is applied to an arbitrary matrix then the number of nontrivial invariant factors of the result is, with high probability, quite small. A Krylov-based algorithm to compute a partial Frobenius decomposition can then be used to sample from the null space of the original matrix or to compute its rank. This yields a randomized (Monte Carlo) black box algorithm for matrix rank that is asymptotically faster, in the small field case, than any other that is presently known.
- J. P. Buhler, H. W. Lenstra, Jr, and C. Pomerance. Factoring integers with the number field sieve. In The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics, pages 50--94. Springer-Verlag, 1993.Google ScholarCross Ref
- L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard. Efficient matrix preconditioners for black box linear algebra. Linear Algebra and Its Applications, 343--344:119--146, 2002.Google ScholarCross Ref
- D. Coppersmith. Solving linear equations over GF(2): Block Lanczos algorithm. Linear Algebra and Its Applications, 192:33--60, 1993.Google ScholarCross Ref
- D. Coppersmith. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation, 62(205):33--60, 1994. Google ScholarDigital Library
- W. Eberly. Black box Frobenius decompositions over small fields. In Proceedings, ISSAC '00, pages 106--113, 2000. Google ScholarDigital Library
- W. Eberly. Asymptotically efficient algorithms for the Frobenius form. Technical Report 2003-723-26, Department of Computer Science, University of Calgary, 2003. Available at www.cpsc.ucalgary.ca/~eberly/Publications/.Google Scholar
- W. Eberly. Early termination over small fields (extended abstract). In Proceedings, ISSAC '03, pages 80--87, 2003. Google ScholarDigital Library
- W. Eberly. Reliable Krylov-based algorithms for matrix null space and rank. Technical Report 2004-749-14, Department of Computer Science, University of Calgary, 2004. Available at www.cpsc.ucalgary.ca/~eberly/Publications/.Google ScholarDigital Library
- W. Eberly and E. Kaltofen. On randomized Lanczos algorithms. In Proceedings, ISSAC '97, pages 176--183, 1997. A more complete version is available at www.cpsc.ucalgary.ca/~eberly/Publications/. Google ScholarDigital Library
- F. R. Gantmacher. The Theory of Matrices, volume one. Chelsea Publishing Company, second edition, 1959.Google Scholar
- E. Kaltofen. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Google ScholarDigital Library
- E. Kaltofen and G. Villard. On the complexity of computing determinants. Research Report 36, Laboratoire de 'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, France. Available at www.ens-lyon.fr/LIP/Pub/rr2003.html, 2003.Google Scholar
- B. A. LaMacchia and A. M. Odlyzko. Solving large sparse linear systems over finite fields. In Advances in Cryptology --- CRYPTO '90, volume 537 of em Lecture Notes in Computer Science, pages 109--133. Springer-Verlag, 1990. Google ScholarDigital Library
- C. Lanczos. Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bureau of Standards, 49:33--53, 1952.Google ScholarCross Ref
- P. Montgomery. A block Lanczos algorithm for finding dependencies over GF(2). In EUROCRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 106--120. Springer-Verlag, 1995. Google ScholarDigital Library
- G. Villard. Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. In Proceedings, ISSAC '97, pages 32--39, 1997. Google ScholarDigital Library
- D. Wiedemann. Solving sparse linear systems over finite fields. IEEE Transactions on Information Theory, 32:54--62, 1986. Google ScholarDigital Library
Index Terms
- Reliable Krylov-based algorithms for matrix null space and rank
Recommendations
A reliable block Lanczos algorithm over small finite fields
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationBlocked versions of the Lanczos procedure have been successfully applied to sample nullspace elements of very large sparse matrices over small finite fields. The heuristic currently in use, namely, Montgomery's method [10], is unreliable for certain ...
Fast matrix rank algorithms and applications
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computingWe consider the problem of computing the rank of an mxn matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in O(|A| + rw) field operations, where |A| denotes the number of nonzero entries ...
Computing the rank and a small nullspace basis of a polynomial matrix
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationWe reduce the problem of computing the rank and a null-space basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree, d over a field K we give a rank and nullspace algorithm using about the same ...
Comments