A new cubic algorithm for computation of an integer Hermite form

George Labahn, School of Computing Science, University of Waterloo

Wednesday August 23rd, 2:30am. AQ 4135


Abstract: Normal forms for integer matrices, such as Hermite and Smith normal forms, have a long history both in terms of algorithms for computation and uses in applications. In this talk we discuss a number of algorithms including two recent approaches for fast Smith normal form computation along a new algorithm for computation of the Hermite normal form. This is joint work with Stavros Birmpilis and Arne Storjohann