06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

15.1. THE POWER METHOD FOR EIGENVALUES 375<br />

Now begin with this one.<br />

⎛<br />

5 −14 11<br />

⎞ ⎛<br />

⎝ −4 4 −4 ⎠ ⎝<br />

3 6 −3<br />

Divide by 12 to get the next iterate.<br />

⎛<br />

⎝<br />

⎞ ⎛<br />

1.0<br />

−0.5 ⎠ = ⎝<br />

−1. 430 6 × 10 −6<br />

⎞ ⎛<br />

12. 000<br />

−6. 000 0 ⎠ 1<br />

4. 291 8 × 10 −6 12 = ⎝<br />

1.0<br />

⎞<br />

−0.5 ⎠<br />

12. 000<br />

⎞<br />

−6. 000 0 ⎠<br />

Another iteration will reveal that the scaling factor is still 12. Thus this is an approximate<br />

eigenvalue. In fact, it is the largest eigenvalue and the corresponding eigenvector is<br />

⎛<br />

⎝ 1.0<br />

⎞<br />

−0.5 ⎠<br />

0<br />

The process has worked very well.<br />

15.1.1 The Shifted Inverse Power Method<br />

This method can find various eigenvalues and eigenvectors. It is a significant generalization<br />

of the above simple procedure and yields very good results. One can find complex eigenvalues<br />

using this method. The situation is this: You have a number, α which is close to λ, some<br />

eigenvalue of an n × n matrix A. You don’t know λ but you know that α is closer to λ<br />

than to any other eigenvalue. Your problem is to find both λ and an eigenvector which goes<br />

with λ. Another way to look at this is to start with α and seek the eigenvalue λ, which is<br />

closest to α along with an eigenvector associated with λ. If α is an eigenvalue of A, then<br />

you have what you want. Therefore, I will always assume α is not an eigenvalue of A and<br />

so (A − αI) −1 exists. The method is based on the following lemma.<br />

Lemma 15.1.3 Let {λ k } n k=1 be the eigenvalues of A. If x k is an eigenvector of A for the<br />

eigenvalue λ k , then x k is an eigenvector for (A − αI) −1 corresponding to the eigenvalue<br />

1<br />

λ k −α . Conversely, if (A − αI) −1 y = 1<br />

λ − α y (15.4)<br />

and y ≠ 0, thenAy = λy.<br />

Proof: Let λ k and x k be as described in the statement of the lemma. Then<br />

(A − αI) x k =(λ k − α) x k<br />

and so<br />

1<br />

λ k − α x k =(A − αI) −1 x k .<br />

Suppose (15.4). Then y = 1<br />

λ−α<br />

[Ay − αy] . Solving for Ay leads to Ay = λy. <br />

1<br />

Now assume α is closer to λ than to any other eigenvalue. Then the magnitude of<br />

λ−α<br />

is greater than the magnitude of all the other eigenvalues of (A − αI) −1 . Therefore, the<br />

power method applied to (A − αI) −1 1<br />

will yield<br />

λ−α . You end up with s n+1 ≈ 1<br />

λ−α<br />

and<br />

solve for λ.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!