power method

In mathematics, power iteration (also known as the power method) is an eigenvalue algorithm: given a diagonalizable matrix $A$, the algorithm will produce a number $\lambda$, which is the greatest (in absolute value) eigenvalue of $A$, and a nonzero vector $v$, which is a corresponding eigenvector of $\lambda$, that is, $Av = \lambda v$.
The algorithm is also known as the Von Mises iteration. Richard von Mises and H. Pollaczek-Geiringer,
''Praktische Verfahren der Gleichungsauflösung'', ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik 9, 152-164 (1929).

Power iteration is a very simple algorithm, but it may converge slowly. The most time-consuming operation of the algorithm is the multiplication of matrix $A$ by a vector, so it is effective for a very large sparse matrix with appropriate implementation. The speed of convergence is like $(\lambda_2 / \lambda_1)^k$ where $k$ is the number of iterations (see a later section). In words, convergence is exponential with base being the spectral gap.

The method

The power iteration algorithm starts with a vector $b_0$, which may be an approximation to the dominant eigenvector or a random vector. The method is described by the recurrence relation
:$b_ = \frac$
So, at every iteration, the vector $b_k$ is multiplied by the matrix $A$ and normalized.

If we assume $A$ has an eigenvalue that is strictly greater in magnitude than its other eigenvalues and the starting vector $b_0$ has a nonzero component in the direction of an eigenvector associated with the dominant eigenvalue, then a subsequence $\left( b_ \right)$ converges to an eigenvector associated with the dominant eigenvalue.

Without the two assumptions above, the sequence $\left( b_ \right)$ does not necessarily converge. In this sequence,
: $b_k = e^ v_1 + r_k$,
where $v_1$ is an eigenvector associated with the dominant eigenvalue, and $\, r_ \, \rightarrow 0$. The presence of the term $e^$ implies that $\left( b_ \right)$ does not converge unless $e^ = 1$. Under the two assumptions listed above, the sequence $\left( \mu_ \right)$ defined by
: $\mu_ = \frac$
converges to the dominant eigenvalue (with Rayleigh quotient).

One may compute this with the following algorithm (shown in Python with NumPy):

#!/usr/bin/env python3

import numpy as np

