Suppose a diagonalizable matrix has a simple eigenvalue uniquely closest to a shift . If the starting vector has a nonzero coefficient in the target eigenbasis direction, fixed-shift inverse iteration converges to that eigenvector line. In fact, the eigenvalues of are , so after inverse applications, division by leaves the target eigenvector plus
This proves direction error in Big O notation. The multiplicative constant depends on the eigenbasis and starting coefficients, and no uniform reduction at the first step follows for a nonsymmetric matrix. Over the real numbers, produces alternating signs. A nonzero ordinary inner product with a right eigenvector is not generally the same as a nonzero coefficient in the eigenbasis; the latter is the required condition.

Articles by others on the same topic (0)

There are currently no matching articles.