On the computation of elementary divisors of integer matrices

From MaRDI portal





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.





Describes a project that uses

Uses Software






This page was built for publication: On the computation of elementary divisors of integer matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599534)