# Power Iteration over Rayleigh Quotient Iteration?

It is a commonly known fact that the Rayleigh Quotient converges cubically (1), while the Power Iteration may converge slowly if the difference between the dominant and second-dominant eigenvalue is small.

Knowing this, when would it ever be beneficial to use the Power Iteration over the Rayleigh Quotient Iteration? The only possible upside that I can see with the Power Iteration is that it consists of a matrix-vector multiplication $O(n^2)$, while the Rayleigh Quotient iteration requires the solving a system of equations $O(n^{3})$.

Is there a specific size threshold that needs to be reached before the Power Iteration becomes superior? What about for matrices with a specific structure?

References

1. Parlett, Beresford N. "The Rayleigh quotient iteration and some generalizations for nonnormal matrices." Mathematics of Computation 28.127 (1974): 679-693.
• If that is a well known fact you would not mind giving a reference. Commented Mar 11, 2016 at 21:17
• ams.org/journals/mcom/1974-28-127/S0025-5718-1974-0405823-3/… Commented Mar 11, 2016 at 21:33
• For some matrices (e.g., the original google page rank method) you're only after the Perron-Frobenius eigenvector and ignore the rest completely, and the matrix is large enough that you can't easily (or at all) solve linear systems with it. In the page rank case the number of nonzero entries would be something like the number of links that you've crawled, so my impression was that you could multiply but couldn't divide. I'm not sure how realistic that is, but I think it's described in one the papers. Commented Mar 12, 2016 at 2:28
• If you have an $O(n)$ method for matrix-vector multiplication, you should publish it! ;-) Commented Mar 14, 2016 at 5:05
• Oh, my bad, I will fix my error at once. Commented Mar 14, 2016 at 12:20

Power and Rayleigh iterations are fundamentally different beasts, because the former uses only matrix-vector products with $A$, while the latter uses matrix-vector products with $(A+zI)^{-1}$. This is a very important point -- neither algorithms require explicit access to the matrix itself, but only certain actions of the matrix.
Consider the case where $A$ is actually dense, but matrix-vector products can be efficiently computed. For example, gravity is a dense interaction, meaning that every body interacts with every other body. If the strengths of the interactions between $n$ bodies are tabulated as the $n\times n$ matrix $A$, then it will contain $n^2$ nonzero elements. For very large $n$, these $n^2$ elements might not even fit in memory. However, the matrix-vector product $Ax$ can be computed in just $O(n)$ complexity using the fast multipole method, without ever having to form the matrix. Accordingly, it is possible to compute $\lambda_\max(A)$ using power iterations, even as $n$ scales into the billions.
On the other hand, when $A$ is a sparse matrix, there often exist a reordering of the columns of the matrix such that $(A+zI)^{-1}x$ can be computed in near-linear or linear complexity. After an initial symbolic factorization step, only $\approx O(n)$ work is required to compute each Rayleigh iteration. In this case, there is very little reason to even consider power iterations.
Finally, I should note that power iterations is a suboptimal Krylov subspace method. Wherever power iterations can be used, the Lanczos iterations can do better. In fact, using exact arithmetic, Lanczos is guaranteed to converge after $n$ iterations.