For a nonzero real vector , the Rayleigh quotient of the matrix is
The Rayleigh quotient iteration starts from a unit vector . Given , compute the shift
solve the linear system
and normalize in the Euclidean norm:
The next eigenvalue estimate is . The process stops when the eigenpair residual is sufficiently small.
Differentiate the eigenvalue equation
at , where . Suppressing the argument gives
Left-multiplication by the transpose of the unit left eigenvector and use of cancel the terms involving :
Because the eigenvalue is simple, , and hence the first-order perturbation of a simple eigenvalue is
The definition of the operator norm, followed by the Cauchy-Schwarz inequality, gives
Therefore
If is a real symmetric matrix, the finite-dimensional spectral theorem lets us choose the normalized left eigenvector and right eigenvector to be the same vector. Thus
More generally, the unitary diagonalization of a normal matrix shows that a real normal matrix also has coincident normalized left and right eigenspaces for each real eigenvalue. Since the question assumes , one can again choose , and every such simple eigenvalue has
The displayed matrix is an upper bidiagonal matrix. For , the right eigenvector equation successively gives
We may therefore take the unit right eigenvector to be .
For a left eigenvector, gives
Since ,
Choosing the initial scale produces
After normalization,
The eigenvalue sensitivity is therefore
where is the factorial. Hence
Let the computed eigenpair residual be
Define the rank-one matrix
Then
so is an exact eigenpair of the perturbed matrix . Moreover,
which is the backward error of an approximate eigenpair.
Follow the simple eigenvalue branch from for . The first-order perturbation of a simple eigenvalue and part (b) give
Since the residual is at the machine precision scale, this proves

Articles by others on the same topic (0)

There are currently no matching articles.