A fast and nearly division-free algorithm for the characteristic polynomial
Résumé
We give a simple $O(n^{3.5})$ algorithm for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix, using only ring operations together with exact divisions by small integers. The method is a baby-step giant-step version of the Faddeev-Leverrier algorithm.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...