Rayleigh quotient iteration has a small backward error, monotone residuals and local cubic convergence for Hermitian matrices full
This proof shows: correctness, termination.
Exact arithmetic, except in Lemma 1, which holds for every pair the method returns. Notation of the page: xk is the unit vector after k executions of line L8 (x0 from line L1), ρk=xk∗Axk, rk=Axk−ρkxk, and yk is the solution computed in line L7 from xk, so xk+1=yk/∥yk∥2. We assume that A−ρkI is nonsingular whenever line L7 is executed; the zero pivot rule of line L7 is a floating-point device and is not needed for the statements below.
Lemma 1 (backward error). If line L5 returns (ρ,x), then (A−rx∗)x=ρx with ∥rx∗∥2=∥r∥2≤tol∥A∥F. If A is Hermitian, then also (A+E)x=ρx for the Hermitian E=−(rx∗+xr∗) with ∥E∥2=∥r∥2, and some eigenvalue λ of A satisfies ∣λ−ρ∣≤∥r∥2.
Proof. (A−rx∗)x=Ax−r=ρx because x∗x=1, and the rank-one matrix rx∗ has 2-norm ∥r∥2∥x∥2. If A is Hermitian, ρ is real and x∗r=x∗Ax−ρ=0. Then (A+E)x=Ax−r−x(r∗x)=ρx. If r=0 the claim is trivial; otherwise E acts on the orthonormal pair x,r/∥r∥ by the matrix −∥r∥(0110) and is zero on their orthogonal complement, so ∥E∥2=∥r∥2. By Weyl's inequality the eigenvalues of A and of A+E, both sorted, differ by at most ∥E∥2, and ρ is one of the eigenvalues of A+E. □
Lemma 2 (one step of inverse iteration). Let A be Hermitian with orthonormal eigenvectors vi, fix j, and let σ be real and not an eigenvalue. Let x be a unit vector with vj∗x=0 and θ=∠(x,vj), and let θ′=∠((A−σI)−1x,vj). Then
tanθ′≤tanθmini=j∣λi−σ∣∣λj−σ∣. Proof. Write x=∑icivi. Then (A−σI)−1x=∑ici(λi−σ)−1vi, and
tanθ′=∣cj∣∣λj−σ∣−1(∑i=j∣ci∣2∣λi−σ∣−2)1/2≤mini=j∣λi−σ∣∣λj−σ∣⋅∣cj∣(∑i=j∣ci∣2)1/2. The last factor is tanθ. □
Lemma 3 (the Rayleigh quotient error). For Hermitian A and a unit x with θ=∠(x,vj), ∣ρ(x)−λj∣≤δsin2θ and ∥Ax−ρ(x)x∥2≤δsinθ, where δ=λmax−λmin.
Proof. Write x=ϕcosθvj+sinθw with ∣ϕ∣=1 and a unit w⊥vj. Since Avj=λjvj and w⊥vj, the cross terms vj∗Aw=λjvj∗w vanish, so ρ(x)=cos2θλj+sin2θρ(w) and ρ(x)−λj=sin2θ(ρ(w)−λj). Both ρ(w) and λj lie in [λmin,λmax], which gives the first bound. For the second, ρ(x) minimizes ∥Ax−μx∥2 over μ, so ∥Ax−ρ(x)x∥≤∥(A−λjI)x∥=sinθ∥(A−λjI)w∥≤δsinθ, because w lies in the span of the vi with i=j and ∣λi−λj∣≤δ. □
Theorem 1 (local cubic convergence). Let A be Hermitian, let λj be a simple eigenvalue with gapj=mini=j∣λi−λj∣>0, let c=2δ/gapj, and suppose ctan2θ0<1, where θ0=∠(x0,vj). Then for every k at which the method has not stopped,
tanθk+1≤ctan3θkandtanθk+1≤tanθk, so θk→0, and the order of convergence is at least 3.
Proof. We show by induction that ctan2θk≤ctan2θ0<1. This holds for k=0. Assume it for k. Then δsin2θk≤δtan2θk<gapj/2, so by Lemma 3 ∣ρk−λj∣<gapj/2, and for i=j
∣λi−ρk∣≥∣λi−λj∣−∣λj−ρk∣≥gapj−δsin2θk>gapj/2. If ρk=λj, then ρ(w)=λj in the notation of Lemma 3; the method then either has rk=0 and stops, or meets a singular system, which we excluded. Otherwise Lemma 2 with σ=ρk applies (note vj∗xk=0 because tanθk<∞), and with Lemma 3
tanθk+1≤tanθk⋅gapj/2δsin2θk≤ctan3θk. Since ctan2θk<1, this is at most tanθk, and the induction hypothesis passes to k+1. Finally tanθk≤(ctan2θ0)(3k−1)/2tanθ0 by induction from tanθk+1≤(ctan2θk)tanθk, which tends to 0. □
Theorem 2 (monotone residuals). Let A be Hermitian. For every start and every k at which line L7 is executed, ∥rk+1∥2≤∥rk∥2.
Proof. Let y=yk, so (A−ρkI)y=xk and (A−ρkI)xk+1=xk/∥y∥2. Since ρk+1 minimizes ∥Axk+1−μxk+1∥ over μ,
∥rk+1∥2≤∥(A−ρkI)xk+1∥2=∥y∥21. On the other hand, since A−ρkI is Hermitian, xk+1∗(A−ρkI)xk=((A−ρkI)xk+1)∗xk=xk∗xk/∥y∥2=1/∥y∥2. By the Cauchy-Schwarz inequality, 1/∥y∥2≤∥xk+1∥2∥(A−ρkI)xk∥2=∥rk∥2. □
Theorem 3 (termination). Under the hypotheses of Theorem 1 and for every tol>0, line L5 returns CONVERGED after finitely many steps if maxit is large enough.
Proof. By Lemma 3 and Theorem 1, ∥rk∥2≤δsinθk≤δtanθk→0. If A=0, then tol∥A∥F>0 and the test of line L5 passes for some finite k. If A=0, then r0=0 and the test passes at k=0. □
Remark (the rate is sharp, and it degrades without symmetry). For A=diag(λ1,λ2) and xk=(cosθ,sinθ)T, ρk−λ1=(λ2−λ1)sin2θ, λ2−ρk=(λ2−λ1)cos2θ, and (A−ρkI)−1xk is a multiple of (−cosθ/sin2θ, sinθ/cos2θ)T, so tanθk+1=−tan3θk: equality, with constant 1, as the table of the page shows. For a nonnormal A the identity ρ(x)−λj=sin2θ(ρ(w)−λj) fails, because the cross term vj∗Aw need not vanish; then ∣ρk−λj∣=O(sinθk) only, and Lemma 2 (in its diagonalizable form) gives order 2. ■