A fast and nearly division-free algorithm for the characteristic polynomial

1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Domain :

Cited literature [27 references]

https://hal.inria.fr/hal-03016034
Contributor : Fredrik Johansson <>
Submitted on : Friday, November 20, 2020 - 10:58:16 AM
Last modification on : Monday, November 23, 2020 - 3:24:15 AM

Files

paper.pdf
Files produced by the author(s)

Identifiers

• HAL Id : hal-03016034, version 1

Citation

Fredrik Johansson. A fast and nearly division-free algorithm for the characteristic polynomial. 2020. ⟨hal-03016034v1⟩

Record views