Opening Complex Matrices and the Fast Fourier Transform
Complex Matrices and the Fast Fourier Transform
- Length
- 48 min
- Level
- Undergraduate
- Recorded
- MIT2009
Chapter 1 of 7: Before the lecture
MIT 18.06 Linear Algebra, session 25, covers complex matrices and the Fast Fourier Transform at the undergraduate level. Strang uses the Hermitian inner product to show why the Fourier matrix has orthogonal columns, then factors the matrix into sparse pieces.

Your comment is kept while you sign up.Sign in
Derives the Fast Fourier Transform algorithm by factoring the Fourier matrix into sparse pieces.
MIT 18.06 Linear Algebra, session 25, covers complex matrices and the Fast Fourier Transform at the undergraduate level. Strang uses the Hermitian inner product to show why the Fourier matrix has orthogonal columns, then factors the matrix into sparse pieces.
This lecture
Lecture 25 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.