Rayleigh Quotient

Rewrite for minimizing 02/22/15, by maximizing x'Bx over x'Ax=1.

We go back to maximizing the Rayleigh quotient where we now assume that both and are positive definite. Maximizing is equivalent to maximizing on the condition that . By Cauchy-Schwartz and thus for the majorization we maximize over This defines an algorithmic map which sets the update of proportional to i.e. we have a shown global convergence of the power method to compute the largest generalized eigenvalue.

We can also establish the linear convergence rate quite easily, using \ref{T:ostrow}. For definiteness we normalize in each iteration, and set At a point which has and we have It follows that has eigenvalues and , with the ``remaining'' eigenvalues of Thus if is the largest eigenvalue, we find a linear rate of

There are several things in this analysis which may go wrong, and they are all quite instructive.