Math 3191 Applied Linear Algebra

Similar documents
Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Lecture 15, 16: Diagonalization

and let s calculate the image of some vectors under the transformation T.

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Recall : Eigenvalues and Eigenvectors

Jordan Canonical Form Homework Solutions

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.

Study Guide for Linear Algebra Exam 2

Linear Algebra II Lecture 13

Lecture 12: Diagonalization

Diagonalization of Matrix

Eigenvalues and Eigenvectors

Announcements Monday, November 06

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Linear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7

Definition (T -invariant subspace) Example. Example

Eigenvalues and Eigenvectors

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

Eigenvalues, Eigenvectors, and Diagonalization

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Dimension. Eigenvalue and eigenvector

Math 2331 Linear Algebra

MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

MAT1302F Mathematical Methods II Lecture 19

Eigenvalues and Eigenvectors

Math 205, Summer I, Week 4b:

MATH 221, Spring Homework 10 Solutions

Math Matrix Algebra

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Diagonalization. Hung-yi Lee

Eigenvalues and Eigenvectors

Chapter 5. Eigenvalues and Eigenvectors

AMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =

Eigenvalue and Eigenvector Homework

Lecture 3 Eigenvalues and Eigenvectors

1 Last time: least-squares problems

Jordan Normal Form and Singular Decomposition

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST

MAT 1302B Mathematical Methods II

Diagonalization. P. Danziger. u B = A 1. B u S.

City Suburbs. : population distribution after m years

3.3 Eigenvalues and Eigenvectors

Review Notes for Linear Algebra True or False Last Updated: January 25, 2010

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

MAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 12 Eigenvalues and Eigenvectors

5.3.5 The eigenvalues are 3, 2, 3 (i.e., the diagonal entries of D) with corresponding eigenvalues. Null(A 3I) = Null( ), 0 0

DM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini

235 Final exam review questions

Math 315: Linear Algebra Solutions to Assignment 7

Problems for M 10/26:

Lecture 11: Diagonalization

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

Summer Session Practice Final Exam

Definition: An n x n matrix, "A", is said to be diagonalizable if there exists a nonsingular matrix "X" and a diagonal matrix "D" such that X 1 A X

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

Calculating determinants for larger matrices

Name: Final Exam MATH 3320

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

ICS 6N Computational Linear Algebra Eigenvalues and Eigenvectors

Math Final December 2006 C. Robinson

Topic 1: Matrix diagonalization

Math 205, Summer I, Week 4b: Continued. Chapter 5, Section 8

Homework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9

Math 110 Linear Algebra Midterm 2 Review October 28, 2017

Econ Slides from Lecture 7

Math 1553 Worksheet 5.3, 5.5

2 Eigenvectors and Eigenvalues in abstract spaces.

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

MATH 1553 PRACTICE MIDTERM 3 (VERSION A)

MATH 1553-C MIDTERM EXAMINATION 3

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

Math 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:

4. Linear transformations as a vector space 17

Spring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280

Diagonalization of Matrices

The Jordan Normal Form and its Applications

Constant coefficients systems

Announcements Wednesday, November 01

Eigenvalues and Eigenvectors A =

PROBLEM SET. Problems on Eigenvalues and Diagonalization. Math 3351, Fall Oct. 20, 2010 ANSWERS

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

Chapter 3. Determinants and Eigenvalues

Generalized Eigenvectors and Jordan Form

Math 3191 Applied Linear Algebra

80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.

MATH 1553 SAMPLE FINAL EXAM, SPRING 2018

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

LINEAR ALGEBRA REVIEW

Math 2030, Matrix Theory and Linear Algebra I, Fall 2011 Final Exam, December 13, 2011 FIRST NAME: LAST NAME: STUDENT ID:

MATH 1553, C. JANKOWSKI MIDTERM 3

Lecture 11: Eigenvalues and Eigenvectors

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

Solutions to Final Exam

Transcription:

Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9

Section. Diagonalization The goal here is to develop a useful factorization A = P DP, when A is n n. We can use this to compute A k quickly for large k. The matrix D is a diagonal matrix (i.e. entries off the main diagonal are all zeros). D k is trivial to compute as the following example illustrates. Math 9Applied Linear Algebra p./9

Computing Powers of Diagonal Matrices EXAMPLE: Let D = where k is a positive integer?. Compute D and D. In general, what is D k, Solution: D = = D = D D = = and in general, D k = k k Math 9Applied Linear Algebra p./9

Powers of P DP EXAMPLE: Let A = where P =, D = Solution:. Find a formula for A k given that A = P DP and P = A = `P DP `P DP = P D `P P DP = P DDP = P D P. Math 9Applied Linear Algebra p./9

Powers of P DP, cont. Again, A = A A = `P D P `P DP = P D `P P DP = P D P In general, A k = P D k P = k k = k k k + k k k k + k. Math 9Applied Linear Algebra p./9

