Smith normal form of dense integer matrices, fast algorithms into practice

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

Volumn , Issue , 2004, Pages 274-281

  Saunders, David ^a   Wan, Zhendong ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

Integer matrix; Smith normal form

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA;

INTEGER MATRIX; SMITH NORMAL FORM;

MATRIX ALGEBRA;

EID: 27644450999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005325     Document Type: Conference Paper

References (19)

1. J. Abbott, M. Brostein, and T. Mulders. Fast deterministic computation of determinants of dense matrices. In Proc. ISSAC'99, pages 197-204. ACM Press, 1999.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clg(n) parallel steps. Combinatorica, 3:1-19, 1983.
3. K.E. Batcher. Sorting networks and their applications. volume 32, pages 307-314, 1968.
4. Daniel J. Bernstein. Factoring into coprimes in essentially linear time. Journal of Algorithms, to appear.
5. William C. Brown. Matrices over commutative rings. Marcel Dekker Inc., New York, NY, 1993.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proc. 19th ACM STOC, pages 1-6, 1987.
7. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, Second edition. MIT Press, 2001.
8. J. Dumas, B.Saunders, and G. Villard. Smith form via the valence : Experience with matrices from homology. In Proc. ISSAAC'00, pages 95 - 105. ACM Press, 2000.
9. J. Dumas, T. Gautier, and C. Pernet. Finite field linear algebra subroutines. In Proc. ISSAC'02, pages 63-74. ACM Press, 2002.
10. A. Duran, D. Saunders, and Z. Wan. Rank of sparse integer matrices. In Siamla 2003, 2003.
11. W. Eberly, M. Giesbrecht, and G. Villard. On computing the determinant and smith form of an integer matrix. In Proc. 41st FOCS, pages 675-687, 2000.
12. J. L. Hafner and K. S. McCurley. Asymptotically fast triangularization of matrices over rings. Siam J. Comput., 20:1068-1083, 1991.
13. C. Iliopoulos. Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups of the hermite and smith normal forms of an integer matrix. SIAM J. Comput., Vol. 18, No.4:658 - 669, 1989.
14. E. Kaltofen and G. Villard. On the complexity of computing determinants. Technical Report 36, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, October 2003.
15. Frank Lübeck. Computation of elementary divisors of integer matrices. Journal of Symbolic Computation, 33, NO 1:57 - 65, 2002.
16. V. Pan and X. Wang. Acceleration of euclidean algorithm and extensions. In Proc. ISSAC'02, pages 207-213. ACM Press, 2002.
17. H. M. S. Smith. On systems of indeterminate equations and congruences. Philos. Trans., pages 293-326, 1861.
18. A. Storjohann. Near optimal algorithms for computing smith normal forms of integer matrices. In Proc. ISSAC'96, pages 267-274. ACM Press, 1996.
19. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.