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

DOI10.1080/00207728408926595zbMATH Open0563.65026OpenAlexW2066270869MaRDI QIDQ3677067FDOQ3677067

Asim Roy, Vangalur S. Alagar

Publication date: 1984

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

complexityHermite normal forminteger matrixSmith normal formoverflow problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Canonical forms, reductions, classification (15A21)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• On Computing the Smith Normal Form of an Integer Matrix
• Computational experience with a group theoretic integer programming algorithm
• 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
• Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

Cited In (2)

• Extended integer rank reduction formulas and Smith normal form
• Smith normal form of dense integer matrices fast algorithms into practice

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

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