On finding multiplicities of characteristic polynomial factors of black-box matrices
| dc.creator | Dumas, Jean-Guillaume | |
| dc.creator | Pernet, Clément | |
| dc.creator | Saunders, B. David | |
| dc.date | 2009-01-29 | |
| dc.date | 2009-05-18 | |
| dc.date.accessioned | 2026-07-07T13:15:27Z | |
| dc.date.available | 2026-07-07T13:15:27Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0901.4747 | |
| dc.identifier | http://arxiv.org/abs/0901.4747 | |
| dc.identifier | (International Symposium on Symbolic and Algebraic Computation 2009), Séoul : Corée, République de (2009) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230475 | |
| dc.subject | Symbolic Computation | |
| dc.title | On finding multiplicities of characteristic polynomial factors of black-box matrices | |
| dc.type | text |