This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
On computing the determinant and Smith form of an integer matrix
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
W. Eberly, Dept. of Comput. Sci., Calgary Univ., Alta., Canada
M. Giesbrecht, Dept. of Comput. Sci., Calgary Univ., Alta., Canada
G. Villard, Dept. of Comput. Sci., Calgary Univ., Alta., Canada
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A/spl isin/Z/sup n/spl times/n/ the algorithm requires O(n/sup 3.5/(log n)/sup 4.5/) bit operations (assuming for now that entries in A have constant size) using standard matrix and integer arithmetic. Using asymptotically fast matrix arithmetic, a variant is described which requires O(n/sup 2+/spl theta//2//spl middot/log/sup 2/nloglogn) bit operations, where n/spl times/n matrices can be multiplied with O(n/sup /spl theta//) operations. The determinant is found by computing the Smith form of the integer matrix an extremely useful canonical form in itself. Our algorithm is probabilistic of the Monte Carlo type. That is, it assumes a source of random bits and on any invocation of the algorithm there is a small probability of error.
Index Terms:
matrix algebra; probability; computational complexity; Monte Carlo methods; mathematics computing; matrix determinant computing; Smith form; nonsingular integer matrix; probabilistic algorithm; integer arithmetic; asymptotically fast matrix arithmetic; matrix multiplication; Monte Carlo method; random bits
Citation:
W. Eberly, M. Giesbrecht, G. Villard, "On computing the determinant and Smith form of an integer matrix," focs, pp.675, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.