Algorithm Search⌘K

Proofs: Power iteration

These are the human proofs of Power iteration, at full length.

Power iteration returns a small backward error and converges at the rate of the eigenvalue ratio full

This proof shows: correctness, termination.

Exact arithmetic, except in Lemma 2, which holds for every computed pair. Notation of the page: A∈Cn×nA \in \mathbb C^{n \times n} with ∣λ1∣≥∣λ2∣≥⋯≥∣λn∣|\lambda_1| \ge |\lambda_2| \ge \dots \ge |\lambda_n|, qkq_k the unit vector after kk executions of line L8 (q0q_0 from line L1), ρk=qk∗Aqk\rho_k = q_k^* A q_k, rk=Aqk−ρkqkr_k = A q_k - \rho_k q_k, θk=∠(qk,v1)\theta_k = \angle(q_k, v_1), and ϱ=∣λ2/λ1∣\varrho = |\lambda_2 / \lambda_1|.

Lemma 1 (the iterates). If the method has not returned before step k+1k + 1, then Ajx0≠0A^j x_0 \ne 0 for j≤kj \le k and qk=Akx0/∥Akx0∥2q_k = A^k x_0 / \|A^k x_0\|_2.

Proof. Induction on kk. For k=0k = 0 this is line L1. If qk=Akx0/∥Akx0∥q_k = A^k x_0 / \|A^k x_0\| and the method reaches line L8 at step k+1k + 1, then z=Aqk=Ak+1x0/∥Akx0∥z = A q_k = A^{k+1} x_0 / \|A^k x_0\|. If z=0z = 0, then r=0r = 0 and line L6 returns, so at line L8 z≠0z \ne 0, hence Ak+1x0≠0A^{k+1} x_0 \ne 0, and qk+1=z/∥z∥=Ak+1x0/∥Ak+1x0∥q_{k+1} = z / \|z\| = A^{k+1} x_0 / \|A^{k+1} x_0\|. □\square

Lemma 2 (backward error). Let qq be a unit vector, ρ=q∗Aq\rho = q^* A q and r=Aq−ρqr = A q - \rho q. Then (A−rq∗)q=ρq(A - r q^*) q = \rho q and ∥rq∗∥2=∥r∥2\|r q^*\|_2 = \|r\|_2. So when line L6 returns, (ρ,q)(\rho, q) is an exact eigenpair of A+EA + E with ∥E∥2=∥r∥2≤tol ∥Aq∥2≤tol ∥A∥2\|E\|_2 = \|r\|_2 \le \mathrm{tol} \, \|A q\|_2 \le \mathrm{tol} \, \|A\|_2.

Proof. (A−rq∗)q=Aq−r(q∗q)=Aq−r=ρq(A - r q^*) q = A q - r (q^* q) = A q - r = \rho q. The rank-one matrix rq∗r q^* has 2-norm ∥r∥2∥q∥2=∥r∥2\|r\|_2 \|q\|_2 = \|r\|_2. □\square

Theorem 1 (Hermitian A). Let A∗=AA^* = A with orthonormal eigenvectors viv_i, ∣λ1∣>∣λ2∣|\lambda_1| > |\lambda_2|, and c1=v1∗x0≠0c_1 = v_1^* x_0 \ne 0. Let δ=λmax⁡−λmin⁡\delta = \lambda_{\max} - \lambda_{\min}. Then for each k≥0k \ge 0:

  1. tan⁡θk≤ϱktan⁡θ0\tan\theta_k \le \varrho^k \tan\theta_0;
  2. ∣ρk−λ1∣≤δsin⁡2θk≤δ ϱ2ktan⁡2θ0|\rho_k - \lambda_1| \le \delta \sin^2\theta_k \le \delta \, \varrho^{2k} \tan^2\theta_0;
  3. ∥rk∥2≤2 δsin⁡θk≤2 δ ϱktan⁡θ0\|r_k\|_2 \le \sqrt 2 \, \delta \sin\theta_k \le \sqrt 2 \, \delta \, \varrho^k \tan\theta_0.

