Back to AI Math Mind Map
中文·English
📐 AI MathID: svd-evd

SVD & Eigen-Decomposition

SVD 与特征值分解
🎯Core Definition
For any ARm×nA \in \mathbb{R}^{m \times n}, the singular value decomposition is A=UΣVTA = U\Sigma V^T, where URm×mU \in \mathbb{R}^{m \times m} and VRn×nV \in \mathbb{R}^{n \times n} are orthogonal and Σ\Sigma is diagonal with singular values σ1σ2σmin(m,n)0\sigma_1 \ge \sigma_2 \ge \cdots \ge \sigma_{\min(m,n)} \ge 0 (zeros allowed). Geometrically the map is "rotate + scale + rotate": VTV^T rotates the input onto the coordinate axes, Σ\Sigma scales each axis by σi\sigma_i, and UU rotates into the output space — the unit sphere becomes a hyper-ellipse whose semi-axis lengths are the σi\sigma_i, the longest axis u1u_1 being the most stretched direction. The singular values satisfy σi2=λi(ATA)\sigma_i^2 = \lambda_i(A^TA); eigenvectors of ATAA^TA form VV, eigenvectors of AATAA^T form UU. EVD: a symmetric matrix decomposes as A=QΛQTA = Q\Lambda Q^T (QQ orthogonal) with real eigenvalues and singular values =λi= |\lambda_i|. The condition number κ=σ1/σn\kappa = \sigma_1 / \sigma_n measures numerical stability: larger κ\kappa means more ill-conditioned, and relative errors in the solution can be amplified by up to κ\kappa.
💡Use Cases
detecting ill-conditioned problems (equation solving, gradient-descent convergence); numerical implementation of PCA and dimensionality reduction; low-rank approximation and compression; the pseudoinverse A+=VΣ+UTA^+ = V\Sigma^+U^T; image denoising, whitening, and matrix factorization in recommenders.
Key Problems Solved
EVD only exists for diagonalizable square matrices, and non-symmetric matrices can have complex, numerically unstable eigenvalues; SVD exists for every matrix (rectangular or rank-deficient) with unique singular values, making it the most stable decomposition in numerical linear algebra. The condition number κ=σ1/σn\kappa = \sigma_1/\sigma_n directly quantifies how much input noise is amplified — the yardstick for whether a linear system is trustworthy and how fast first-order optimization will converge.
🎯5 High-Frequency Exam Points
1
Compute the SVD of a 2×2 matrix by hand: eigenvalues/eigenvectors of ATAA^TA give σi\sigma_i and VV, then ui=Avi/σiu_i = Av_i/\sigma_i gives UU; verify A=UΣVTA = U\Sigma V^T.
2
Derive σi2=λi(ATA)\sigma_i^2 = \lambda_i(A^TA); why does SVD exist for every matrix while EVD needs a diagonalizable square matrix?
3
Geometry: why does the unit circle map to an ellipse with semi-axes σi\sigma_i? How do VTV^T, Σ\Sigma, UU correspond to rotate, scale, rotate?
4
How does the condition number κ=σ1/σn\kappa = \sigma_1/\sigma_n affect numerical stability? How much can ill-conditioned systems (e.g. Hilbert matrices) amplify errors?
5
How do SVD and EVD relate for symmetric matrices? How can SVD directly read off bases of the four fundamental subspaces (first rr columns of VV = row space, etc.)?
📖 In-depth Guide:📄 linear-algebra-for-ai
Updated 2026-08-12
🎯
Test Your Knowledge: Practice Questions for "SVD & Eigen-Decomposition"
Single choice pitfall questions with instant feedback and mistake tracking.
🚀 Start Card Practice
Previous CardVector Spaces & Fundamental SubspacesNext CardProjection & Least Squares

🔗 More AI Math Knowledge Cards

Adam/AdamW MathBayesian InferenceBias-Variance DecompositionBootstrap