Integer matrix rank certification

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2009, Pages 333-340

  Storjohann, Arne ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Integer matrix; Las vegas; Rank

Indexed keywords

ABSOLUTE VALUES; BIT-OPERATIONS; INTEGER MATRICES; LAS VEGAS; LAS VEGAS ALGORITHMS; MATRIX MULTIPLICATION; SCHUR COMPLEMENT; ZERO MATRICES;

ALGEBRA; COMPUTATION THEORY;

MATRIX ALGEBRA;

EID: 77950377324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1576702.1576748     Document Type: Conference Paper

References (16)

1. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1996.
2. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
3. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2 edition, 2003.
4. M. Giesbrecht. Fast computation of the Smith form of a sparse integer matrix. Computational Complexity, 10(1):41-69, 11 2001.
5. M. Giesbrecht, A. Lobo, and B. D. Saunders. Certifying inconsistency of sparse linear systems. In O. Gloor, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '98, pages 113-119. ACM Press, New York, 1998.
6. J. L. Hafner and K. S. McCurley. Asymptotically fast triangularization of matrices over rings. SIAM Journal of Computing, 20(6):1068-1083, Dec. 1991.
7. O. Ibarra, S. Moran, and R. Hui. A generalization of the fast LUP matrix decomposition algorithm and applications. Journal of Algorithms, 3:45-56, 1982.
8. C.-P. Jeannerod. LSP Matrix Decomposition Revisited. Technical Report Research Report 2006-2028, École normale supérieure de Lyon, LIP, September 1996.
9. E. Kaltofen and G. Villard. On the complexity of computing determinants. Computational Complexity, 13(3-4):91-130, 2004.
10. T. Mulders and A. Storjohann. Certified dense linear system solving. Journal of Symbolic Computation, 37(4):485-510, 2004.
11. M. Pohst. A modification of the LLL reduction algorithm. Journal of Symbolic Computation, 4(1):123-127, 1987.
12. D. Saunders, A. Storjohann, and G. Villard. Matrix rank certification. Electronic Journal of Linear Algebra, 11:16-23, 2004.
13. D. Saunders and Z. Wan. Smith normal form of dense integer matrices, fast algorithms into practice. In J. Gutierrez, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '04, pages 274-281. ACM Press, New York, 2004.
14. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281-292, 1971.
15. A. Storjohann. The shifted number system for fast linear algebra on integer matrices. Journal of Complexity, 21(4):609-650, 2005. Festschrift for the 70th Birthday of Arnold Schönhage.
16. A. Storjohann and G. Villard. Computing the rank and a small nullspace basis of a polynomial matrix. In M. Kauers, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC '05, pages 309-316. ACM Press, New York, 2005.