For a nonzero real vector , the Rayleigh quotient of the matrix isThe Rayleigh quotient iteration starts from a unit vector . Given , compute the shiftsolve the linear systemand normalize in the Euclidean norm:The next eigenvalue estimate is . The process stops when the eigenpair residual is sufficiently small.
Differentiate the eigenvalue equationat , where . Suppressing the argument givesLeft-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 isThe definition of the operator norm, followed by the Cauchy-Schwarz inequality, givesTherefore
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 givesWe may therefore take the unit right eigenvector to be .
For a left eigenvector, givesSince ,Choosing the initial scale producesAfter normalization,The eigenvalue sensitivity is thereforewhere is the factorial. Hence
Let the computed eigenpair residual beDefine the rank-one matrixThenso 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) giveSince the residual is at the machine precision scale, this proves
Articles by others on the same topic
There are currently no matching articles.