Computing Hermite and Smith normal forms of triangular integer matrices

DOI10.1016/S0024-3795(98)10012-5zbMath0936.65056WikidataQ127063931 ScholiaQ127063931MaRDI QIDQ1809087

Arne Storjohann

Publication date: 25 November 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsinteger matrixHermite normal formSmith normal form

Mathematics Subject Classification ID

Related Items (12)

An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities ⋮ A local construction of the Smith normal form of a matrix polynomial ⋮ New Characterization of the Factor Refinement Algorithm with Applications ⋮ Unnamed Item ⋮ A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix ⋮ Smith Normal Form of Augmented Degree Matrix and Rational Points on Toric Hypersurface ⋮ Fast computation of Hermite normal forms of random integer matrices ⋮ Smith normal form of augmented degree matrix and its applications ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ DEGREE MATRICES AND ESTIMATES FOR EXPONENTIAL SUMS OF POLYNOMIALS OVER FINITE FIELDS ⋮ Khovanov Homotopy Calculations using Flow Category Calculus ⋮ A family of sparse polynomial systems arising in chemical reaction systems

Cites Work

• The Smith normal form
• Matrix multiplication via arithmetic progressions
• Fast multiplication of large numbers
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• 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
• Factor Refinement
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• Asymptotically Fast Triangularization of Matrices over Rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Hermite and Smith normal forms of triangular integer matrices