Fast computation of the Smith form of a sparse integer matrix
From MaRDI portal
Publication:5957090
DOI10.1007/PL00001611zbMath0992.65039MaRDI QIDQ5957090
Publication date: 22 September 2002
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00001611
Monte Carlo method; dense matrices; probabilistic algorithm; asymptotically fast algorithm; matrix-vector products; Smith normal form; sparse integer matrix
65F50: Computational methods for sparse matrices
65C05: Monte Carlo methods
15B36: Matrices of integers
15A21: Canonical forms, reductions, classification
Related Items
Hardness of embedding simplicial complexes in \(\mathbb R^d\), Computing the sign or the value of the determinant of an integer matrix, a complexity survey., A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix, Relating \(p\)-adic eigenvalues and the local Smith normal form, The shifted number system for fast linear algebra on integer matrices