Jordan Normal and Rational Normal Form Algorithms

Details Jordan Normal and Rational Normal Form Algorithms Jordan Normal and Rational Normal Form Algorithms

2004-12-02

arxiv.org/abs/cs/0412005v1

Computer Science

Symbolic Computation

Scientific paper

In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: \[(\lambda \cdot I-A) \cdot B(\lambda)=P(\lambda) \cdot I\] where $B(\lambda)$ is $(\lambda \cdot I-A)$'s comatrix and $P(\lambda)$ is $A$'s characteristic polynomial. This rational Jordan normal form algorithm differs from usual algorithms since it is not based on the Frobenius/Smith normal form but rather on the idea already remarked in Gantmacher that the non-zero column vectors of $B(\lambda_0)$ are eigenvectors of $A$ associated to $\lambda_0$ for any root $\lambda_0$ of the characteristical polynomial. The complexity of the algorithm is $O(n^4)$ field operations if we know the factorization of the characteristic polynomial (or $O(n^5 \ln(n))$ operations for a matrix of integers of fixed size). This algorithm has been implemented using the Maple and Giac/Xcas computer algebra systems.

Affiliated with

Also associated with

No associations

Rating

Jordan Normal and Rational Normal Form Algorithms 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 Jordan Normal and Rational Normal Form Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jordan Normal and Rational Normal Form Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146461