CECM Home > Events > CECM Annual Summer Meeting 2005 > Program > Poster Abstract: Simon Lo
Poster Abstract
Computing Characteristic Polynomials over Z
Simon Lo
We compare Maple implementations of a modular algorithm for computing the characteristic polynomial of an integer marix with the Berkowitz algorithm. The computation modulo a prime is implemented in. The best results come from simulating mod p arithmetic using floats. Two improvements have been made to further improve the timings.