Proof. Write x0=∑icivix_0 = \sum_i c_i v_i. By Lemma 1, qkq_k is a positive multiple of Akx0=∑iciλikviA^k x_0 = \sum_i c_i \lambda_i^k v_i. Since the viv_i are orthonormal, cos⁡θk=∣c1λ1k∣/∥Akx0∥\cos\theta_k = |c_1 \lambda_1^k| / \|A^k x_0\| and sin⁡θk=(∑i≥2∣ci∣2∣λi∣2k)1/2/∥Akx0∥\sin\theta_k = \bigl(\sum_{i \ge 2} |c_i|^2 |\lambda_i|^{2k}\bigr)^{1/2} / \|A^k x_0\|. Hence

tan⁡θk=(∑i≥2∣ci∣2∣λi∣2k)1/2∣c1∣ ∣λ1∣k≤∣λ2∣k∣λ1∣k⋅(∑i≥2∣ci∣2)1/2∣c1∣=ϱktan⁡θ0.\tan\theta_k = \frac{\bigl(\sum_{i \ge 2} |c_i|^2 |\lambda_i|^{2k}\bigr)^{1/2}}{|c_1| \, |\lambda_1|^k} \le \frac{|\lambda_2|^k}{|\lambda_1|^k} \cdot \frac{\bigl(\sum_{i \ge 2} |c_i|^2\bigr)^{1/2}}{|c_1|} = \varrho^k \tan\theta_0 .

This is item 1. Item 2 is the bound ∣ρ(x)−λj∣≤δsin⁡2∠(x,vj)|\rho(x) - \lambda_j| \le \delta \sin^2\angle(x, v_j) of the Rayleigh quotient page with j=1j = 1, together with sin⁡θ≤tan⁡θ\sin\theta \le \tan\theta. For item 3 write qk=∑idiviq_k = \sum_i d_i v_i with ∑i∣di∣2=1\sum_i |d_i|^2 = 1, ∣d1∣=cos⁡θk|d_1| = \cos\theta_k and ∑i≥2∣di∣2=sin⁡2θk\sum_{i \ge 2} |d_i|^2 = \sin^2\theta_k. Then rk=∑idi(λi−ρk)vir_k = \sum_i d_i (\lambda_i - \rho_k) v_i, and

∥rk∥22=∣d1∣2(λ1−ρk)2+∑i≥2∣di∣2(λi−ρk)2≤δ2sin⁡4θk+δ2sin⁡2θk≤2δ2sin⁡2θk,\|r_k\|_2^2 = |d_1|^2 (\lambda_1 - \rho_k)^2 + \sum_{i \ge 2} |d_i|^2 (\lambda_i - \rho_k)^2 \le \delta^2 \sin^4\theta_k + \delta^2 \sin^2\theta_k \le 2 \delta^2 \sin^2\theta_k,

using item 2 for the first term and ∣λi−ρk∣≤δ|\lambda_i - \rho_k| \le \delta (both lie in [λmin⁡,λmax⁡][\lambda_{\min}, \lambda_{\max}]) for the others. □\square

Theorem 2 (diagonalizable A). Let A=VΛV−1A = V \Lambda V^{-1} with unit eigenvectors viv_i (the columns of VV), ∣λ1∣>∣λ2∣|\lambda_1| > |\lambda_2|, and x0=∑icivix_0 = \sum_i c_i v_i with c1≠0c_1 \ne 0. Let C=∑i≥2∣ci/c1∣C = \sum_{i \ge 2} |c_i / c_1|. Then sin⁡θk≤Cϱk\sin\theta_k \le C \varrho^k for each kk, and ∣ρk−λ1∣≤4∣λ1∣Cϱk|\rho_k - \lambda_1| \le 4 |\lambda_1| C \varrho^k whenever Cϱk≤1/2C \varrho^k \le 1/2.

