Computing Jordan Canonical Form
Computing the Jordan form requires finding generalized eigenvectors systematically. The process involves analyzing the kernel structure of powers of .
A Jordan chain for eigenvalue is a sequence of vectors satisfying:
The vector is a generalized eigenvector of rank , and the chain corresponds to a Jordan block .
Let .
Step 1: Find eigenvalues. Since is triangular, eigenvalues are diagonal entries: (mult. 2), (mult. 1).
Step 2: For , compute : Only one eigenvector, so geometric multiplicity is 1 < 2 = algebraic multiplicity.
Step 3: Find generalized eigenvector in .
Conclusion: Jordan form is (which equals itself—already in Jordan form).
For eigenvalue :
- Geometric multiplicity counts independent eigenvectors
- Algebraic multiplicity is the multiplicity of as a root of the characteristic polynomial
Always:
The number of Jordan blocks for equals . The sum of sizes of these blocks equals .
For eigenvalue with algebraic multiplicity :
The dimensions form an increasing chain:
Computing Jordan form is more involved than diagonalization and numerically unstable (small perturbations can change the structure). In practice, Jordan form is primarily a theoretical tool for understanding matrix structure. For computation, Schur decomposition is preferred as it's numerically stable.