Power method with a dominant eigenvalue cluster
ID: power-method-with-a-dominant-eigenvalue-cluster
Suppose a finite-dimensional matrix is diagonalizable and its eigenvalues of largest modulus form a cluster, separated in modulus from the remaining eigenvalues. If the initial vector has a nonzero projection onto the sum of their eigenspaces, normalized power method iterates approach in distance, but need not converge to one vector.
For example, and initial vector give alternating limiting directions in the first two coordinates. If the initial vector has no component in , it never discovers that cluster. Without diagonalizability, Jordan blocks introduce polynomial growth factors, so a statement about the dominant subspace requires additional care.
New to topics? Read the docs here!