Video details loadedContinue
HomeMIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018Lecture 6: Singular Value Decomposition (SVD)
MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018
Video 8 of 10
Lecture 6: Singular Value Decomposition (SVD)
53:34
Up Next
Lecture 7: Eckart-Young: The Closest Rank k Matrix to A
Description
Singular Value Decomposition (SVD) is the primary topic of this lecture. Professor Strang explains and illustrates how the SVD separates a matrix into rank one pieces, and that those pieces come in order of importance.
SummaryColumns of V are orthonormal eigenvectors of A_T_A.
Av = \(\sigma\)u gives orthonormal eigenvectors u of _AA_T.
\(\sigma^2 =\) eigenvalue of A_T_A = eigenvalue of _AA_T \( \neq\) 0
A = (rotation)(stretching)(rotation) \(U\Sigma\)_V_T for every A
Related section in textbook: I.8
Instructor: Prof. Gilbert Strang