Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: On the Probabilistic Analysis of Normal Form Computation of a Sparse Matrix
Authors: Donald, Bruce Randall
Chang, David Renpan
Keywords: computer science
technical report
Issue Date: Dec-1990
Publisher: Cornell University
Abstract: An $(s, t)$-sparse matrix has $s$ non-zero entries per column and $t$ per row. $(s, t)$-sparse integer matrices arise in the computation of integral homology. In this paper, a probabilistic analysis is given for diagonalizing an integer $(s, t)$-sparse matrix into normal formal. By normal form of a matrix, we mean the diagonalization of the matrix over the ring of integers. We prove that under high probability the expected running time can be achieved with probability very close $(s, t)$-sparse matrix, i.e. this expected running time can be achieved with probability very close to 1 when $(s, t)\ll n$.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
90-1180.pdf2.16 MBAdobe PDFView/Open
90-1180.ps488.62 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us