Fast, deterministic computation of determinants and Hermite forms for polynomial matrices.

George Labahn, School of Computer Science, University of Waterloo

Wednesday August 15th, 2:30pm in K9509.

Abstract
In this talk we present near-optimal algorithms for computing the 
Hermite normal form and determinant of a given matrix of polynomials.
The algorithms depend on the notion of shifted minimal nullspaces
of polynomial matrices along with algorithms to compute such
nullspaces efficiently.

This is joint work with V. Neiger (Limoges, France) and W. Zhou (Huawei, Toronto)