𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast computation of the Smith form of a sparse integer matrix

✍ Scribed by M. Giesbrecht

Publisher
Springer
Year
2001
Tongue
English
Weight
473 KB
Volume
10
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Efficient Sparse Integer Matrix Smith
On Efficient Sparse Integer Matrix Smith Normal Form Computations
✍ Jean-Guillaume Dumas; B. David Saunders; Gilles Villard πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 576 KB

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 ha

A parallel algorithm for achieving the S
A parallel algorithm for achieving the Smith Normal Form of an integer matrix
✍ Ingmar Neumann; Wolfgang Wilhelmi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 815 KB

The Smith Normal Form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can he

On p-adic computation of the rational fo
On p-adic computation of the rational form of a matrix
✍ Marie-HΓ©lΓ¨ne Mathieu; David Ford πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 546 KB

We consider the problem of bringing a given matrix into "cyclic form," from which the rational form can be computed easily. Matrices are taken to have p-adic integer entries, and computations are done with rational integer approximations to p-adic integers. We give bounds on the precision necessary