Singular Value Decomposition: Matrix decomposition

It is the generalization of the eigendecomposition of a positive semidefinite normal matrix (for example, a symmetric matrix with positive eigenvalues) to any matrix via an extension of the polar decomposition. It has many useful applications in signal processing and statistics.

Formally, the singular value decomposition of an ${\displaystyle m\times n}$ complex matrix ${\displaystyle M}$ is a factorization of the form ${\displaystyle \mathbf {U\Sigma V^{*}} }$, where ${\displaystyle U}$ is an ${\displaystyle m\times m}$ complex unitary matrix, ${\displaystyle \mathbf {\Sigma } }$ is an ${\displaystyle m\times n}$ rectangular diagonal matrix with non-negative real numbers on the diagonal, and ${\displaystyle V}$ is an ${\displaystyle n\times n}$ complex unitary matrix. The diagonal entries ${\displaystyle \sigma _{i}=\Sigma _{ii}}$ of ${\displaystyle \mathbf {\Sigma } }$ are known as the singular values of ${\displaystyle M}$. The columns of ${\displaystyle U}$ and the columns of ${\displaystyle V}$ are called the left-singular vectors and right-singular vectors of ${\displaystyle M}$, respectively.

The singular-value decomposition can be computed using the following observations:

• The left-singular vectors of M are a set of orthonormal eigenvectors of MM^∗.
• The right-singular vectors of M are a set of orthonormal eigenvectors of M^∗M.
• The non-zero singular values of M (found on the diagonal entries of Σ) are the square roots of the non-zero eigenvalues of both M^∗M and MM^∗.

This short article about mathematics can be made longer. You can help Wikipedia by adding to it.