Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: Find an SVD of each matrix in Exercises 5-12. (Hint: In Exercise 11, one choice for \(U = \left( {\begin{array}{*{20}{c}}{ - \frac{1}{3}}&{\frac{2}{3}}&{\frac{2}{3}}\\{\frac{2}{3}}&{ - \frac{1}{3}}&{\frac{2}{3}}\\{\frac{2}{3}}&{\frac{2}{3}}&{ - \frac{1}{3}}\end{array}} \right)\). In Exercise 12, one column of U can be \(\left( {\begin{array}{*{20}{c}}{\frac{1}{{\sqrt 6 }}}\\{\frac{{ - 2}}{{\sqrt 6 }}}\\{\frac{1}{{\sqrt 6 }}}\end{array}} \right)\).)

5. \(\left( {\begin{array}{*{20}{c}}{ - 2}&0\\0&0\end{array}} \right)\)

Short Answer

Expert verified

The singular value decomposition of \(A\) is \(A = \left( {\begin{array}{*{20}{c}}{ - 1}&0\\0&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}2&0\\0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}1&0\\0&1\end{array}} \right)\).

Step by step solution

01

The Singular Value Decomposition

Consider \(m \times n\) matrix with rank \(r\) as \(A\). There is a \(m \times n\) matrix \(\sum \) as seen in (3) wherein the diagonal entriesin \(D\) are the first \(r\) singular valuesof A, \({\sigma _1} \ge \cdots \ge {\sigma _r} > 0,\) and there arises an \(m \times m\) orthogonal matrix \(U\) and an \(n \times n\) orthogonal matrix \(V\) such that \(A = U\sum {V^T}\).

02

Determine the eigenvalues and eigenvector of \({A^T}A\)

Consider the matrix as \(A = \left( {\begin{array}{*{20}{c}}{ - 2}&0\\0&0\end{array}} \right)\).

Compute the matrix \({A^T}A\) as shown below:

\(\begin{array}{c}{A^T}A = \left( {\begin{array}{*{20}{c}}{ - 2}&0\\0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}{ - 2}&0\\0&0\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{4 + 0}&{0 + 0}\\{0 + 0}&{0 + 0}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}4&0\\0&0\end{array}} \right)\end{array}\)

The characteristic equation of \({A^T}A\) to obtain the eigenvalues of the matrix is shown below:

\(\begin{array}{c}{\lambda ^2} - 4\lambda = 0\\\lambda \left( {\lambda - 4} \right) = 0\end{array}\)

Thus, the eigenvalues of the matrix \({A^T}A\) are \({\lambda _1} = 0,{\lambda _2} = 4\).

It is observed that the eigenvalue of \({A^T}A\) is in decreasing order.

The associated unit eigenvectors of \({\lambda _2} = 4\) is \(\left( {\begin{array}{*{20}{c}}1\\0\end{array}} \right)\) and \({\lambda _1} = 0\) is \(\left( {\begin{array}{*{20}{c}}0\\1\end{array}} \right)\).

03

Construct   \(V\) and determine the singular values of the matrix

The square roots of the eigenvaluesof \({A^T}A\), represented by \({\sigma _1}, \ldots ,{\sigma _n}\) are known as the singular values of \(A\) and they have been arranged in decreasing order. In other words, \({\sigma _i} = \sqrt {{\lambda _i}} \) for \(1 \le i \le n\). The lengths of the vectors \(A{{\bf{v}}_1}, \ldots ,A{{\bf{v}}_n}\) are called the singular values of A from equation (2).

Use the eigenvectors to construct \(V\) as shown below:

\(\begin{array}{c}V = \left( {\begin{array}{*{20}{c}}{{{\bf{v}}_1}}&{{{\bf{v}}_2}}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}1&0\\0&1\end{array}} \right)\end{array}\)

Obtain the singular values of the matrices as shown below:

\(\begin{array}{c}{\sigma _1} = \sqrt 4 \\ = 2\\{\sigma _2} = \sqrt 0 \\ = 0\end{array}\)

Construct the matrix \(\sum \) as shown below:

\(\sum = \left( {\begin{array}{*{20}{c}}2&0\\0&0\end{array}} \right)\)

04

Construct the matrix U

Compute \({{\bf{u}}_1}\) as shown below:

