Hermite Forms of Polynomial Matrices
Abstract
This thesis presents a new algorithm for computing the Hermite form of a polynomial
matrix. Given a nonsingular n by n matrix A filled with degree d polynomials with coefficients from a field, the algorithm computes the Hermite form of A in expected number of field operations similar to that of matrix multiplication. The algorithm is randomized of the Las Vegas type.
Collections
Cite this version of the work
Somit Gupta
(2011).
Hermite Forms of Polynomial Matrices. UWSpace.
http://hdl.handle.net/10012/6108
Other formats