Integer matrices and Abelian groups (invited)
@inproceedings{1979IntegerMA,
title={Integer matrices and Abelian groups (invited)},
author={},
booktitle={EUROSAM},
year={1979}
}- Published in EUROSAM 1979
DOI:10.1007/3-540-09519-5_94
Practical methods for computing equivalent forms of integer matrices are presented. Both heuristic and modular techniques are used to overcome integer overflow problems, and have successfully handled matrices with hundreds of rows and columns. Applications to finding the structure of finitely presented abelian groups are described.
Topics from this paper.
Citations
Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS
Efficient parallelizations of Hermite and Smith normal form algorithms
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED
On the Computation of Elementary Divisors of Integer Matrices
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED
Recognizing badly presented Z-modules
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
A new algorithm for computing the Smith normal form and its implementation on parallel machines
VIEW 1 EXCERPT
CITES METHODS
Parallelism in Hermite and Smith normal forms
VIEW 1 EXCERPT
CITES BACKGROUND
Algorithms for Groups
VIEW 1 EXCERPT
CITES METHODS
Asymptotically Fast Triangularization of Matrices Over Rings
VIEW 1 EXCERPT
CITES BACKGROUND