Fast algorithms for the characteristic polynomial
Theoretical Computer Science
Nearly optimal algorithms for canonical matrix forms
Nearly optimal algorithms for canonical matrix forms
Nearly Optimal Algorithms For Canonical Matrix Forms
SIAM Journal on Computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Deterministic Computation of the Frobenius Form
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
FFPACK: finite field linear algebra package
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Efficient computation of the characteristic polynomial
Proceedings of the 2005 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
Generic design of Chinese remaindering schemes
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science
| Hi-index | 0.00 |
A new randomized algorithm is presented for computing the characteristic polynomial of an n x n matrix over a field. Over a suffciently large field the asymptotic expected complexity of the algorithm is O(nθ)field operations, improving by a factor of log n on the worst case complexity of Keller-Gehrig's algorithm [11].