ConceptMathematics
Singular value decomposition
A factorization of a real matrix into a product of three matrices: an orthogonal matrix, a diagonal matrix of singular values, and the transpose of another orthogonal matrix.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Matrix multiplication8Eigenvalues and eigenvectors7Orthogonal matrices5Diagonal matrices3Eigenvalue3Diagonal matrix2Eigenvectors and eigenvalues2Linear algebra2
Opens up
Concepts that name this one as a prerequisite.
Lecturers
7Each in their own terms, from the easiest level.
Gilbert Strang
A foundational factorization of any matrix into an orthogonal matrix, a diagonal matrix of singular values, and another orthogonal matrix.Valerie Hower
A factorization of a real or complex matrix that generalizes the eigendecomposition of a square normal matrix to any matrix.Shree Nayar
A technique in linear algebra that factorizes any matrix into the product of three matrices: an orthonormal matrix U, a diagonal matrix sigma, and the transpose of an orthonormal matrix V.Steve Brunton
A matrix decomposition that represents a data matrix as the product of three matrices: a unitary matrix of left singular vectors, a diagonal matrix of singular values, and the transpose of a unitary matrix of right singular vectors.Peter Kempthorne, Jake Xia & Vasily Strela
A decomposition of an m by n matrix A into the product of an orthonormal matrix U, a diagonal matrix sigma, and the transpose of an orthonormal matrix V.Jeremy Bernstein
A factorization of a real or complex matrix that generalizes the eigendecomposition of a square normal matrix to any matrix.
Lectures that assume it
16The first 12 are shown.
- Left and Right Inverses; Pseudoinverse
- Applications of SVD, Controllability, and State Transfer in Electrical Engineering
- Computing Eigenvalues and Singular Values
- Four Ways to Solve Least Squares Problems
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: L1 Methods for Convex-Cardinality Problems
- Norms of Vectors and Matrices
- Rapidly Decreasing Singular Values
- Degrees of Controllability and Gramians
- Survey of Difficulties with Ax = b
- Derivatives of Inverse and Singular Values
- Representation Learning: Theory
Connections
35The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Matrix multiplication
- Eigenvalues and eigenvectors
- Eigenvalue
- Nuclear norm
- Condition number
- Low rank approximation
Show 2 moreShow fewer
Lectures27
- Tomasi-Kanade Factorization: Structure from Motion
- Linear Algebra: Getting Ready for Singular Value Decomposition
- Applications of Singular Value Decomposition in LDS and Electrical Engineering
- Singular Value Decomposition
- Singular Value Decomposition
- Singular Value Decomposition (SVD): Mathematical Overview
Show 21 moreShow fewer
- Singular Value Decomposition (SVD)
- Multiplying and Factoring Matrices
- Counting Parameters in SVD, LU, QR, Saddle Points
- Scaling Rules for Optimization
- Linear Algebra
- Left and Right Inverses; Pseudoinverse
- Applications of SVD, Controllability, and State Transfer in Electrical Engineering
- Computing Eigenvalues and Singular Values
- Four Ways to Solve Least Squares Problems
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: L1 Methods for Convex-Cardinality Problems
- Norms of Vectors and Matrices
- Rapidly Decreasing Singular Values
- Degrees of Controllability and Gramians
- Survey of Difficulties with Ax = b
- Derivatives of Inverse and Singular Values
- Representation Learning: Theory
- Stereo Vision (AA274A)
- Symbols and Grounding in Large Language Models
- Regularized Pricing and Risk Models
- Eckart-Young: The Closest Rank k Matrix to A