Hermite Forms of Polynomial Matrices

dc.contributor.author	Gupta, Somit
dc.date.accessioned	2011-08-23 16:21:00 (GMT)
dc.date.available	2011-08-23 16:21:00 (GMT)
dc.date.issued	2011-08-23T16:21:00Z
dc.date.submitted	2011
dc.identifier.uri	http://hdl.handle.net/10012/6108
dc.description.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.	en
dc.language.iso	en	en
dc.publisher	University of Waterloo	en
dc.subject	Computer Algebra	en
dc.subject	Matrix Normal Forms	en
dc.subject	Symbolic Computation	en
dc.title	Hermite Forms of Polynomial Matrices	en
dc.type	Master Thesis	en
dc.pending	false	en
dc.subject.program	Computer Science	en
uws-etd.degree.department	School of Computer Science	en
uws-etd.degree	Master of Mathematics	en
uws.typeOfResource	Text	en
uws.peerReviewStatus	Unreviewed	en
uws.scholarLevel	Graduate	en