Computing Hermite and Smith normal forms of triangular integer matrices
type: Item
instance of: scholarly article
title: Computing Hermite and Smith normal forms of triangular integer matrices
zbMATH Open document ID: 0936.65056
DOI: 10.1016/S0024-3795(98)10012-5
author: Arne Storjohann
published in: Linear Algebra and its Applications
publication date: 1999-11-25T00:00:00Z
review text: The transformation of a triangular integer input matrix to canonical Hermite and Smith normal form is considered. Optimal algorithms with computational cost are presented. The algorithms are easily implemented, assuming standard integer arithmetic and admit excellent performance.
reviewed by: F. Szidarovszky
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A21
zbMATH DE Number: 1370154
zbMATH Keywords: Hermite normal form
zbMATH Keywords: Smith normal form
zbMATH Keywords: integer matrix
zbMATH Keywords: algorithms
MaRDI profile type: Publication
cites work: Fast multiplication of large numbers
cites work: Matrix multiplication via arithmetic progressions
cites work: Hermite Normal Form Computation Using Modulo Determinant Arithmetic
cites work: Asymptotically Fast Triangularization of Matrices over Rings
cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
cites work: Q4227351
cites work: The Smith normal form
cites work: Q4227282
cites work: Q4227352
cites work: Q4888749
cites work: Algorithms for the Solution of Systems of Linear Diophantine Equations
cites work: Factor Refinement
Wikidata QID: Q127063931
description: scientific article; zbMATH DE number 1370154