Hermite canonical form and Smith canonical form of a matrix over a principal ideal domain

Type: Article

Publication Date: 1990-07-01

Citations: 2

DOI: https://doi.org/10.1145/101104.101105

Abstract

This paper presents computational aspects of Smith and Hermite normal forms for matrices over general principal ideal domains. After reviewing the standard definitions and properties of Hermite and Smith normal forms, we ask when there is an effective algorithm which will find a unique canonical form for all matrices in the same equivalence class. We show that the ability to compute canonical members of an associate class and canonical representatives of a residue class in the underlying ring are necessary and sufficient conditions for an effective procedure to find unique Hermite and Smith forms. We then present a uniform technique for reducing intermediate expression swell during the computation of Smith and Hermite normal forms for matrices over general principal ideal domains. This generalizes previous work by handling non-square matrices which are not of full column rank. We also present examples which show that the heuristic of directly computing modulo the determinant as proposed by some can yield the wrong answer. We instead compute with the matrix augmented by the determinant times the identity matrix. This always yields the correct result and has the desired effect of allowing one to keep all elements which occur during the computation bounded by the determinant.

Locations

Similar Works

Action Title Year Authors
+ None 1990
+ A Formal Proof of the Computation of Hermite Normal Form in a General Setting 2018 Jose Divasón
Jesús Aransay
+ Computing Hermite and Smith normal forms of triangular integer matrices 1996 Arne Storjohann
+ PDF Chat Hermite and Smith normal form algorithms over Dedekind domains 1996 Henri Cohen
+ Parallelism in Hermite and Smith normal forms 1993 T. Hruz
D. Fortin
+ Reduction of a Set of Matrices over a Principal Ideal Domain to the Smith Normal Forms by Means of the Same One-Sided Transformations 2010 В. М. Прокіп
+ A local construction of the Smith normal form of a matrix polynomial 2010 Jon Wilkening
Jia Yu
+ PDF Chat On the Smith Normal Form of the Least Common Multiple of Matrices from some Class of Matrices 2023 А. М. Романів
+ Revisiting the matrix polynomial greatest common divisor 2022 Vanni Noferini
Paul Van Dooren
+ Residual methods for computing hermite and smith normal forms (congruence, determinant, sparsity) 1985 Paul D. Domich
+ A local construction of the Smith normal form of a matrix polynomial 2008 Jon Wilkening
Jia Yu
+ PDF Chat Fast computation of Smith forms of sparse matrices over local rings 2012 Mustafa Elsheikh
Mark Giesbrecht
Andrew Novocin
B. David Saunders
+ PDF Chat Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations 1971 Gordon H. Bradley
+ PDF Chat Algorithms for Hermite and Smith normal matrices and linear Diophantine equations 1971 Gordon H. Bradley
+ Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases 2010 Viktor Levandovskyy
Kristina Schindelar
+ Jordan Normal and Rational Normal Form Algorithms 2004 Bernard Parisse
Morgane Vaughan
+ Equivalence to Smith form for matrices over rings 1984 Malcolm Smith
Yung‐Jr Hung
+ Computing the Smith normal form of a matrix. [Computer greatest common divisor of n polynomials] 1976 John A. Howell
+ Fast Computation of Smith Forms of Sparse Matrices Over Local Rings 2012 Mustafa Elsheikh
Mark Giesbrecht
Andrew Novocin
B. David Saunders
+ Fast Computation of Smith Forms of Sparse Matrices Over Local Rings 2012 Mustafa Elsheikh
Mark Giesbrecht
Andrew Novocin
B. David Saunders

Works That Cite This (1)

Action Title Year Authors
+ Algebraic computing and linear system control 2005 Patrick Chenin