Fast algorithms for the characteristic polynomial

Processor efficient parallel solution of linear systems over an abstract field

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

An efficient approach to removing geometric degeneracies

SCG '92 Proceedings of the eighth annual symposium on Computational geometry

Fast algorithms for rational forms of integer matrices

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation

Fast parallel computation of the Smith normal form of polynomial matrices

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation

Computing Popov and Hermite forms of polynomial matrices

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

The complexity of the matrix eigenproblem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Cited References

Computer algebra handbook

Efficient decomposition of separable algebras

Journal of Symbolic Computation

LU based algorithms for characteristic polynomial over a finite field

ACM SIGSAM Bulletin

Efficient computation of the characteristic polynomial

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Faster algorithms for the characteristic polynomial

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

On finding multiplicities of characteristic polynomial factors of black-box matrices

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

Dynamic matrix rank

Theoretical Computer Science

Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

Journal of Symbolic Computation

Dynamic matrix rank

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Fast change of ordering with exponent ω

ACM Communications in Computer Algebra