Gupta, Somit2011-08-232011-08-232011-08-232011http://hdl.handle.net/10012/6108This 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.enComputer AlgebraMatrix Normal FormsSymbolic ComputationMaster ThesisComputer Science