For any
A∈Rm×n, the singular value decomposition is
A=UΣVT, where
U∈Rm×m and
V∈Rn×n are orthogonal and
Σ is diagonal with singular values
σ1≥σ2≥⋯≥σmin(m,n)≥0 (zeros allowed). Geometrically the map is "rotate + scale + rotate":
VT rotates the input onto the coordinate axes,
Σ scales each axis by
σi, and
U rotates into the output space — the unit sphere becomes a hyper-ellipse whose semi-axis lengths are the
σi, the longest axis
u1 being the most stretched direction. The singular values satisfy
σi2=λi(ATA); eigenvectors of
ATA form
V, eigenvectors of
AAT form
U. EVD: a symmetric matrix decomposes as
A=QΛQT (
Q orthogonal) with real eigenvalues and singular values
=∣λi∣. The condition number
κ=σ1/σn measures numerical stability: larger
κ means more ill-conditioned, and relative errors in the solution can be amplified by up to
κ.