Systems with repeated eigenvalues
This topic is fully treated by Brogan (1991, p 250), but not by (Rowell1997?). Every
This gives rise to the three cases that follow.
- full degeneracy
-
When
, the eigenvalue problem has independent solutions for . So, even though there were not distinct eigenvalues, distinct eigenvectors still exist and we can diagonalize or decouple the system as before. - simple degeneracy
-
When
, the eigenvalue problem has independent solutions for . We would still like to construct a basis set of independent vectors, but they can no longer be eigenvectors, and we will no longer be able to fully diagonalize or decouple the system. There are multiple ways of doing this (e.g. Gram-Schmidt), but the typical and most nearly diagonal way is to construct generalized eigenvectors (here also called ), which will be included in the modal matrix along with the eigenvectors. The generalized eigenvectors are found by solving the usual eigenvalue/vector problem for the first eigenvector corresponding to , then solving it again with the following equations to find the generalized eigenvectorsThis forms the modal matrix
. The block-diagonal Jordan form matrix , analogous to the diagonal is which gives the most-decoupled state transition matrix - general degeneracy
-
If
, the preceding method applies, but it may be ambiguous as to which eigenvector the generalized eigenvectors correspond (or how many for each). This can be approached by trial and error or a systematic method presented by Brogan (1991, p 255).
Online Resources for Section B.1
No online resources.