Singular Value Decomposition — Definition, Formula & Examples
Singular Value Decomposition (SVD) is a way to factor any matrix into three special matrices: an orthogonal matrix , a diagonal matrix of non-negative values called singular values, and the transpose of another orthogonal matrix . It works for any matrix, even non-square ones.
For any real matrix , there exist orthogonal matrices and , and a diagonal matrix with non-negative entries on its main diagonal, such that . The diagonal entries are the singular values of , equal to the square roots of the eigenvalues of .
Key Formula
Where:
- = The original m × n matrix being decomposed
- = An m × m orthogonal matrix whose columns are left singular vectors
- = An m × n diagonal matrix of singular values σ₁ ≥ σ₂ ≥ … ≥ 0
- = The transpose of an n × n orthogonal matrix whose columns are right singular vectors
How It Works
To compute the SVD of , first form and find its eigenvalues . The singular values are , arranged in decreasing order along the diagonal of . The columns of are the corresponding eigenvectors of (orthonormalized). The columns of are found from for each nonzero singular value. The rank of equals the number of nonzero singular values.
Worked Example
Problem: Find the singular values of the matrix A = [[3, 0], [0, 4]].
Step 1: Compute .
Step 2: Find the eigenvalues of . Since it is diagonal, the eigenvalues are the diagonal entries: and .
Step 3: The singular values are the square roots of the eigenvalues, in decreasing order.
Answer: The singular values of are and , so .
Why It Matters
SVD is foundational in data science and machine learning — it powers principal component analysis (PCA), image compression, and recommendation systems like those used by streaming services. In numerical linear algebra courses, it provides the most numerically stable way to determine the rank of a matrix and solve least-squares problems.
Common Mistakes
Mistake: Confusing singular values with eigenvalues of itself.
Correction: Singular values are the square roots of the eigenvalues of , not of . They are always non-negative, whereas eigenvalues of can be negative or complex.
