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

DOI10.1080/00207728408926595MaRDI QIDQ3677067zbMATH OpenOpenAlexFDO

Authors Vangalur S. Alagar, Asim Roy

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

• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• Computational experience with a group theoretic integer programming algorithm
• Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
• 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
• Part I-Smith form and common divisor of polynomial matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Transfer Equivalence of Linear Dynamical Systems

Cited in

(2)

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

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)