Opening Markov Matrices; Fourier Series
Markov Matrices; Fourier Series
- Length
- 51 min
- Level
- Undergraduate
- Recorded
- MIT2019
Chapter 1 of 5: Properties of Markov matrices
Markov matrices, with non-negative entries and columns summing to one, always have one as an eigenvalue. Strang proves this using the fact that a matrix and its transpose share eigenvalues. Powers of the matrix approach a steady state set by that eigenvector, shown with a two-state model of people moving between California and Massachusetts. The second half moves from finite-dimensional vectors to function space, where Strang defines the inner product as an integral and derives Fourier coefficients as projections onto orthogonal sines and cosines. Session 23 of MIT 18.06 assumes eigenvalues, determinants, dot products and basic integral calculus.

Your comment is kept while you sign up.Sign in
Strang proves every Markov matrix has eigenvalue one, then treats functions as vectors to derive Fourier coefficients.
Markov matrices, with non-negative entries and columns summing to one, always have one as an eigenvalue. Strang proves this using the fact that a matrix and its transpose share eigenvalues. Powers of the matrix approach a steady state set by that eigenvector, shown with a two-state model of people moving between California and Massachusetts. The second half moves from finite-dimensional vectors to function space, where Strang defines the inner product as an integral and derives Fourier coefficients as projections onto orthogonal sines and cosines. Session 23 of MIT 18.06 assumes eigenvalues, determinants, dot products and basic integral calculus.
This lecture
Lecture 23 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.