\(\begin{array}{c}{{\bf{u}}_1} = \frac{1}{{{\sigma _1}}}A{{\bf{v}}_1}\\ = \frac{1}{2}\left( {\begin{array}{*{20}{c}}{ - 2}&0\\0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}1\\0\end{array}} \right)\\ = \frac{1}{2}\left( {\begin{array}{*{20}{c}}{ - 2 + 0}\\{0 + 0}\end{array}} \right)\\ = \frac{1}{2}\left( {\begin{array}{*{20}{c}}{ - 2}\\0\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{ - 1}\\0\end{array}} \right)\end{array}\)

Since \(A{{\bf{v}}_2} = 0\) the only column for \(U\) that has been discovered is \({{\bf{u}}_1}\).

Extend \(\left\{ {{{\bf{u}}_1}} \right\}\) to an orthonormal basis in \({\mathbb{R}^2}\) to obtain other columns of \(U\). Therefore, \({{\bf{u}}_2} = \left( {\begin{array}{*{20}{c}}0\\1\end{array}} \right)\).

Use \({{\bf{u}}_1}\) and \({{\bf{u}}_2}\) to construct the matrix \(U\) as shown below:

\(U = \left( {\begin{array}{*{20}{c}}{ - 1}&0\\0&1\end{array}} \right)\)

05

Determine the singular value decomposition of the matrix

Obtain the singular value decomposition of \(A\) as shown below:

\(\begin{array}{c}A = U\sum {V^T}\\ = \left( {\begin{array}{*{20}{c}}{ - 1}&0\\0&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}2&0\\0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}1&0\\0&1\end{array}} \right)\end{array}\)

Thus, the singular value decomposition of \(A\) is \(A = \left( {\begin{array}{*{20}{c}}{ - 1}&0\\0&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}2&0\\0&0\end{array}} \right)\left( {\begin{array}{*{20}{c}}1&0\\0&1\end{array}} \right)\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In Exercises 25 and 26, mark each statement True or False. Justify each answer.

a. An\(n \times n\)matrix that is orthogonally diagonalizable must be symmetric.

b. If\({A^T} = A\)and if vectors\({\rm{u}}\)and\({\rm{v}}\)satisfy\(A{\rm{u}} = {\rm{3u}}\)and\(A{\rm{v}} = {\rm{3v}}\), then\({\rm{u}} \cdot {\rm{v}} = {\rm{0}}\).

c. An\(n \times n\)symmetric matrix has n distinct real eigenvalues.

d. For a nonzero \({\rm{v}}\) in \({\mathbb{R}^n}\) , the matrix \({\rm{v}}{{\rm{v}}^T}\) is called a projection matrix.

25.Let \({\bf{T:}}{\mathbb{R}^{\bf{n}}} \to {\mathbb{R}^{\bf{m}}}\) be a linear transformation. Describe how to find a basis \(B\) for \({\mathbb{R}^n}\) and a basis \(C\) for \({\mathbb{R}^m}\) such that the matrix for \(T\) relative to \(B\) and \(C\) is an \(m \times n\) โ€œdiagonalโ€ matrix.

In Exercises 25 and 26, mark each statement True or False. Justify each answer.

26.

  1. There are symmetric matrices that are not orthogonally diagonizable.
  2. b. If \(B = PD{P^T}\), where \({P^T} = {P^{ - {\bf{1}}}}\) and D is a diagonal matrix, then B is a symmetric matrix.
  3. c. An orthogonal matrix is orthogonally diagonizable.
  4. d. The dimension of an eigenspace of a symmetric matrix is sometimes less than the multiplicity of the corresponding eigenvalue.

Suppose Aand B are orthogonally diagonalizable and \(AB = BA\). Explain why \(AB\) is also orthogonally diagonalizable.

Orthogonally diagonalize the matrices in Exercises 13โ€“22, giving an orthogonal matrix\(P\)and a diagonal matrix\(D\). To save you time, the eigenvalues in Exercises 17โ€“22 are: (17)\( - {\bf{4}}\), 4, 7; (18)\( - {\bf{3}}\),\( - {\bf{6}}\), 9; (19)\( - {\bf{2}}\), 7; (20)\( - {\bf{3}}\), 15; (21) 1, 5, 9; (22) 3, 5.

17. \(\left( {\begin{aligned}{{}}1&{ - 6}&4\\{ - 6}&2&{ - 2}\\4&{ - 2}&{ - 3}\end{aligned}} \right)\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free