/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q7.4-6E Question: Find an SVD of each ma... [FREE SOLUTION] | 91影视

91影视

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

6. \(\left( {\begin{array}{*{20}{c}}{ - {\bf{3}}}&{\bf{0}}\\{\bf{0}}&{ - {\bf{2}}}\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}}3&0\\0&2\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

Find the eigenvalues and eigenvectors of the given matrix

Let \(A = \left( {\begin{aligned}{{}}{ - 3}&0\\0&{ - 2}\end{aligned}} \right)\). The transpose of A is:

\({A^T} = \left( {\begin{aligned}{{}}{ - 3}&0\\0&{ - 2}\end{aligned}} \right)\)

Find the product \({A^T}A\).

\(\begin{aligned}{}{A^T}A = \left( {\begin{aligned}{{}}{ - 3}&0\\0&{ - 2}\end{aligned}} \right)\left( {\begin{aligned}{{}}{ - 3}&0\\0&{ - 2}\end{aligned}} \right)\\ = \left( {\begin{aligned}{{}}9&0\\0&4\end{aligned}} \right)\end{aligned}\)

So, the eigenvalues of the matrix are 9 and 4. The eigenvectors can be calculated as,

\(\begin{aligned}{}\left( {\begin{aligned}{{}}9&0\\0&4\end{aligned}} \right)\left( {\begin{aligned}{{}}{{x_1}}\\{{x_2}}\end{aligned}} \right) = \left( {\begin{aligned}{{}}0\\0\end{aligned}} \right)\\9{x_1} = 0\\4{x_2} = 0\end{aligned}\)

So, the eigenvectors of the matrix are\(\left( {\begin{aligned}{{}}1\\0\end{aligned}} \right)\) and \(\left( {\begin{aligned}{{}}0\\1\end{aligned}} \right)\).

03

Find the value of

The singular value is the square root of eigenvalues of \({A^T}A\) , that are, 3 and 2. Thus the matrix \(\Sigma \) is:

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

04

Find the matrix U

Consider the following equations:

\(\begin{array}{c}\Sigma U = AV\\\left( {\begin{array}{*{20}{c}}3&0\\0&2\end{array}} \right)\left( {\begin{array}{*{20}{c}}{{y_1}}&{{y_3}}\\{{y_2}}&{{y_4}}\end{array}} \right) = \left( {\begin{array}{*{20}{c}}{ - 3}&0\\0&{ - 2}\end{array}} \right)\left( {\begin{array}{*{20}{c}}1&0\\0&1\end{array}} \right)\\\left( {\begin{array}{*{20}{c}}{3{y_1}}&0\\0&{2{y_4}}\end{array}} \right) = \left( {\begin{array}{*{20}{c}}{ - 3}&0\\0&{ - 2}\end{array}} \right)\end{array}\)

On comparing two sides of the equation \({y_1} = - 1\), \({y_2} = 0\), \({y_3} = 0\) and \({y_4} = - 1\)

The matrix U can be written as,

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

Then by using \(A = U\sum {V^T}\).

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

Hence, the SVD of A can be written as, \(A = \left( {\begin{array}{*{20}{c}}{ - 1}&0\\0&1\end{array}} \right)\left( {\begin{array}{*{20}{c}}3&0\\0&2\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 91影视!

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 3-6, find (a) the maximum value of\(Q\left( {\rm{x}} \right)\)subject to the constraint\({{\rm{x}}^T}{\rm{x}} = 1\), (b) a unit vector\({\rm{u}}\)where this maximum is attained, and (c) the maximum of\(Q\left( {\rm{x}} \right)\)subject to the constraints\({{\rm{x}}^T}{\rm{x}} = 1{\rm{ and }}{{\rm{x}}^T}{\rm{u}} = 0\).

3.\(Q\left( x \right) = 5x_1^2 + 6x_2^2 + 7x_3^2 + 4x_1^{}x_2^{} - 4x_2^{}x_3^{}\).

In Exercises 3-6, find (a) the maximum value of \(Q\left( {\rm{x}} \right)\) subject to the constraint \({{\rm{x}}^T}{\rm{x}} = 1\), (b) a unit vector \({\rm{u}}\) where this maximum is attained, and (c) the maximum of \(Q\left( {\rm{x}} \right)\) subject to the constraints \({{\rm{x}}^T}{\rm{x}} = 1{\rm{ and }}{{\rm{x}}^T}{\rm{u}} = 0\).

4. \(Q\left( x \right) = 3x_1^2 + 3x_2^2 + 5x_3^2 + 6x_1^{}x_2^{} + 2x_1^{}x_3^{} + 2x_2^{}x_3^{}\).

Question: In Exercises 15 and 16, construct the pseudo-inverse of \(A\). Begin by using a matrix program to produce the SVD of \(A\), or, if that is not available, begin with an orthogonal diagonalization of \({A^T}A\). Use the pseudo-inverse to solve \(A{\rm{x}} = {\rm{b}}\), for \({\rm{b}} = \left( {6, - 1, - 4,6} \right)\) and let \(\mathop {\rm{x}}\limits^\^ \)be the solution. Make a calculation to verify that \(\mathop {\rm{x}}\limits^\^ \) is in Row \(A\). Find a nonzero vector \({\rm{u}}\) in Nul\(A\), and verify that \(\left\| {\mathop {\rm{x}}\limits^\^ } \right\| < \left\| {\mathop {\rm{x}}\limits^\^ + {\rm{u}}} \right\|\), which must be true by Exercise 13(c).

16. \(A = \left( {\begin{array}{*{20}{c}}4&0&{ - 1}&{ - 2}&0\\{ - 5}&0&3&5&0\\{\,\,\,2}&{\,\,0}&{ - 1}&{ - 2}&0\\{\,\,\,6}&{\,\,0}&{ - 3}&{ - 6}&0\end{array}} \right)\)

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\) 鈥渄iagonal鈥 matrix.

In Exercises 17鈥24, \(A\) is an \(m \times n\) matrix with a singular value decomposition \(A = U\Sigma {V^T}\) , where \(U\) is an \(m \times m\) orthogonal matrix, \({\bf{\Sigma }}\) is an \(m \times n\) 鈥渄iagonal鈥 matrix with \(r\) positive entries and no negative entries, and \(V\) is an \(n \times n\) orthogonal matrix. Justify each answer.

24. Using the notation of Exercise 23, show that \({A^T}{u_j} = {\sigma _j}{v_j}\) for \({\bf{1}} \le {\bf{j}} \le {\bf{r}} = {\bf{rank}}\;{\bf{A}}\)

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.