Fast computation of the Smith form of a sparse integer matrix

Computational Complexity

Volumn 10, Issue 1, 2001, Pages 41-69

  Giesbrecht, Mark ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Probabilistic algorithms; Smith form; Sparse integer matrix

Indexed keywords

EID: 0035730092     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001611     Document Type: Article

References (29)

1. E. R. BERLEKAMP (1970). Factoring polynomials over large finite fields. Math. Comp. 24, 713-735.
2. J. BUCHMANN (1988). A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. In Séminaire de théorie des nombres (Paris), Birkhäuser, 27-41.
3. T. J. CHOU & G. E. COLLINS (1982). Algorithms for the solution of systems of linear Diophantine equations. SIAM J. Comput. 11, 687-708.
4. P. DOMICH, R. KANNAN & L. TROTTER (1987). Hermite normal form computation using modulo determinant arithmetic. Math. Oper. Res. 12, 50-59.
5. X. G. FANG & G. HAVAS (1997). On the worst-case complexity of integer gaussian elimination. In Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC'97), 28-31.
6. A. O. GELFOND & YU. B. LINNIK (1965). Elementary Methods in Analytic Number Theorey. George Allen & Unwin Ltd., London.
7. M. GIESBRECHT (1993). Nearly Optimal Algorithms for Canonical Matrix Forms. Ph.D. thesis, University of Toronto. 196 pp.
8. M. GIESBRECHT (1995). Fast computation of the Smith form of an integer matrix. In Proceedings of ISSAC'95, ACM Press, Montreal, 110-118.
9. M. GIESBRECHT (1996). Probabilistic computation of the Smith normal form of a sparse integer matrix. In Algorithmic Number Theory: Second International Symposium, H. Cohen (ed.), 175-188.
10. J. L. HAFNER & K. S. MCCURLEY (1989). A rigorous subexponential algorithm for computation of class groups. J. Amer. Math. Soc. 2, 837-850.
11. J. L. HAFNER & K. S. MCCURLEY (1991). Asymptotically fast triangularization of matrices over rings. SIAM J. Comput. 20, 1068-1083.
12. G. HAVAS, D. HOLT & S. REES (1993). Recognizing badly presented Z-modules. Linear Algebra Appl. 192, 137-163.
13. G. HAVAS & B. S. MAJEWSKI (1997). Integer matrix diagonalization. J. Symbolic Comput. 24, 399-408.
14. O. IBARRA, S. MORAN & R. HUI (1982). A generalization of the fast LUP matrix decomposition algorithm and application. J. Algorithms 3, 45-56.
15. C. ILIOPOLOUS (1989). Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix. SIAM J. Comput. 18, 658-669.
16. E. KALTOFEN, M. S. KRISHNAMOORTHY & B. D. SAUNDERS (1987). Fast parallel computation of Hermite and Smith forms of polynomial matrices. SIAM J. Algebraic Discrete Methods 8, 683-690.
17. E. KALTOFEN, M. S. KRISHNAMOORTHY & B. D. SAUNDERS (1990). Parallel algorithms for matrix normal forms. Linear Algebra Appl. 136, 189-208.
18. E. KALTOFEN & B. D. SAUNDERS (1991). On Wiedemann's method of solving sparse linear systems. In Proc. AAECC-9, Lecture Notes in Comput. Sci. 539, Springer, 29-38.
19. R. KANNAN & A. BACHEM (1979). Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. 8, 499-507.
20. W. KELLER-GEHRIG (1985). Fast algorithms for the characteristic polynomial. Theoret. Comput. Sci. 36, 309-317.
21. R. LIDL & H. NIEDERREITER (1983). Finite Fields. Encyclopedia Math. Appl. 20, Addison-Wesley, Reading, MA.
22. M. NEWMAN (1972). Integral Matrices. Academic Press, New York.
23. J. B. ROSSER & L. SCHOENFELD (1962). Approximate formulas for some functions of prime numbers. Illinois J. Math. 6, 64-94.
24. J. T. SCHWARTZ (1980). Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27, 701-717.
25. H. J. S. SMITH (1861). On systems of linear indeterminate equations and congruences. Philos. Trans. Roy. Soc. London 151, 293-326.
26. A. STORJOHANN (1996). Near optimal algorithms for computing Smith normal forms of integer matrices. In Proceedings of ISSAC'96 (Zürich), 267-274.
27. W. D. WALLIS, A. P. STREET & J. SEBERRY WALLIS (eds.) (1972). Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Math. 292, Springer, Berlin.
28. D. WIEDEMANN (1986). Solving sparse linear equations over finite fields. IEEE Trans. Informa. Theory IT-32, 54-62.
29. R. ZIPPEL (1979). Probabilistic algorithms for sparse polynomials. In Proceedings EUROSAM 79 (Marseille), 216-226.