A comparative study of algorithms for computing the Smith normal form of an integer matrix†
type: Item
instance of: scholarly article
title: A comparative study of algorithms for computing the Smith normal form of an integer matrix†
zbMATH Open document ID: 0563.65026
DOI: 10.1080/00207728408926595
author: Vangalur S. Alagar
author: Asim Roy
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A21
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3898122
zbMATH Keywords: Hermite normal form
zbMATH Keywords: Smith normal form
zbMATH Keywords: integer matrix
zbMATH Keywords: complexity
zbMATH Keywords: overflow problems
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/00207728408926595
OpenAlex ID: W2066270869
cites work: Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems
cites work: Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations
cites work: Computational experience with a group theoretic integer programming algorithm
cites work: Transfer Equivalence of Linear Dynamical Systems
cites work: Q5595961
cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
cites work: Q5585021
cites work: Part I-Smith form and common divisor of polynomial matrices
cites work: On Computing the Smith Normal Form of an Integer Matrix
published in: International Journal of Systems Science. Principles and Applications of Systems and Integration
description: scientific article