Computer Science – Symbolic Computation
Scientific paper
2006-10-24
Journal of Inequalities in Pure and Applied Mathematics 8, 2 (2007) art. 31, 6pp
Computer Science
Symbolic Computation
Scientific paper
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise input-dependant bounds on these coefficients. Such bounds are e.g. useful to perform deterministic chinese remaindering of the characteristic or minimal polynomial of an integer matrix.
No associations
LandOfFree
Bounds on the coefficients of the characteristic and minimal polynomials 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 Bounds on the coefficients of the characteristic and minimal polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the coefficients of the characteristic and minimal polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-343696