6.1 Eigenvalues and Diagonalization. Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

5.2 Rank of a Matrix. Set-up Recall block multiplication:
Ch 7.7: Fundamental Matrices
Elementary Linear Algebra Anton & Rorres, 9th Edition
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
Chapter 6 Eigenvalues and Eigenvectors
1.5 Elementary Matrices and a Method for Finding
1.7 Diagonal, Triangular, and Symmetric Matrices.
Section 5.1 Eigenvectors and Eigenvalues. Eigenvectors and Eigenvalues Useful throughout pure and applied mathematics. Used to study difference equations.
2.3 Matrix Inverses. Numerical equivalent How would we solve for x in: ax = b ? –a -1 a x = a -1 b –x=a -1 b since a -1 a = 1 and 1x = x We use the same.
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
化工應用數學 授課教師: 郭修伯 Lecture 9 Matrices
Matrices CS485/685 Computer Vision Dr. George Bebis.
5.1 Orthogonality.
1.7 Diagonal, Triangular, and Symmetric Matrices 1.
Linear Algebra With Applications by Otto Bretscher. Page The Determinant of any diagonal nxn matrix is the product of its diagonal entries. True.
Compiled By Raj G. Tiwari
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 MAC 2103 Module 12 Eigenvalues and Eigenvectors.
Chap. 2 Matrices 2.1 Operations with Matrices
Day 1 Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Chapter Content Real Vector Spaces Subspaces Linear Independence
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Domain Range definition: T is a linear transformation, EIGENVECTOR EIGENVALUE.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
5 5.2 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors THE CHARACTERISTIC EQUATION.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Linear algebra: matrix Eigen-value Problems Eng. Hassan S. Migdadi Part 1.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 02 Chapter 2: Determinants.
Chapter 3 Determinants Linear Algebra. Ch03_2 3.1 Introduction to Determinants Definition The determinant of a 2  2 matrix A is denoted |A| and is given.
Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.
Diagonalization and Similar Matrices In Section 4.2 we showed how to compute eigenpairs (,p) of a matrix A by determining the roots of the characteristic.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Chapter 2 … part1 Matrices Linear Algebra S 1. Ch2_2 2.1 Addition, Scalar Multiplication, and Multiplication of Matrices Definition A matrix is a rectangular.
7.1 Eigenvalues and Eigenvectors
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
5.1 Eigenvalues and Eigenvectors
Matrices and Determinants
Linear Algebra Chapter 2 Matrices.
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Section 2.1 Determinants by Cofactor Expansion. THE DETERMINANT Recall from algebra, that the function f (x) = x 2 is a function from the real numbers.
2 - 1 Chapter 2A Matrices 2A.1 Definition, and Operations of Matrices: 1 Sums and Scalar Products; 2 Matrix Multiplication 2A.2 Properties of Matrix Operations;
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
Review of Eigenvectors and Eigenvalues from CliffsNotes Online mining-the-Eigenvectors-of-a- Matrix.topicArticleId-20807,articleId-
Characteristic Polynomial Hung-yi Lee. Outline Last lecture: Given eigenvalues, we know how to find eigenvectors or eigenspaces Check eigenvalues This.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Chapter 5 Eigenvalues and Eigenvectors
Chapter 6 Eigenvalues and Eigenvectors
MAT 322: LINEAR ALGEBRA.
ISHIK UNIVERSITY FACULTY OF EDUCATION Mathematics Education Department
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
CS485/685 Computer Vision Dr. George Bebis
Eigenvalues and Eigenvectors
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 29.
Chapter 5 Eigenvalues and Eigenvectors
Linear Algebra Lecture 35.
Eigenvalues and Eigenvectors
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Eigenvalues and Eigenvectors
Presentation transcript:

6.1 Eigenvalues and Diagonalization

Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue of A, the set E = E (A) = {X | X in  n, AX = X} is a vector space called the eigenspace associated w/ (i.e. E is all eigenvectors corresponding to & 0 vector) is eigenvalue if E has at least one non-zero vector. Can also write AX = X as ( I n - A)X = 0

Example Show that = -3 is an eigenvalue of A, and find the eigenspace E -3. Write out ( I n - A)X = 0 and solve. Get: So it is an eigenvalue since there is a non-zero solution. Eigenspace is:

Discussion Now we have ( I n - A)X = 0, and is an eigenvalue iff there exists a nonzero solution X. Recall that a matrix U is invertible iff UX = 0 implies X = 0. So, since we are looking for a nonzero solution above, ( I n -A) cannot be invertible for to be an eigenvalue. So det ( I n -A) =0.

