Hermite normal forms for integer matrices

  • R. J. Bradford
Polynomial Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)


We present a new algorithm for the computation of Hermite Normal Forms of integer matrices that proves advantageous in certain important cases.


  1. [Alagar & Roy 1984]
    A Comparative Study of Algorithms for Computing the Smith Normal Form of an Integer Matrix, Alagar V.S., and Roy A.K., Int. J. Systems Sci., vol. 15(7), 1984, pp. 727–744, 1984.Google Scholar
  2. [Bradley 1971]
    Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations, Bradley G.H., Mathematics of Computation, vol. 25(116), pp. 879–907, October 1971.Google Scholar
  3. [Bradford 1988]
    “On the Computation of Integral Bases and Defects of Integrity,” Bradford R.J., Ph.D. Thesis, University of Bath, 1988.Google Scholar
  4. [Chou & Collins 1982]
    Algorithms for the Solution of Systems of Linear Diophantine Equations, Chou T-W.J., and Collins G.E., SIAM J. Computing 11(34), pp. 687–708, November 1982.CrossRefGoogle Scholar
  5. [Ford 1978]
    “On the Computation of the Maximal Order in a Dedekind Domain,” Ford D.J., Ph.D. Thesis, Ohio State University, 1978.Google Scholar
  6. [Kannan & Bachem 1979]
    Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix, Kannan R., and Bachem A., SIAM J. Computing, vol. 8(4), pp. 499–507, November 1979.CrossRefGoogle Scholar
  7. [Trager 1984]
    “Integration of Algebraic Functions,” Trager B.M., Ph.D. Thesis, MIT, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • R. J. Bradford
    • 1
  1. 1.School of Mathematical SciencesUniversity of BathBathEngland

Personalised recommendations