What Is the Relationship Between Eigendecomposition and SVD?
At a glance
- 1. Start with the SVD
Write A as UΣV*: U and V contain orthonormal singular vectors, and Σ contains nonnegative singular values.
- 2. Form A* A
Its eigenvectors are the right singular vectors, and its eigenvalues are the squared singular values.
- 3. Form A A*
Its eigenvectors are the left singular vectors, with the same nonzero squared singular values.
- 4. Check symmetry
For a symmetric or Hermitian matrix, an eigendecomposition gives the SVD after accounting for eigenvalue signs.
Eigendecomposition and singular value decomposition (SVD) are closely related, but they do not decompose a general matrix in the same way. The key link is that the singular vectors of a matrix are eigenvectors of two matrices built from it: and . Here, means the conjugate transpose; for a real matrix, it is the ordinary transpose.
This relationship also explains a special case: for a symmetric or Hermitian matrix, an eigendecomposition can be converted directly into an SVD. For a general matrix, however, the SVD is not usually the eigendecomposition of the matrix itself.
The two decompositions
For an matrix , an SVD has the form
The columns of are right singular vectors, the columns of are left singular vectors, and the diagonal entries of are the singular values . The columns of and are orthonormal. The SVD exists for every real or complex matrix, including rectangular matrices.
An eigendecomposition, when it exists, writes a square matrix as
where the columns of are eigenvectors and the diagonal entries of are eigenvalues. A matrix is diagonalizable only if it has enough linearly independent eigenvectors. Its eigenvalues may be negative or complex, unlike singular values, which are always nonnegative.
The main connection: diagonalize and
Starting from the SVD and using the orthonormality of and gives
Both and are Hermitian positive semidefinite, so they have orthonormal eigenvectors and nonnegative eigenvalues. Their eigenvalues are the squared singular values of (with additional zeros if needed because of the matrix dimensions). Thus:
- The eigenvectors of are right singular vectors of .
- The eigenvectors of are left singular vectors of .
- The singular values are the square roots of the corresponding eigenvalues.
For a nonzero singular value , the matching left and right singular vectors satisfy
Equivalently, once you find a unit eigenvector of with eigenvalue , you can obtain its left singular vector from . Singular vectors associated with zero singular values require choosing orthonormal bases for the relevant null spaces.
When the matrix is symmetric or Hermitian
A real symmetric or complex Hermitian matrix has an orthonormal eigendecomposition
Its eigenvalues are real. If is also positive semidefinite, all eigenvalues are nonnegative, so this is already an SVD: take and .
If some eigenvalues are negative, the singular values are their absolute values. Let be diagonal, with entry for each nonnegative eigenvalue and for each negative eigenvalue. Then one valid SVD is
where is the diagonal matrix of absolute eigenvalues. Zero eigenvalues can be assigned either sign in . The signs move into the left singular vectors, while the singular values remain nonnegative.
Worked example
Consider the real matrix
First compute
This matrix has eigenvalues and , with unit eigenvectors
The singular values of are therefore and . For the nonzero singular value,
Complete to an orthonormal basis with . Taking to have columns , to have columns , and gives .
Common confusion
The SVD of is generally not the eigendecomposition of . The direct eigenvalue connection is to and , not necessarily to itself. This matters especially for rectangular matrices, which do not have an ordinary eigendecomposition, and for square matrices that are not diagonalizable. The SVD still exists in both cases.
References
- Matrix Computations, Gene H. Golub and Charles F. Van Loan
- Numerical Linear Algebra, Lloyd N. Trefethen and David Bau III
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.