Download presentation

Presentation is loading. Please wait.

Published byDominic Francis Modified over 4 years ago

1
1 MAC 2103 Module 12 Eigenvalues and Eigenvectors

2
2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors of an n x n matrix. Find the algebraic multiplicity and the geometric multiplicity of an eigenvalue. 2. Find a basis for each eigenspace of an eigenvalue. 3. Determine whether a matrix A is diagonalizable. 4. Find a matrix P, P -1, and D that diagonalize A if A is diagonalizable. 5. Find an orthogonal matrix P with P -1 = P T and D that diagonalize A if A is symmetric and diagonalizable. 6. Determine the power and the eigenvalues of a matrix, A k. http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

3
3 Rev.09 Eigenvalues and Eigenvectors http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Eigenvalues, Eigenvectors, Eigenspace, Diagonalization and Orthogonal Diagonalization The major topics in this module:

4
4 Rev.F09 What are Eigenvalues and Eigenvectors? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. If A is an n x n matrix and λ is a scalar for which Ax = λx has a nontrivial solution x ∈ ℜ ⁿ, then λ is an eigenvalue of A and x is a corresponding eigenvector of A. Ax = λx is called the eigenvalue problem for A. Note that we can rewrite the equation Ax = λx = λI n x as follows: λI n x - Ax = 0 or (λI n - A)x = 0. x = 0 is the trivial solution. But our solutions must be nonzero vectors called eigenvectors that correspond to each of the distinct eigenvalues.

5
5 Rev.F09 What are Eigenvalues and Eigenvectors? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Since we seek a nontrivial solution to (λI n - A)x = (λI - A)x = 0, λI - A must be singular to have solutions x ≠ 0. This means that the det(λI - A) = 0. The det(λI - A) = p(λ) = 0 is the characteristic equation, where det(λI - A) = p(λ) is the characteristic polynomial. The deg(p(λ)) = n and the n roots of p(λ), λ 1, λ 2, …,λ n, are the eigenvalues of A. The polynomial p(λ) always has n roots, so the zeros always exist; but some may be complex and some may be repeated. In our examples, all of the roots will be real. For each λ i we solve for x i = p i the corresponding eigenvector, and Ap i = λ i p i for each distinct eigenvalue.

6
6 Rev.F09 How to Solve the Eigenvalue Problem, Ax = λx? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Example 1: Find the eigenvalues and the corresponding eigenvectors of A. Step 1: Find the characteristic equation of A and solve for its eigenvalues. Each eigenvalue has algebraic multiplicity 1.

