On a fast and nearly division-free algorithm for the characteristic polynomial
JOHANSSON, Fredrik
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
JOHANSSON, Fredrik
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
< Leer menos
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Idioma
en
Document de travail - Pré-publication
Resumen en inglés
We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions ...Leer más >
We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method 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 algorithm is a baby-step giant-step version of the more well-known Faddeev-Leverrier algorithm. We make a few comments about the algorithm and evaluate its performance empirically.< Leer menos
Orígen
Importado de HalCentros de investigación