Algorithms for Hermite and Smith normal matrices and linear Diophantine equations

Gordon H. Bradley

Mathematics of Computation · 1971 · 65 citations · 18 references

DOIFull text

Open access

Concepts

Abstract

New algorithms for constructing the Hermite normal form (triangular) and Smith normal form (diagonal) of an integer matrix are presented. A new algorithm for determining the set of solutions to a system of linear diophantine equations is presented. A modification of the Hermite algorithm gives an integer-preserving algorithm for solving linear equations with real-valued variables. Rough bounds for the number of operations are cubic polynomials involving the order of the matrix and the determinant of the matrix. The algorithms are valid if the elements of the matrix are in a principal ideal domain.

References

18