7
7 Rev.F09 How to Solve the Eigenvalue Problem, Ax = λx?(Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Step 2: Use Gaussian elimination with back-substitution to solve the (λI - A) x = 0 for λ 1 and λ 2. The augmented matrix for the system with λ 1 = -5: The second column is not a leading column, so x 2 = t is a free variable, and x 1 = x 2 = t. Thus, the solution corresponding to λ 1 = -5 is

8
8 Rev.F09 How to Solve the Eigenvalue Problem, Ax = λx? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Since t is a free variable, there are infinitely many eigenvectors. For convenience, we choose t = 1, and as the eigenvector for λ 1 = -5. If we want p 1 to be a unit vector, we will choose t so that However, t =1 is fine in this problem. The augmented matrix for the system with λ 2 = 2:

9
9 Rev.F09 How to Solve the Eigenvalue Problem, Ax = λx? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Again, the second column is not a leading column, so x 2 = t is a free variable, and x 1 = - 2x 2 / 5 = - 2t / 5. Thus, the solution corresponding to λ 1 = 2 is For convenience, we choose t = 5 and as the eigenvector for λ 1 = 2. Alright, we have finished solving the eigenvalue problem for

10
10 Rev.F09 Eigenspaces http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. For each eigenvalue λ, there is an eigenspace E λ with a basis formed from the linearly independent eigenvectors for λ. The dim(E λ ) is the geometric multiplicity of λ, which is the number of linearly independent eigenvectors associated with λ. We will see that the geometric multiplicity equals the algebraic multiplicity for each eigenvalue.

11
11 Rev.F09 How to Determine if a Matrix A is Diagonalizable? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. If P = [ p 1 p 2 ], then AP = PD even if A is not diagonalizable.

12
12 Rev.F09 How to Determine if a Matrix A is Diagonalizable? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. So, our two distinct eigenvalues both have algebraic multiplicity 1 and geometric multiplicity 1. This ensures that p 1 and p 2 are not scalar multiples of each other; thus, p 1 and p 2 are linearly independent eigenvectors of A. Since A is 2 x 2 and there are two linearly independent eigenvectors from the solution of the eigenvalue problem, A is diagonalizable and P -1 AP = D. We can now construct P, P -1 and D. Let

13
13 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

14
14 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Example 2: Find the eigenvalues and eigenvectors for A. Step 1: Find the eigenvalues for A. Recall: The determinant of a triangular matrix is the product of the elements at the diagonal. Thus, the characteristic equation of A is λ 1 = 1 has algebraic multiplicity 1 and λ 2 = 3 has algebraic multiplicity 2..

15
15 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Step 2: Use Gaussian elimination with back-substitution to solve (λI - A) x = 0. For λ 1 = 1, the augmented matrix for the system is Column 3 is not a leading column and x 3 = t is a free variable. The geometric multiplicity of λ 1 = 1 is one, since there is only one free variable. x 2 = 0 and x 1 = 2x 2 = 0.

16
16 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. The eigenvector corresponding to λ 1 = 1 is The dimension of the eigenspace is 1 because the eigenvalue has only one linearly independent eigenvector. Thus, the geometric multiplicity is 1 and the algebraic multiplicity is 1 for λ 1 = 1.

17
17 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. The augmented matrix for the system with λ 2 = 3 is Column 1 is not a leading column and x 1 = t is a free variable. Since there is only one free variable, the geometric multiplicity of λ 2 is one.

18
18 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. x 2 = x 3 = 0 and the eigenvector corresponding to λ 2 = 3 is The dimension of the eigenspace is 1 because the eigenvalue has only one linearly independent eigenvector. Thus, the geometric multiplicity is 1 while the algebraic multiplicity is 2 for λ 2 = 3. This means there will not be enough linearly independent eigenvectors for A to be diagonalizable. Thus, A is not diagonalizable whenever the geometric multiplicity is less than the algebraic multiplicity for any eigenvalue.

19
19 Rev.F09 How to Determine if a Matrix A is Diagonalizable? (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

20
20 Rev.F09 A is Diagonalizable iff A is Similar to a Diagonal Matrix http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. For A, an n x n matrix, with characteristic polynomial roots for eigenvalues λ i of A with corresponding eigenvectors p i. P is invertible iff the eigenvectors that form its columns are linearly independent iff

21
21 Rev.F09 A is Diagonalizable iff A is Similar to a Diagonal Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. This gives us n linearly independent eigenvectors for P, so P -1 exists. Therefore, A is diagonalizable since The square matrices S and T are similar iff there exists a nonsingular P such that S = P -1 TP or PSP -1 = T. Since A is similar to a diagonal matrix, A is diagonalizable.

22
22 Rev.F09 Another Example http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Example 4: Solve the eigenvalue problem Ax = λx and find the eigenspace, algebraic multiplicity, and geometric multiplicity for each eigenvalue. Step 1: Write down the characteristic equation of A and solve for its eigenvalues.

23
23 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Since the factor (λ - 2) is first power, λ 1 = 2 is not a repeated root. λ 1 = 2 has an algebraic multiplicity of 1. On the other hand, the factor (λ +1) is squared, λ 2 = -1 is a repeated root, and it has an algebraic multiplicity of 2.

24
24 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Step 2: Use Gaussian elimination with back-substitution to solve (λI - A) x = 0 for λ 1 and λ 2. For λ 1 = 2, the augmented matrix for the system is In this case, x 3 = r, x 2 = 0, and x 1 = -1/2(0) + r = 0 + r = r.

25
25 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Thus, the eigenvector corresponding to λ 1 = 2 is

26
26 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. For λ 2 = -1, the augmented matrix for the system is x 3 = t, x 2 = s, and x 1 = -s + 2t. Thus, the solution has two linearly independent eigenvectors for λ 2 = -1 with

27
27 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

28
28 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Since the geometric multiplicity is equal to the algebraic multiplicity for each distinct eigenvalue, we found three linearly independent eigenvectors. The matrix A is diagonalizable since P = [p 1 p 2 p 3 ] is nonsingular.

29
29 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. We can find P -1 as follows:

30
30 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Note that A and D are similar matrices.

31
31 Rev.F09 Another Example (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Also, D = P -1 AP = So, A and D are similar with D = P -1 AP and A = PD P -1.

32
32 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. If P is an orthogonal matrix, its inverse is its transpose, P -1 = P T. Since

33
33 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. A is a symmetric matrix if A = A T. Let A be diagonalizable so that A = PDP -1. But A = A T and This shows that for a symmetric matrix A to be diagonalizable, P must be orthogonal. If P -1 ≠ P T, then A ≠A T. The eigenvectors of A are mutually orthogonal but not orthonormal. This means that the eigenvectors must be scaled to unit vectors so that P is orthogonal and composed of orthonormal columns.

34
34 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Example 5: Determine if the symmetric matrix A is diagonalizable; if it is, then find the orthogonal matrix P that orthogonally diagonalizes the symmetric matrix A. Since we have three distinct eigenvalues, we will see that we are guaranteed to have three linearly independent eigenvectors.

35
35 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Since λ 1 = 4, λ 2 = -2, and λ 3 = 6, are distinct eigenvalues, each of the eigenvalues has algebraic multiplicity 1. An eigenvalue must have geometric multiplicity of at least one. Otherwise, we will have the trivial solution. Thus, we have three linearly independent eigenvectors. We will use Gaussian elimination with back-substitution as follows:

36
36 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

37
37 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

38
38 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

39
39 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. As we can see the eigenvectors of A are distinct, so {p 1, p 2, p 3 } is linearly independent, P -1 exists for P =[p 1 p 2 p 3 ] and Thus A is diagonalizable. Since A = A T (A is a symmetric matrix) and P is orthogonal with approximate scaling of p 1, p 2, p 3, P -1 = P T.

40
40 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. As we can see the eigenvectors of A are distinct, so {p 1, p 2, p 3 } is linearly independent, P -1 exists for P =[p 1 p 2 p 3 ] and Thus A is diagonalizable. Since A = A T (A is a symmetric matrix) and P is orthogonal with approximate scaling of p 1, p 2, p 3, P -1 = P T.

41
41 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Note that A and D are similar matrices. PD P -1 =

42
42 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. Also, D = P -1 AP = P T AP So, A and D are similar with D = P T AP and A = PDP T.

43
43 Rev.F09 The Orthogonal Diagonalization of a Symmetric Matrix (Cont.) http://faculty.valenciacc.edu/ashaw/ Click link to download other modules. A T = (PD P -1 ) T = (PD P T ) T = (P T ) T D T P T = P D T P T = A. This shows that if A is a symmetric matrix, P must be orthogonal with P -1 = P T.

44
44 Rev.F09 How to Determine the Power and the Eigenvalues of a Matrix, A k ? http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

45
45 Rev.F09 What have we learned? We have learned to: 1. Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors of an n x n matrix. Find the algebraic multiplicity and the geometric multiplicity of an eigenvalue. 2. Find a basis for each eigenspace of an eigenvalue. 3. Determine whether a matrix A is diagonalizable. 4. Find a matrix P, P -1, and D that diagonalize A if A is diagonalizable. 5. Find an orthogonal matrix P with P -1 = P T and D that diagonalize A if A is symmetric and diagonalizable. 6. Determine the power and the eigenvalues of a matrix, A k. http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

46
46 Rev.F09 Credit Some of these slides have been adapted/modified in part/whole from the following textbook: Anton, Howard: Elementary Linear Algebra with Applications, 9th Edition http://faculty.valenciacc.edu/ashaw/ Click link to download other modules.

Similar presentations

© 2020 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google