Definition The characteristic polynomial of the n x n matrix A is: c A (x) = det(xI - A)

Theorem 1 A (n x n). The eigenvalues of A are the real roots of the characteristic polynomial of A --the real numbers satisfying: c A ( ) = det( I n - A) = 0 The eigenspace E = {X | ( I - A)X = 0} consists of all solutions to a system of n linear equations in n variables. The eigenvectors corresponding to are the nonzero vectors in the eigenspace.

Summary So there are two issues: finding eigenvalues, and finding eigenspaces (and eigenvectors). Finding the eigenvalues can be difficult - won’t do much here. Spend more time dealing with eigenspaces.

Example Find the characteristic polynomial, eigenvalues, and eigenspaces of A: Set up c A (x) = det (xI - A) Eigenvalues will be the roots of the polynomial as those will give us where det is 0. Then use those to find eigenspace: X such that ( I-A)X=0

Example If A is a triangular matrix, show that the eigenvalues of A are the entries on the main diagonal. Proof: c A (x) = det (xI - A) = det ( a triangular matrix) = product of entries on main diagonal of (xI - A). The matrix showing entries on main diagonal is: det = (x-a 11 )(x-a 22 )…(x-a nn ) So eigenvalues are{a 11,a 22,…,a nn }

Example Show that A and A T have the same characteristic polynomial and thus the same eigenvalues. Proof: From chapter 3, we know that a matrix and its transpose will have the same determinant.

Theorem 2 If A is a real symmetric matrix, each root of the characteristic polynomial c A (x) is real. (to be proven later) Show this is true for a (2 x 2): Recall that we can determine the nature of the roots from the discriminant: (b 2 -4ac) = (a+c) 2 -4(ac+b 2 ) = a 2 +c 2 +2ac-4ac+4b 2 =a 2 -2ac+c 2 +4b 2 = (a-c) 2 + 4b 2 which is always pos so real roots.

Similar Matrices A, B (n x n) are similar (we say A~B) if B = P -1 AP holds for some invertible matrix. P is not unique.

Example Find P -1 AP in the following case, then compute A n. We are able to find a similar matrix B. Then P -1 AP=B. So A = PBP -1 So A 2 =(PBP -1 )(PBP -1 )=PB 2 P -1 Generally A n =PB n P -1 Life is made easy is B is diagonal since we just raise entries to n.

Interesting Fact Similar Matrices will have the same determinant. Proof: P -1 AP = D det(D) = det (P -1 AP) = (detP -1 )(detA)(detP) = (1/detP)(detA)(det P) = det A.

Example Show that A and B are not similar. Just need to show that they do not have the same determinant.

Trace The trace of a square matrix A (tr A) is the sum of the entries on the main diagonal of A.

Theorem 3 A,B (n x n), k is a scalar: 1. tr(A + B) = tr A + tr B and tr(kA) = k tr A 2. tr (AB) = tr (BA) Proof: 1. (homework) 2.

Theorem 4 If A~B, they have the same determinant, the same rank, the same trace, the same characteristic polynomial, and the same eigenvalues. (similarity invariants) Proof: Already shown that they have the same determinant. Rank: Have B = P -1 AP rank (B) = rank (P -1 AP) = rank(AP)=rankA since P is invertible (and using cor 4 of thm 4 in 5.5) tr B = tr (P -1 AP) = tr[(AP)P -1 ] = tr (A) (uses thm 3)

Theorem 4 - cont Characteristic polynomial c B (x) = det (xI - B) = det(xI - P -1 AP)=det(P -1 xIP - P -1 AP) (since xI = P -1 xIP -- since xI is diagonal) = det [P -1 (xI - A)P]=(1/detP)(det(xI-A))(det P) = det(xI-A) = c A (x) Eigenvalues: all matrices with the same characteristic poly will have the same eigenvalues since the eigenvalues are the roots of the characteristic polynomial.

Fact The invariants do not imply similarity. Ex. Have same det,tr,rank,characteristic poly, eigenvalues, but are not similar since P -1 IP = I ≠ A

Theorem 5 A,B,C (n x n). Then: 1. A~A for all A. 2. If A ~ B, then B~A 3. If A ~ B and B ~ C, then A~C. Proof of 2 (others follow): A~B  B = P -1 AP Let Q = P -1, then B = QAQ -1, so A= Q -1 BQ Which means that B ~ A.

Use of thm 5 Proving similarity is not always easy. But if we can find a simple (often diagonal) matrix to which both A and B are both similar, then: A~D and B~D means D~B by (2) and A~B then by (3)