Back to Understanding Linear Algebra

Using Singular Value Decompositions

Low-rank approximation, image compression, the pseudoinverse, and least-squares solutions, all read off the singular values of a matrix.

Understanding Linear Algebra, Using Singular Value Decompositions

Status
FlagsLoading your progress…

6 exercises

Activity 7.5.2

Consider the equation Ax=bA\xvec=\bvec where

  1. Find a singular value decomposition for AA using the Sage cell below. What are singular values of AA?

  2. What is rr, the rank of AA? How can we identify an orthonormal basis for Col(A)\col(A)?

  3. Form the reduced singular value decomposition UrΣrVrTU_r\Sigma_rV_r^T by constructing: the matrix UrU_r, consisting of the first rr columns of UU; the matrix VrV_r, consisting of the first rr columns of VV; and Σr\Sigma_r, a square r×rr\times r diagona…

2.5

Exercise 1

Suppose that

  1. Find the singular values of AA. What is rank⁡(A)\rank(A)?

  2. Find the sequence of matrices A1A_1, A2A_2, A3A_3, and A4A_4 where AkA_k is the rank kk approximation of AA.

2.5

Exercise 2

Suppose we would like to find the best quadratic function fitting the points

  1. Set up a linear system Ax=bA\xvec = \bvec describing the coefficients x=[β0β1β2]\xvec = \threevec{\beta_0}{\beta_1}{\beta_2}.

  2. Find the singular value decomposition of AA.

  3. Use the singular value decomposition to find the least-squares approximate solution x^\xhat.

2.5

Exercise 3

Remember that the outer product of two vectors u\uvec and v\vvec is the matrix u vT\uvec~\vvec^T.

  1. Suppose that u=[2−3]\uvec = \twovec{2}{-3} and v=[201]\vvec=\threevec201. Evaluate the outer product u vT\uvec~\vvec^T. To get a clearer sense of how this works, perform this operation without using technology.

    How is each of the columns of u vT\uvec~\vvec^T related to u\uvec?

  2. Suppose u\uvec and v\vvec are general vectors. What is rank⁡(u vT)\rank(\uvec~\vvec^T) and what is a basis for its column space Col(u vT)\col(\uvec~\vvec^T)?

  3. Suppose that u\uvec is a unit vector. What is the effect…

2.5

Exercise 7

Suppose that A=UrΣrVrTA=U_r\Sigma_rV_r^T is a reduced singular value decomposition of the m×nm\times n matrix AA. The matrix A+=VrΣr−1UrTA^+ = V_r\Sigma_r^{-1}U_r^T is called the Moore-Penrose inverse of AA.

  1. Explain why A+A^+ is an n×mn\times m matrix.

  2. If AA is an invertible, square matrix, explain why A+=A−1A^+=A^{-1}.

  3. Explain why AA+b=b^AA^+\bvec=\bhat, the orthogonal projection of b\bvec onto Col(A)\col(A).

  4. Explain why A+Ax=x^A^+A\xvec=\xhat, the orthogonal projection of x\xvec onto Col(AT)\col(A^T).

2.5

Exercise 8

In Partial pivoting, we saw how some linear algebraic computations are sensitive to round off error made by a computer. A singular value decomposition can help us understand when this situation can occur.

For instance, consider the matrices The entries in these matrices are quite close to one another, but AA is invertible while BB is not. It seems like AA is almost singular. In fact, we can measure h…

2.5

Adapted from Understanding Linear Algebra © 2023 David Austin. Licensed under CC BY 4.0. Source: Understanding Linear Algebra. Imported at revision 3e6dced.