Proof. ∣λ1∣>∣λ2∣≥0|\lambda_1| > |\lambda_2| \ge 0 gives λ1≠0\lambda_1 \ne 0. Let wk=Akx0/(c1λ1k)=v1+∑i≥2(ci/c1)(λi/λ1)kviw_k = A^k x_0 / (c_1 \lambda_1^k) = v_1 + \sum_{i \ge 2} (c_i / c_1) (\lambda_i / \lambda_1)^k v_i, a nonzero multiple of qkq_k (Lemma 1). Then ∥wk−v1∥≤∑i≥2∣ci/c1∣ ∣λi/λ1∣k≤Cϱk\|w_k - v_1\| \le \sum_{i \ge 2} |c_i / c_1| \, |\lambda_i / \lambda_1|^k \le C \varrho^k. For nonzero ww and unit vv, sin⁡∠(w,v)=min⁡t∥v−tw∥≤∥v−w∥\sin\angle(w, v) = \min_t \|v - t w\| \le \|v - w\|; with w=wkw = w_k and v=v1v = v_1 this gives the first claim. The Rayleigh quotient does not depend on the scale, so

∣ρk−λ1∣=∣wk∗(A−λ1I)wk∣wk∗wk≤∥(A−λ1I)wk∥∥wk∥.|\rho_k - \lambda_1| = \frac{|w_k^* (A - \lambda_1 I) w_k|}{w_k^* w_k} \le \frac{\|(A - \lambda_1 I) w_k\|}{\|w_k\|}.

Here (A−λ1I)wk=∑i≥2(ci/c1)(λi/λ1)k(λi−λ1)vi(A - \lambda_1 I) w_k = \sum_{i \ge 2} (c_i / c_1) (\lambda_i / \lambda_1)^k (\lambda_i - \lambda_1) v_i has norm at most 2∣λ1∣Cϱk2 |\lambda_1| C \varrho^k, because ∣λi−λ1∣≤2∣λ1∣|\lambda_i - \lambda_1| \le 2|\lambda_1|. And ∥wk∥≥1−Cϱk≥1/2\|w_k\| \ge 1 - C \varrho^k \ge 1/2. □\square

Theorem 3 (termination). Under the hypotheses of Theorem 2 and for each tol>0\mathrm{tol} > 0, line L6 returns CONVERGED after finitely many steps if maxit\mathrm{maxit} is large enough.

Proof. With wkw_k as above, qk=ϕkwk/∥wk∥q_k = \phi_k w_k / \|w_k\| for a scalar ∣ϕk∣=1|\phi_k| = 1. Then ∥rk∥≤∥(A−λ1I)qk∥+∣λ1−ρk∣≤2⋅4∣λ1∣Cϱk\|r_k\| \le \|(A - \lambda_1 I) q_k\| + |\lambda_1 - \rho_k| \le 2 \cdot 4 |\lambda_1| C \varrho^k once Cϱk≤1/2C \varrho^k \le 1/2, by the two bounds in the proof of Theorem 2. Also ∥Aqk∥≥∣λ1∣−∥(A−λ1I)qk∥≥∣λ1∣(1−4Cϱk)\|A q_k\| \ge |\lambda_1| - \|(A - \lambda_1 I) q_k\| \ge |\lambda_1| (1 - 4 C \varrho^k). Since ϱ<1\varrho < 1, the ratio ∥rk∥/∥Aqk∥\|r_k\| / \|A q_k\| tends to 00, so it is at most tol\mathrm{tol} for some finite kk, and line L6 returns at step k+1k + 1. □\square

Remark (a defective dominant eigenvalue). The hypothesis that AA is diagonalizable cannot simply be dropped without a loss of rate. For A=(λ10λ)A = \begin{pmatrix} \lambda & 1 \\ 0 & \lambda \end{pmatrix} with real λ≠0\lambda \ne 0 and x0=e2x_0 = e_2, Ake2=(kλk−1,λk)TA^k e_2 = (k \lambda^{k-1}, \lambda^k)^T, so qkq_k is parallel to (k,λ)T(k, \lambda)^T, tan⁡θk=∣λ∣/k\tan\theta_k = |\lambda| / k, and ρk−λ=λk/(k2+λ2)\rho_k - \lambda = \lambda k / (k^2 + \lambda^2). The error decays like 1/k1/k, not geometrically. ■\blacksquare

Back to Power iteration