Computing Hermite and Smith normal forms of triangular integer matrices
From MaRDI portal
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.
Recommendations
Cites work
- Algorithms for the Solution of Systems of Linear Diophantine Equations
- Asymptotically Fast Triangularization of Matrices over Rings
- Factor Refinement
- Fast multiplication of large numbers
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- scientific article; zbMATH DE number 1254241 (Why is no real title available?)
- scientific article; zbMATH DE number 1254301 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- The Smith normal form
- 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
Cited in
(16)- A family of sparse polynomial systems arising in chemical reaction systems
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
- Degree matrices and estimates for exponential sums of polynomials over finite fields
- Asymptotically Fast Triangularization of Matrices over Rings
- Hermite and Smith normal form algorithms over Dedekind domains
- scientific article; zbMATH DE number 842016 (Why is no real title available?)
- Smith normal form of augmented degree matrix and rational points on toric hypersurface
- scientific article; zbMATH DE number 7378350 (Why is no real title available?)
- Khovanov Homotopy Calculations using Flow Category Calculus
- A local construction of the Smith normal form of a matrix polynomial
- New Characterization of the Factor Refinement Algorithm with Applications
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
- Accurate score prediction for Dual-Sieve attacks
- Smith normal form of augmented degree matrix and its applications
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- Fast computation of Hermite normal forms of random integer matrices
This page was built for publication: Computing Hermite and Smith normal forms of triangular integer matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809087)
