Starting from a unit vector , Rayleigh quotient iteration sets , solves
and normalizes . The shift is updated from the new vector.
Let a real symmetric matrix have simple eigenpairs and let
Then its Rayleigh quotient is
After one shifted inverse solve and normalization, the relative coefficients are
Thus the eigenvector direction error is cubed at each sufficiently close iterate.

Articles by others on the same topic (1)

Rayleigh Quotient Iteration is an iterative numerical method used for finding an eigenvalue and corresponding eigenvector of a matrix. It is particularly useful for finding the eigenvalue that is closest to a given initial estimate. This method can be seen as an extension of the standard power iteration and is more efficient, especially when searching for a dominant eigenvalue.