Skip to Main content Skip to Navigation
Journal articles

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

Abstract : This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, to our knowledge, this was only achieved by resorting to genericity assumptions or randomization techniques, while the best known complexity bound with a general deterministic algorithm was obtained by Keller-Gehrig in 1985 and involves logarithmic factors. Our algorithm computes more generally the determinant of a univariate polynomial matrix in reduced form, and relies on new subroutines for transforming shifted reduced matrices into shifted weak Popov matrices, and shifted weak Popov matrices into shifted Popov matrices.
Complete list of metadata

https://hal-unilim.archives-ouvertes.fr/hal-02963147
Contributor : Vincent Neiger Connect in order to contact the contributor
Submitted on : Friday, April 9, 2021 - 6:03:39 PM
Last modification on : Sunday, June 26, 2022 - 3:06:58 AM

File

charpoly.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Vincent Neiger, Clément Pernet. Deterministic computation of the characteristic polynomial in the time of matrix multiplication. Journal of Complexity, Elsevier, 2021, 67, pp.101572. ⟨10.1016/j.jco.2021.101572⟩. ⟨hal-02963147v2⟩

Share

Metrics

Record views

162

Files downloads

150