def power_iteration(A, num_iterations: int):
# Ideally choose a random vector
# To decrease the chance that our vector
# Is orthogonal to the eigenvector
b_k = np.random.rand(A.shape

for _ in range(num_iterations):
# calculate the matrix-by-vector product Ab
b_k1 = np.dot(A, b_k)

# calculate the norm
b_k1_norm = np.linalg.norm(b_k1)

# re normalize the vector
b_k = b_k1 / b_k1_norm

return b_k

power_iteration(np.array( 0.5, 0.5 .2, 0.8), 10)

The vector $b_k$ converges to an associated eigenvector. Ideally, one should use the Rayleigh quotient in order to get the associated eigenvalue.

This algorithm is used to calculate the ''Google PageRank''.

The method can also be used to calculate the spectral radius (the eigenvalue with the largest magnitude, for a square matrix) by computing the Rayleigh quotient
:$\rho(A) = \max \left \ = \frac.$

Analysis

Let $A$ be decomposed into its Jordan canonical form: $A=VJV^$, where the first column of $V$ is an eigenvector of $A$ corresponding to the dominant eigenvalue $\lambda_$. Since generically, the dominant eigenvalue of $A$ is unique, the first Jordan block of $J$ is the $1 \times 1$ matrix lambda_1 where $\lambda_$ is the largest eigenvalue of ''A'' in magnitude. The starting vector $b_0$ can be written as a linear combination of the columns of ''V'':

:$b_ = c_v_ + c_v_ + \cdots + c_v_.$

By assumption, $b_$ has a nonzero component in the direction of the dominant eigenvector, so $c_ \ne 0$.

The computationally useful recurrence relation for $b_$ can be rewritten as:

:$b_=\frac=\frac,$

where the expression: $\frac$ is more amenable to the following analysis.

:$\begin b_k &= \frac \\ &= \frac \\ &= \frac \\ &= \frac \\ &= \frac \\ &= \left( \frac \right)^ \frac \frac \end$

The expression above simplifies as $k \to \infty$

:\left( \frac J \right)^ =
\begin
& & & & \\
& \left( \frac J_ \right)^& & & \\
& & \ddots & \\
& & & \left( \frac J_ \right)^ \\
\end
\rightarrow
\begin
1 & & & & \\
& 0 & & & \\
& & \ddots & \\
& & & 0 \\
\end \quad \text \quad k \to \infty.

The limit follows from the fact that the eigenvalue of $\frac J_$ is less than 1 in magnitude, so

:$\left( \frac J_ \right)^ \to 0 \quad \text \quad k \to \infty.$

It follows that:

:$\frac V \left( \frac J \right)^ \left( c_e_ + \cdots + c_e_ \right) \to 0 \quad \text \quad k \to \infty$

Using this fact, $b_$ can be written in a form that emphasizes its relationship with $v_$ when ''k'' is large:

:\begin
b_k &= \left( \frac \right)^ \frac \frac \\ pt &= e^ \frac \frac + r_
\end

where $e^ = \left( \lambda_ / , \lambda_, \right)^$ and $\, r_ \, \to 0$ as $k \to \infty$

The sequence $\left( b_ \right)$ is bounded, so it contains a convergent subsequence. Note that the eigenvector corresponding to the dominant eigenvalue is only unique up to a scalar, so although the sequence $\left(b_\right)$ may not converge,
$b_$ is nearly an eigenvector of ''A'' for large ''k''.

Alternatively, if ''A'' is diagonalizable, then the following proof yields the same result

Let λ₁, λ₂, ..., λ_''m'' be the m eigenvalues (counted with multiplicity) of A and let ''v''₁, ''v''₂, ..., ''v''_''m'' be the corresponding eigenvectors. Suppose that $\lambda_1$ is the dominant eigenvalue, so that $, \lambda_1, > , \lambda_j,$ for $j>1$.

The initial vector $b_0$ can be written:

:$b_0 = c_v_ + c_v_ + \cdots + c_v_.$

If $b_0$ is chosen randomly (with uniform probability), then ''c''₁ ≠ 0 with probability 1. Now,

:$\begin A^b_0 &= c_A^v_ + c_A^v_ + \cdots + c_A^v_ \\ &= c_\lambda_^v_ + c_\lambda_^v_ + \cdots + c_\lambda_^v_ \\ &= c_\lambda_^ \left( v_ + \frac\left(\frac\right)^v_ + \cdots + \frac\left(\frac\right)^v_\right) \\ &\to c_\lambda_^ v_1 && \left , \frac \right , < 1 \text j>1 \end$

On the other hand:

:$b_k = \frac.$

Therefore, $b_k$ converges to (a multiple of) the eigenvector $v_1$. The convergence is geometric, with ratio

:$\left, \frac \,$

where $\lambda_2$ denotes the second dominant eigenvalue. Thus, the method converges slowly if there is an eigenvalue close in magnitude to the dominant eigenvalue.

Applications

Although the power iteration method approximates only one eigenvalue of a matrix, it remains useful for certain computational problems. For instance, Google uses it to calculate the PageRank of documents in their search engine, and Twitter uses it to show users recommendations of whom to follow.Pankaj Gupta, Ashish Goel, Jimmy Lin, Aneesh Sharma, Dong Wang, and Reza Bosagh Zade
WTF: The who-to-follow system at Twitter
Proceedings of the 22nd international conference on World Wide Web The power iteration method is especially suitable for sparse matrices, such as the web matrix, or as the matrix-free method that does not require storing the coefficient matrix $A$ explicitly, but can instead access a function evaluating matrix-vector products $Ax$. For non-symmetric matrices that are well-conditioned the power iteration method can outperform more complex Arnoldi iteration. For symmetric matrices, the power iteration method is rarely used, since its convergence speed can be easily increased without sacrificing the small cost per iteration; see, e.g., Lanczos iteration and LOBPCG.

Some of the more advanced eigenvalue algorithms can be understood as variations of the power iteration. For instance, the inverse iteration method applies power iteration to the matrix $A^$. Other algorithms look at the whole subspace generated by the vectors $b_k$. This subspace is known as the Krylov subspace. It can be computed by Arnoldi iteration or Lanczos iteration.
Gram iteration is a super-linear and deterministic method to compute the largest eigenpair.

See also

* Rayleigh quotient iteration
* Inverse iteration

References

{{DEFAULTSORT:Power Iteration
Numerical linear algebra
Articles with example Python (programming language) code