On finding multiplicities of characteristic polynomial factors of black-box matrices - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

On finding multiplicities of characteristic polynomial factors of black-box matrices

Abstract

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to matrices either over the integers or over a large enough finite field. Experiments show that these methods perform efficiently in practice. Combined in an adaptive strategy, these algorithms reach significant speedups in practice for some integer matrices arising in an application from graph theory.
Fichier principal
Vignette du fichier
multip.pdf (239.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00357262 , version 1 (29-01-2009)
hal-00357262 , version 2 (18-05-2009)

Identifiers

Cite

Jean-Guillaume Dumas, Clément Pernet, B. David Saunders. On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009 - International Symposium on Symbolic and Algebraic Computation, Jul 2009, Séoul, South Korea. pp.135-142, ⟨10.1145/1576702.1576723⟩. ⟨hal-00357262v2⟩
321 View
502 Download

Altmetric

Share

Gmail Facebook X LinkedIn More