Efficient Computation of the Characteristic Polynomial - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Efficient Computation of the Characteristic Polynomial

Abstract

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian elimination. We compare it to an improvement of the second algorithm of Keller-Gehrig. Then we show that a generalization of Keller-Gehrig\'s third algorithm could improve both complexity and computational time. We use these results as a basis for the computation of the characteristic polynomial of integer matrices. We first use early termination and Chinese remaindering for dense matrices. Then a probabilistic approach, based on integer minimal polynomial and Hensel factorization, is particularly well suited to sparse and/or structured matrices.
Fichier principal
Vignette du fichier
charpoly.pdf (252.81 Ko) Télécharger le fichier
Loading...

Dates and versions

hal-00004056 , version 1 (25-01-2005)
hal-00004056 , version 2 (08-02-2005)

Identifiers

Cite

Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan. Efficient Computation of the Characteristic Polynomial. International Symposium on Symbolic and Algebraic Computation (ISSAC'15), Jul 2005, Beijing, China. pp.140-147. ⟨hal-00004056v2⟩

Collections

UGA CNRS LMC-IMAG
196 View
1671 Download

Altmetric

Share

Gmail Facebook X LinkedIn More