Back to Using Singular Value Decompositions

Activity 7.5.2

Avg difficulty 2.5

Consider the equation Ax=bA\xvec=\bvec where [101112]x=[−136]\begin{bmatrix} 1 & 0 \\ 1 & 1 \\ 1 & 2 \end{bmatrix} \xvec = \threevec{-1}36

  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 diagonal matrix. Verify that A=UrΣrVrTA=U_r\Sigma_r V_r^T.

    You may find it convenient to remember that if B is a matrix defined in Sage, then B.matrix_from_columns( list ) and B.matrix_from_rows( list ) can be used to extract columns or rows from B. For instance, B.matrix_from_rows([0,1,2]) provides a matrix formed from the first three rows of B.

  4. How does the reduced singular value decomposition provide a matrix whose columns are an orthonormal basis for Col(A)\col(A)?

  5. Explain why a least-squares approximate solution x^\xhat satisfies Ax^=UrUrTb.A\xhat = U_rU_r^T\bvec.

  6. What is the product VrVrTV_rV_r^T and why does it have this form?

  7. Explain why x^=VrΣr−1UrTb\xhat = V_r\Sigma_r^{-1}U_r^T\bvec is the least-squares approximate solution, and use this expression to find x^\xhat.

Austin, Understanding Linear Algebra, §7.5 Using Singular Value Decompositions, Activity 7.5.2

AI Tutor

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