Diagonalization Revisted Isabel K. Darcy Mathematics Department Applied Math and Computational Sciences University of Iowa Fig from knotplot.com.

Slides:



Advertisements
Similar presentations
4.1 Introduction to Matrices
Advertisements

Chapter 6 Eigenvalues and Eigenvectors
MAT 2401 Linear Algebra Exam 2 Review
Solving homogeneous equations: Ax = 0 Putting answer in parametric vector form Isabel K. Darcy Mathematics Department Applied Math and Computational Sciences.
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.
Section 5.1 Eigenvectors and Eigenvalues. Eigenvectors and Eigenvalues Useful throughout pure and applied mathematics. Used to study difference equations.
Lecture 17 Introduction to Eigenvalue Problems
Eigenvalues and Eigenvectors
A quick example calculating the column space and the nullspace of a matrix. Isabel K. Darcy Mathematics Department Applied Math and Computational Sciences.
Determinants Bases, linear Indep., etc Gram-Schmidt Eigenvalue and Eigenvectors Misc
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Chapter 6 Eigenvalues.
5.II. Similarity 5.II.1. Definition and Examples
Lecture 18 Eigenvalue Problems II Shang-Hua Teng.
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Matrices CS485/685 Computer Vision Dr. George Bebis.
4.5, x 2 and 3 x 3 Matrices, Determinants, and Inverses Date: _____________.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 MAC 2103 Module 12 Eigenvalues and Eigenvectors.
PHY 301: MATH AND NUM TECH Chapter 5: Linear Algebra Applications I.Homogeneous Linear Equations II.Non-homogeneous equation III.Eigen value problem.
Day 1 Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
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.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
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.
LAHW#13 Due December 20, Eigenvalues and Eigenvectors 5. –The matrix represents a rotations of 90° counterclockwise. Obviously, Ax is never.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Positive Semidefinite matrix A is a p ositive semidefinite matrix (also called n onnegative definite matrix)
Ch11: Normal Modes 1. Review diagonalization and eigenvalue problem 2. Normal modes of Coupled oscillators (3 springs, 2 masses) 3. Case of Weakly coupled.
7.1 Eigenvalues and Eigenvectors
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
5.1 Eigenvalues and Eigenvectors
Instructor: Mircea Nicolescu Lecture 8 CS 485 / 685 Computer Vision.
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Matrices CHAPTER 8.9 ~ Ch _2 Contents  8.9 Power of Matrices 8.9 Power of Matrices  8.10 Orthogonal Matrices 8.10 Orthogonal Matrices 
Reduced echelon form Matrix equations Null space Range Determinant Invertibility Similar matrices Eigenvalues Eigenvectors Diagonabilty Power.
Characteristic Polynomial Hung-yi Lee. Outline Last lecture: Given eigenvalues, we know how to find eigenvectors or eigenspaces Check eigenvalues This.
Chapter 5 Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
ISHIK UNIVERSITY FACULTY OF EDUCATION Mathematics Education Department
CS479/679 Pattern Recognition Dr. George Bebis
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Positive Semidefinite matrix
Euclidean Inner Product on Rn
Eigenvalues and Eigenvectors
Some useful linear algebra
CS485/685 Computer Vision Dr. George Bebis
Diagonalization Hung-yi Lee.
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
EIGENVECTORS AND EIGENVALUES
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 29.
Diagonalization of Linear Operator
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE HADAPSAR, PUNE
Linear Algebra Lecture 30.
Eigenvalues and Eigenvectors
Linear Algebra Lecture 35.
Eigenvalues and Eigenvectors
Subject :- Applied Mathematics
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Presentation transcript:

Diagonalization Revisted Isabel K. Darcy Mathematics Department Applied Math and Computational Sciences University of Iowa Fig from knotplot.com

A is diagonalizable if there exists an invertible matrix P such that P −1 AP = D where D is a diagonal matrix. Diagonalization has many important applications It allows one to convert a more complicated problem into a simpler problem. Example: Calculating A k when A is diagonalizable.

3 3

I.e., we are assuming A is diagonalizable since implies More diagonalization background:

Check answer:

To diagonalize a matrix A: Step 1: Find eigenvalues: Solve the equation: det (A –  = 0 for  Step 2: For each eigenvalue, find its corresponding eigenvectors by solving the homogeneous system of equations: (A –  x = 0 for x. Case 3a.) IF the geometric multiplicity is LESS then the algebraic multiplicity for at least ONE eigenvalue of A, then A is NOT diagonalizable. (Cannot find square matrix P). Matrix defective = NOT diagonalizable.

Case 3b.) A is diagonalizable if and only if geometric multiplicity = algebraic multiplicity for ALL the eigenvalues of A. Use the eigenvalues of A to construct the diagonal matrix D Use the basis of the corresponding eigenspaces for the corresponding columns of P. (NOTE: P is a SQUARE matrix). NOTE: ORDER MATTERS.

Step 1: Find eigenvalues: Solve the equation: det (A – I) = 0 for  For more complicated example, see video 4: Eigenvalue/Eigenvector Example & video 5: Diagonalization

characteristic equation: = -3 : algebraic multiplicity = geometric multiplicity = dimension of eigenspace = = 5 : algebraic multiplicity geometric multiplicity dimension of eigenspace 1 ≤ geometric multiplicity ≤ algebraic multiplicity

characteristic equation: = -3 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 = 5 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 1 ≤ geometric multiplicity ≤ algebraic multiplicity Matrix is not defective.

characteristic equation: = -3 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 = 5 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 1 ≤ geometric multiplicity ≤ algebraic multiplicity Matrix is not defective. Thus A is diagonalizable

characteristic equation: = -3 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 = 5 : algebraic multiplicity = 1 geometric multiplicity = 1 dimension of eigenspace = 1 1 ≤ geometric multiplicity ≤ algebraic multiplicity Matrix is not defective. Thus A is diagonalizable

Nul(A + 3  = eigenspace corresponding to eigenvalue = -3 of A Find eigenvectors to create P

Basis for eigenspace corresponding to = -3:

Nul(A - 5  = eigenspace corresponding to eigenvalue = 5 of A Find eigenvectors to create P Basis for eigenspace corresponding to = 5:

Basis for eigenspace corresponding to = -3: Basis for eigenspace corresponding to = 5:

Basis for eigenspace corresponding to = -3: Basis for eigenspace corresponding to = 5:

Note we want to be invertible. Note P is invertible if and only if the columns of P are linearly independent. We get this for FREE!!!!!

Note: You can easily check your answer.

Diagonalize Note there are many correct answers.

Diagonalize Note there are many correct answers. ORDER MATTERS!!!