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

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

2009-01-29

arxiv.org/abs/0901.4747v2

(International Symposium on Symbolic and Algebraic Computation 2009), S\'eoul : Cor\'ee, R\'epublique de (2009)

Computer Science

Symbolic Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On finding multiplicities of characteristic polynomial factors of black-box matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On finding multiplicities of characteristic polynomial factors of black-box matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On finding multiplicities of characteristic polynomial factors of black-box matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14021