On the computation of elementary divisors of integer matrices
The author describes a semi-modular algorithm which computes, given a matrix \(A\) of known rank and a prime \(p\), the multiplicities of \(p\) in the factorizations of the elementary divisors of \(A\). Numerical examples, calculated via software dveloped by the author, illustrate the theory.
scientific article; zbMATH DE number 1753638