Computing Characteristic Polynomials over Z
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.