TL;DR
Any matrix A can be decomposed as \( A = U\Sigma V^T \) where U and V are orthogonal and \( \Sigma \) is diagonal with non-negative singular values. It generalizes eigendecomposition to rectangular matrices.
Singular Value Decomposition
Any matrix A can be decomposed as \( A = U\Sigma V^T \) where U and V are orthogonal and \( \Sigma \) is diagonal with non-negative singular values. It generalizes eigendecomposition to rectangular matrices.
Why it matters for interviews
SVD is used for low-rank approximation (noise filtering), pseudoinverse computation (regression), and latent factor models. Understanding SVD demonstrates strong linear algebra skills valued in quant interviews.
Definition and Mathematical Foundation
Any matrix A can be decomposed as \( A = U\Sigma V^T \) where U and V are orthogonal and \( \Sigma \) is diagonal with non-negative singular values. It generalizes eigendecomposition to rectangular matrices.
Application in Quantitative Finance
SVD is used for low-rank approximation (noise filtering), pseudoinverse computation (regression), and latent factor models. Understanding SVD demonstrates strong linear algebra skills valued in quant interviews.
Related Terms
Ready to practice for the Quant Trading Interview?
Adaptive practice powered by Item Response Theory targets your weak areas. Start with 3 free sessions.
Start free practice →