7: The Spectral Theorem and singular value decompositions

Understanding Linear Algebra · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY 4.0, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    7: The Spectral Theorem and singular value decompositions

    Chapter 4 demonstrated several important uses for the theory of eigenvalues and eigenvectors. For example, knowing the eigenvalues and eigenvectors of a matrix \(A\) enabled us to make predictions about the long-term behavior of dynamical systems in which some initial state \(\mathbf{x}_0\) evolves according to the rule \(\mathbf{x}_{k+1}=A \mathbf{x}_k\).

    We can't, however, apply this theory to every problem we might meet. First, eigenvectors only exist when the matrix \(A\) is square, and we have seen situations, such as the least-squares problems in Section 6.5, where the matrices we're interested in are not square. Second, even when \(A\) is square, there may not be a basis for \(\mathbb{R}^m\) consisting of eigenvectors of \(A\), an important condition we required for some of our work.

    This chapter introduces singular value decompositions, whose singular values and singular vectors may be viewed as a generalization of eigenvalues and eigenvectors. In fact, we will see that every matrix, whether square or not, has a singular value decomposition and that knowing it gives us a great deal of insight into the matrix. It's been said that having a singular value decomposition is like looking at a matrix with X-ray vision as the decomposition reveals essential features of the matrix.


    This page titled 7: The Spectral Theorem and singular value decompositions was last modified on Wed, 18 Mar 2026 00:23:08 GMT and is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by David Austin via source content that was edited to the style and standards of the LibreTexts platform.