Fast Order Basis and Kernel Basis Computation and Related Problems
| dc.contributor.author | Zhou, Wei | |
| dc.date.accessioned | 2013-01-28T16:03:52Z | |
| dc.date.available | 2013-01-28T16:03:52Z | |
| dc.date.issued | 2013-01-28T16:03:52Z | |
| dc.date.submitted | 2012-11-28 | |
| dc.description.abstract | In this thesis, we present efficient deterministic algorithms for polynomial matrix computation problems, including the computation of order basis, minimal kernel basis, matrix inverse, column basis, unimodular completion, determinant, Hermite normal form, rank and rank profile for matrices of univariate polynomials over a field. The algorithm for kernel basis computation also immediately provides an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to polynomial matrix multiplications. The computational costs of our algorithms are then similar to the costs of multiplying matrices, whose dimensions match the input matrix dimensions in the original problems, and whose degrees equal the average column degrees of the original input matrices in most cases. The use of the average column degrees instead of the commonly used matrix degrees, or equivalently the maximum column degrees, makes our computational costs more precise and tighter. In addition, the shifted minimal bases computed by our algorithms are more general than the standard minimal bases. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/7326 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | polynomial matrix computation | en |
| dc.subject | algorithm | en |
| dc.subject | complexity | en |
| dc.subject | computer algebra | en |
| dc.subject | order basis | en |
| dc.subject | kernel basis | en |
| dc.subject | linear system solving | en |
| dc.subject | matrix inverse | en |
| dc.subject | determinant | en |
| dc.subject | unimodular completion | en |
| dc.subject | Popov form | en |
| dc.subject | Hermite form | en |
| dc.subject | column reduced form | en |
| dc.subject | GCD | en |
| dc.subject | matrix GCD | en |
| dc.subject | rank | en |
| dc.subject | rank profile | en |
| dc.subject | column basis | en |
| dc.subject.program | Computer Science | en |
| dc.title | Fast Order Basis and Kernel Basis Computation and Related Problems | en |
| dc.type | Doctoral Thesis | en |
| uws-etd.degree | Doctor of Philosophy | en |
| uws-etd.degree.department | School of Computer Science | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |