lecture18

lecture18 - Lecture 18 Eigenvalue Problems II Shang-Hua...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 18 Eigenvalue Problems II Shang-Hua Teng
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Diagonalizing A Matrix Suppose the n by n matrix A has n linearly independent eigenvectors x 1 , x 2 ,…, x n . Eigenvector matrix S: x 1 , x 2 ,…, x n are columns of S. Then = Λ = - n AS S λ 1 1 Λ is the eigenvalue matrix
Background image of page 2
Matrix Power A k S -1 AS = Λ implies A = S Λ S -1 implies A 2 = S Λ S -1 S Λ S -1 = S Λ 2 S -1 implies A k = S Λ k S -1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Random walks How long does it take to get completely lost? 0 0 0 0 0 1
Background image of page 4
Random walks Transition Matrix 1 2 3 4 5 6 = 0 0 0 0 0 1 0 2 1 4 1 0 0 2 1 3 1 0 4 1 0 0 0 3 1 2 1 0 2 1 3 1 0 0 0 4 1 0 3 1 0 0 0 4 1 2 1 0 2 1 3 1 0 0 0 3 1 0 100 P
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
If A is diagonalizable as A = S Λ S -1 then for any vector
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/08/2010 for the course CS 232 taught by Professor Bera during the Spring '09 term at BU.

Page1 / 18

lecture18 - Lecture 18 Eigenvalue Problems II Shang-Hua...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online