On Efficient Sparse Integer Matrix Smith Normal Form Computations - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2001

On Efficient Sparse Integer Matrix Smith Normal Form Computations

Abstract

We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo powers of word-size primes. Consequently, the algorithm does not suffer from coefficient growth. We have implemented several variants of this algorithm (elimination and/or black box techniques) since practical performance depends strongly on the memory available. Our method has proven useful in algebraic topology for the computation of the homology of some large simplicial complexes.

Dates and versions

hal-02018782 , version 1 (14-02-2019)

Identifiers

Cite

Jean-Guillaume Dumas, B. David Saunders, Gilles Villard. On Efficient Sparse Integer Matrix Smith Normal Form Computations. Journal of Symbolic Computation, 2001, 32 (1-2), pp.71-99. ⟨10.1006/jsco.2001.0451⟩. ⟨hal-02018782⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More