A comparative study of algorithms for computing the Smith normal form of an integer matrix†

DOI10.1080/00207728408926595zbMath0563.65026OpenAlexW2066270869MaRDI QIDQ3677067

Asim Roy, Vangalur S. Alagar

Publication date: 1984

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728408926595

zbMATH Keywords

complexityinteger matrixHermite normal formSmith normal formoverflow problems

Mathematics Subject Classification ID

Related Items (1)

Extended integer rank reduction formulas and Smith normal form

Cites Work

• Unnamed Item
• Unnamed Item
• Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems
• On Computing the Smith Normal Form of an Integer Matrix
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
• Part I-Smith form and common divisor of polynomial matrices
• Transfer Equivalence of Linear Dynamical Systems
• Computational experience with a group theoretic integer programming algorithm

This page was built for publication: A comparative study of algorithms for computing the Smith normal form of an integer matrix†