Diagonalizable Matrices A square matrix A is said to be diagonalizable if A is similar to a diagonal matrix, i.e. if A = P DP where P is invertible and D is a diagonal matrix. When is A diagonalizable? eigenvectors of A.) (The answer lies in examining the eigenvalues and In the previous example, note that the columns of P are eigenvectors of A: = and = Math 9Applied Linear Algebra p./9

All together = 8 Equivalently, = or = Math 9Applied Linear Algebra p./9

In general, h A and if h v v v n i = v v v n i h i v v v n {z } P h i v v v n is invertible, A equals λ λ..... {z λ n } D λ λ..... λ n h i v v v n {z } P Math 9Applied Linear Algebra p.8/9

THEOREM The Diagonalization Theorem An n n matrix A is diagonalizable if and only if A has n linearly independent eigenvectors. In fact, A = P DP, with D a diagonal matrix, if and only if the columns of P are n linearly independent eigenvectors of A. In this case, the diagonal entries of D are eigenvalues of A that correspond, respectively, to the eigenvectors in P. Math 9Applied Linear Algebra p.9/9

Diagonalizing a Matrix EXAMPLE: Diagonalize the following matrix, if possible. A = Step. Find the eigenvalues of A. λ det (A λi) = det λ λ = ( λ) ( λ) =. Eigenvalues of A: λ = and λ =. Math 9Applied Linear Algebra p./9

Diagonalizing a Matrix, cont. Step. Find three linearly independent eigenvectors of A. By solving (A λi) x =, for each value of λ, we obtain the following: Basis for λ = : v = Basis for λ = : v = v = Step : Construct P from the vectors in step. P = Math 9Applied Linear Algebra p./9

Diagonalizing a Matrix, cont. Step : Construct D from the corresponding eigenvalues. D = Step : Check your work by verifying that AP = P D AP = = P D = = Math 9Applied Linear Algebra p./9

Not Every Matrix is Diagonalizable! EXAMPLE: Diagonalize the following matrix, if possible. A =. Since this matrix is triangular, the eigenvalues are λ = and λ =. By solving (A λi) x = for each eigenvalue, we would find the following: Basis for λ = : v = Basis for λ = : v = Every eigenvector of A is a multiple of v or v which means there are not three linearly independent eigenvectors of A and by Theorem, A is not diagonalizable. Math 9Applied Linear Algebra p./9

Theorem EXAMPLE: Why is A = diagonalizable? Solution: Since A has three eigenvalues (λ =, λ =, λ = ) and since eigenvectors corresponding to distinct eigenvalues are linearly independent, A has three linearly independent eigenvectors and it is therefore diagonalizable. THEOREM An n n matrix with n distinct eigenvalues is diagonalizable. Math 9Applied Linear Algebra p./9

Motivation for Theorem EXAMPLE: Diagonalize the following matrix, if possible. A = Solution: Eigenvalues: and (each with multiplicity ). Solving (A λi) x = yields the following basis vectors for the eigenspaces of the two eigenvalues: λ = : v =, v = λ = : v =, v = Math 9Applied Linear Algebra p./9

{v, v, v, v } is linearly independent P = [v v v v ] is invertible. A = P DP, where P = and D =. Math 9Applied Linear Algebra p./9

THEOREM Let A be an n n matrix whose distinct eigenvalues are λ,..., λ p. a. For k p, the dimension of the eigenspace for λ k is less than or equal to the multiplicity of the eigenvalue λ k. b. The matrix A is diagonalizable if and only if the sum of the dimensions of the distinct eigenspaces equals n, and this happens if and only if the dimension of the eigenspace for each λ k equals the multiplicity of λ k. c. If A is diagonalizable and β k is a basis for the eigenspace corresponding to λ k for each k, then the total collection of vectors in the sets β,..., β p forms an eigenvector basis for R n. Math 9Applied Linear Algebra p./9

Section.: Eigenvectors and Linear Transformations Recall: A Linear Transformations T : V W can be represented by a matrix. How? Choose bases B and C for V and W respectively. Represent vectors using their coordinates relative to the bases. Construct the matrix A representing the transformation using the method we learned in Section.9. Then w = T (v) [w] C = A[v] B. Math 9Applied Linear Algebra p.8/9

Example Suppose V = IP and W = IP. Suppose that T : V W is defined by T (v) = v = dv dt. Let B = {b, b, b } = {, t, t } Let C = {c, c } = {, t}. T (b ) = d dt =, T (b ) = d dt t =, T (b ) = t. [T (b )] C = (, ), [T (b )] C = (, ), [T (b ] C = (, ). h i A = [T (b )] C [T (b )] C [T (b )] C =. Check: If v = a + a t + a t, then T (v) = a + a t. [v] B = (a, a, a ). [T (v)] C = (a, a ). And, A[v] B = (a, a ). Math 9Applied Linear Algebra p.9/9