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×n with ∣λ1∣≥∣λ2∣≥⋯≥∣λn∣, qk the unit vector after k executions of line L8 (q0 from line L1), ρk=qk∗Aqk, rk=Aqk−ρkqk, θk=∠(qk,v1), and ϱ=∣λ2/λ1∣.
Lemma 1 (the iterates). If the method has not returned before step k+1, then Ajx0=0 for j≤k and qk=Akx0/∥Akx0∥2.
Proof. Induction on k. For k=0 this is line L1. If qk=Akx0/∥Akx0∥ and the method reaches line L8 at step k+1, then z=Aqk=Ak+1x0/∥Akx0∥. If z=0, then r=0 and line L6 returns, so at line L8 z=0, hence Ak+1x0=0, and qk+1=z/∥z∥=Ak+1x0/∥Ak+1x0∥. □
Lemma 2 (backward error). Let q be a unit vector, ρ=q∗Aq and r=Aq−ρq. Then (A−rq∗)q=ρq and ∥rq∗∥2=∥r∥2. So when line L6 returns, (ρ,q) is an exact eigenpair of A+E with ∥E∥2=∥r∥2≤tol∥Aq∥2≤tol∥A∥2.
Proof.(A−rq∗)q=Aq−r(q∗q)=Aq−r=ρq. The rank-one matrix rq∗ has 2-norm ∥r∥2∥q∥2=∥r∥2. □
Theorem 1 (Hermitian A). Let A∗=A with orthonormal eigenvectors vi, ∣λ1∣>∣λ2∣, and c1=v1∗x0=0. Let δ=λmax−λmin. Then for each k≥0:
tanθk≤ϱktanθ0;
∣ρk−λ1∣≤δsin2θk≤δϱ2ktan2θ0;
∥rk∥2≤2δsinθk≤2δϱktanθ0.
Proof. Write x0=∑icivi. By Lemma 1, qk is a positive multiple of Akx0=∑iciλikvi. Since the vi are orthonormal, cosθk=∣c1λ1k∣/∥Akx0∥ and sinθk=(∑i≥2∣ci∣2∣λi∣2k)1/2/∥Akx0∥. Hence
This is item 1. Item 2 is the bound ∣ρ(x)−λj∣≤δsin2∠(x,vj) of the Rayleigh quotient page with j=1, together with sinθ≤tanθ. For item 3 write qk=∑idivi with ∑i∣di∣2=1, ∣d1∣=cosθk and ∑i≥2∣di∣2=sin2θk. Then rk=∑idi(λi−ρk)vi, and
using item 2 for the first term and ∣λi−ρk∣≤δ (both lie in [λmin,λmax]) for the others. □
Theorem 2 (diagonalizable A). Let A=VΛV−1 with unit eigenvectors vi (the columns of V), ∣λ1∣>∣λ2∣, and x0=∑icivi with c1=0. Let C=∑i≥2∣ci/c1∣. Then sinθk≤Cϱk for each k, and ∣ρk−λ1∣≤4∣λ1∣Cϱk whenever Cϱk≤1/2.
Proof.∣λ1∣>∣λ2∣≥0 gives λ1=0. Let wk=Akx0/(c1λ1k)=v1+∑i≥2(ci/c1)(λi/λ1)kvi, a nonzero multiple of qk (Lemma 1). Then ∥wk−v1∥≤∑i≥2∣ci/c1∣∣λi/λ1∣k≤Cϱk. For nonzero w and unit v, sin∠(w,v)=mint∥v−tw∥≤∥v−w∥; with w=wk and v=v1 this gives the first claim. The Rayleigh quotient does not depend on the scale, so
Here (A−λ1I)wk=∑i≥2(ci/c1)(λi/λ1)k(λi−λ1)vi has norm at most 2∣λ1∣Cϱk, because ∣λi−λ1∣≤2∣λ1∣. And ∥wk∥≥1−Cϱk≥1/2. □
Theorem 3 (termination). Under the hypotheses of Theorem 2 and for each tol>0, line L6 returns CONVERGED after finitely many steps if maxit is large enough.
Proof. With wk as above, qk=ϕkwk/∥wk∥ for a scalar ∣ϕk∣=1. Then ∥rk∥≤∥(A−λ1I)qk∥+∣λ1−ρk∣≤2⋅4∣λ1∣Cϱk once Cϱk≤1/2, by the two bounds in the proof of Theorem 2. Also ∥Aqk∥≥∣λ1∣−∥(A−λ1I)qk∥≥∣λ1∣(1−4Cϱk). Since ϱ<1, the ratio ∥rk∥/∥Aqk∥ tends to 0, so it is at most tol for some finite k, and line L6 returns at step k+1. □
Remark (a defective dominant eigenvalue). The hypothesis that A is diagonalizable cannot simply be dropped without a loss of rate. For A=(λ01λ) with real λ=0 and x0=e2, Ake2=(kλk−1,λk)T, so qk is parallel to (k,λ)T, tanθk=∣λ∣/k, and ρk−λ=λk/(k2+λ2). The error decays like 1/k, not geometrically. ■