Ma · Mathematics

What Is the Relationship Between Eigendecomposition and SVD?

Published By the 9to5Science editorial team

At a glance

  1. 1. Start with the SVD

    Write A as UΣV*: U and V contain orthonormal singular vectors, and Σ contains nonnegative singular values.

  2. 2. Form A* A

    Its eigenvectors are the right singular vectors, and its eigenvalues are the squared singular values.

  3. 3. Form A A*

    Its eigenvectors are the left singular vectors, with the same nonzero squared singular values.

  4. 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: A∗AA^*A and AA∗AA^*. Here, A∗A^* 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 m×nm\times n matrix AA, an SVD has the form

A=UΣV∗.A=U\Sigma V^*.

The columns of VV are right singular vectors, the columns of UU are left singular vectors, and the diagonal entries of Σ\Sigma are the singular values σi≥0\sigma_i\geq 0. The columns of UU and VV are orthonormal. The SVD exists for every real or complex matrix, including rectangular matrices.

An eigendecomposition, when it exists, writes a square matrix as

A=QΛQ−1,A=Q\Lambda Q^{-1},

where the columns of QQ are eigenvectors and the diagonal entries of Λ\Lambda 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 A∗AA^*A and AA∗AA^*

Starting from the SVD and using the orthonormality of UU and VV gives

A∗A=VΣ∗ΣV∗,AA∗=UΣΣ∗U∗.\begin{aligned} A^*A &= V\Sigma^*\Sigma V^*,\\ AA^* &= U\Sigma\Sigma^* U^*. \end{aligned}

Both A∗AA^*A and AA∗AA^* are Hermitian positive semidefinite, so they have orthonormal eigenvectors and nonnegative eigenvalues. Their eigenvalues are the squared singular values of AA (with additional zeros if needed because of the matrix dimensions). Thus:

  • The eigenvectors of A∗AA^*A are right singular vectors of AA.
  • The eigenvectors of AA∗AA^* are left singular vectors of AA.
  • The singular values are the square roots of the corresponding eigenvalues.

For a nonzero singular value σi\sigma_i, the matching left and right singular vectors satisfy

Avi=σiui,A∗ui=σivi.Av_i=\sigma_i u_i, \qquad A^*u_i=\sigma_i v_i.

Equivalently, once you find a unit eigenvector viv_i of A∗AA^*A with eigenvalue σi2>0\sigma_i^2>0, you can obtain its left singular vector from ui=Avi/σiu_i=Av_i/\sigma_i. 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

A=QΛQ∗.A=Q\Lambda Q^*.

Its eigenvalues are real. If AA is also positive semidefinite, all eigenvalues are nonnegative, so this is already an SVD: take U=V=QU=V=Q and Σ=Λ\Sigma=\Lambda.

If some eigenvalues are negative, the singular values are their absolute values. Let DD be diagonal, with entry +1+1 for each nonnegative eigenvalue and −1-1 for each negative eigenvalue. Then one valid SVD is

A=(QD)∣Λ∣Q∗,A=(QD)|\Lambda|Q^*,

where ∣Λ∣|\Lambda| is the diagonal matrix of absolute eigenvalues. Zero eigenvalues can be assigned either sign in DD. The signs move into the left singular vectors, while the singular values remain nonnegative.

Worked example

Consider the real matrix

A=(1100).A=\begin{pmatrix}1&1\\0&0\end{pmatrix}.

First compute

ATA=(1111).A^T A=\begin{pmatrix}1&1\\1&1\end{pmatrix}.

This matrix has eigenvalues 22 and 00, with unit eigenvectors

v1=12(11),v2=12(1−1).v_1=\frac{1}{\sqrt{2}}\begin{pmatrix}1\\1\end{pmatrix}, \qquad v_2=\frac{1}{\sqrt{2}}\begin{pmatrix}1\\-1\end{pmatrix}.

The singular values of AA are therefore 2\sqrt{2} and 00. For the nonzero singular value,

u1=Av12=(10).u_1=\frac{Av_1}{\sqrt{2}}=\begin{pmatrix}1\\0\end{pmatrix}.

Complete u1u_1 to an orthonormal basis with u2=(0,1)Tu_2=(0,1)^T. Taking UU to have columns u1,u2u_1,u_2, VV to have columns v1,v2v_1,v_2, and Σ=diag⁡(2,0)\Sigma=\operatorname{diag}(\sqrt{2},0) gives A=UΣVTA=U\Sigma V^T.

Common confusion

The SVD of AA is generally not the eigendecomposition of AA. The direct eigenvalue connection is to A∗AA^*A and AA∗AA^*, not necessarily to AA 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

  1. Matrix Computations, Gene H. Golub and Charles F. Van Loan
  2. 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.