Computing characteristic polynomials of matrices of structured polynomials

Date created: 
2017-04-13
Identifier: 
etd10125
Keywords: 
Exact Linear Algebra
Characteristic Polynomial
High Performance Parallel Algorithms
Abstract: 

We present a parallel modular algorithm for finding characteristic polynomials of matrices with integer coefficient bivariate monomials. For each prime, evaluation and interpolation gives us the bridge between polynomial matrices and matrices over a finite field so that the Hessenberg algorithm can be used. After optimizations, we are able to save a significant amount of work by incremental Chinese remaindering and early termination.

Document type: 
Thesis
Rights: 
This thesis may be printed or downloaded for non-commercial research and scholarly purposes. Copyright remains with the author.
File(s): 
Senior supervisor: 
Michael Monagan
Department: 
Science: Department of Mathematics
Thesis type: 
(Thesis) M.Sc.
Statistics: