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 the singular values of the matrices in Exercises 1-4.

4. \(\left( {\begin{array}{*{20}{c}}3&0\\8&3\end{array}} \right)\)

Short Answer

Expert verified

The singular values of the matrix \(A\) are \({\sigma _1} = 9,{\sigma _2} = 1\).

Step by step solution

01

Definition of Singular values

The square roots of the eigenvaluesof \({A^T}A\), represented by \({\sigma _1}, \ldots ,{\sigma _n}\) are known as the singular valuesof \(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 ofA from equation (2).

02

Determine the singular values of the matrix

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

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

\(\begin{array}{c}{A^T}A = \left( {\begin{array}{*{20}{c}}3&8\\0&3\end{array}} \right)\left( {\begin{array}{*{20}{c}}3&0\\8&3\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{9 + 64}&{0 + 24}\\{0 + 24}&{0 + 9}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{73}&{24}\\{24}&9\end{array}} \right)\end{array}\)

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

\(\begin{array}{c}\left( {657 - 82\lambda + {\lambda ^2}} \right) - 576 = 0\\{\lambda ^2} - 82\lambda + 81 = 0\\\left( {\lambda - 1} \right)\left( {\lambda - 81} \right) = 0\end{array}\)

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

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

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

\(\begin{array}{c}{\sigma _1} = \sqrt {81} \\ = 9\\{\sigma _2} = \sqrt 1 \\ = 1\end{array}\)

Thus, the singular values of the matrix \(A\) are \({\sigma _1} = 9,{\sigma _2} = 1\).

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

Suppose A is a symmetric \(n \times n\) matrix and B is any \(n \times m\) matrix. Show that \({B^T}AB\), \({B^T}B\), and \(B{B^T}\) are symmetric matrices.

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\) “diagonal” matrix with \(r\) positive entries and no negative entries, and \(V\) is an \(n \times n\) orthogonal matrix. Justify each answer.

18. Suppose \(A\) is square and invertible. Find a singular value decomposition of \({A^{ - 1}}\)

Question: 2. Let \(\left\{ {{{\bf{u}}_1},{{\bf{u}}_2},....,{{\bf{u}}_n}} \right\}\) be an orthonormal basis for \({\mathbb{R}_n}\) , and let \({\lambda _1},....{\lambda _n}\) be any real scalars. Define

\(A = {\lambda _1}{{\bf{u}}_1}{\bf{u}}_1^T + ..... + {\lambda _n}{\bf{u}}_n^T\)

a. Show that A is symmetric.

b. Show that \({\lambda _1},....{\lambda _n}\) are the eigenvalues of A

(M) Orhtogonally diagonalize the matrices in Exercises 37-40. To practice the methods of this section, do not use an eigenvector routine from your matrix program. Instead, use the program to find the eigenvalues, and for each eigenvalue \(\lambda \), find an orthogonal basis for \({\bf{Nul}}\left( {A - \lambda I} \right)\), as in Examples 2 and 3.

39. \(\left( {\begin{aligned}{{}}{.{\bf{31}}}&{.{\bf{58}}}&{.{\bf{08}}}&{.{\bf{44}}}\\{.{\bf{58}}}&{ - .{\bf{56}}}&{.{\bf{44}}}&{ - .{\bf{58}}}\\{.{\bf{08}}}&{.{\bf{44}}}&{.{\bf{19}}}&{ - .{\bf{08}}}\\{ - .{\bf{44}}}&{ - .{\bf{58}}}&{ - .{\bf{08}}}&{.{\bf{31}}}\end{aligned}} \right)\)

Question 7: Prove that an \(n \times n\) A is positive definite if and only if A admits a Cholesky factorization, namely, \(A = {R^T}R\) for some invertible upper triangular matrix R whose diagonal entries are all positive. (Hint; Use a QR factorization and Exercise 26 in Section 7.2.)

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