Opening Diagonalization and Powers of A
Diagonalization and Powers of A
- Length
- 52 min
- Level
- Undergraduate
- Recorded
- MIT2009
Chapter 1 of 6: Diagonalization of a matrix
Strang turns the Fibonacci recurrence into and reads its growth rate off the eigenvalues of .
Diagonalization factors a square matrix as , with the eigenvectors in and the eigenvalues in . In this session of MIT 18.06, Strang derives and shows that tends to zero exactly when every eigenvalue has absolute value below one. He proves that distinct eigenvalues guarantee independent eigenvectors, and shows how repeated eigenvalues can fail. Difference equations are then solved by expanding in the eigenvector basis. The Fibonacci recurrence becomes a two-by-two companion system whose eigenvalues give the growth rate. The material assumes eigenvalue computation, determinants and inverses.
Diagonalization factors a square matrix as , with the eigenvectors in and the eigenvalues in . In this session of MIT 18.06, Strang derives and shows that tends to zero exactly when every eigenvalue has absolute value below one. He proves that distinct eigenvalues guarantee independent eigenvectors, and shows how repeated eigenvalues can fail. Difference equations are then solved by expanding in the eigenvector basis. The Fibonacci recurrence becomes a two-by-two companion system whose eigenvalues give the growth rate. The material assumes eigenvalue computation, determinants and inverses.

This lecture
Lecture 21 of 31 of Linear Algebra.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in