Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 7: Q7.4-18E (page 395)

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}}\)

Short Answer

Expert verified

The required singular decomposition of \({A^{ - 1}}\) is \(V\mathop \Sigma \limits^{ - 1} {U^T}\).

Step by step solution

01

Find \(A\)

It is given that\(A\)is square and invertible. As the matrix\(V\)is an orthogonal matrix,\({V^T} = {V^{ - 1}}\), then we have,

\(\begin{array}{c}A = U\Sigma {V^T}\\ = U\Sigma {V^{ - 1}}\end{array}\)

02

Find the singular value decomposition of the matrix \({A^{ - 1}}\)

\(\begin{array}{c}{A^{ - 1}} = {\left( {U\Sigma {V^{ - 1}}} \right)^{ - 1}}\\ = V\mathop \Sigma \limits^{ - 1} {U^{ - 1}}\\ = V\mathop \Sigma \limits^{ - 1} {U^T}\end{array}\)

Therefore, \({A^{ - 1}} = V\mathop \Sigma \limits^{ - 1} {U^T}\).

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.

Start your free trial

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

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)\)

(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)\)

Determine which of the matrices in Exercises 7–12 are orthogonal. If orthogonal, find the inverse.

12. \(P = \left( {\begin{aligned}{{}}{.5}&{.5}&{ - .5}&{ - .5}\\{.5}&{.5}&{.5}&{.5}\\{.5}&{ - .5}&{ - .5}&{.5}\\{.5}&{ - .5}&{.5}&{ - .5}\end{aligned}} \right)\)

Question: Mark Each statement True or False. Justify each answer. In each part, A represents an \(n \times n\) matrix.

  1. If A is orthogonally diagonizable, then A is symmetric.
  2. If A is an orthogonal matrix, then A is symmetric.
  3. If A is an orthogonal matrix, then \(\left\| {A{\bf{x}}} \right\| = \left\| {\bf{x}} \right\|\) for all x in \({\mathbb{R}^n}\).
  4. The principal axes of a quadratic from \({{\bf{x}}^T}A{\bf{x}}\) can be the columns of any matrix P that diagonalizes A.
  5. If P is an \(n \times n\) matrix with orthogonal columns, then \({P^T} = {P^{ - {\bf{1}}}}\).
  6. If every coefficient in a quadratic form is positive, then the quadratic form is positive definite.
  7. If \({{\bf{x}}^T}A{\bf{x}} > {\bf{0}}\) for some x, then the quadratic form \({{\bf{x}}^T}A{\bf{x}}\) is positive definite.
  8. By a suitable change of variable, any quadratic form can be changed into one with no cross-product term.
  9. The largest value of a quadratic form \({{\bf{x}}^T}A{\bf{x}}\), for \(\left\| {\bf{x}} \right\| = {\bf{1}}\) is the largest entery on the diagonal A.
  10. The maximum value of a positive definite quadratic form \({{\bf{x}}^T}A{\bf{x}}\) is the greatest eigenvalue of A.
  11. A positive definite quadratic form can be changed into a negative definite form by a suitable change of variable \({\bf{x}} = P{\bf{u}}\), for some orthogonal matrix P.
  12. An indefinite quadratic form is one whose eigenvalues are not definite.
  13. If P is an \(n \times n\) orthogonal matrix, then the change of variable \({\bf{x}} = P{\bf{u}}\) transforms \({{\bf{x}}^T}A{\bf{x}}\) into a quadratic form whose matrix is \({P^{ - {\bf{1}}}}AP\).
  14. If U is \(m \times n\) with orthogonal columns, then \(U{U^T}{\bf{x}}\) is the orthogonal projection of x onto ColU.
  15. If B is \(m \times n\) and x is a unit vector in \({\mathbb{R}^n}\), then \(\left\| {B{\bf{x}}} \right\| \le {\sigma _{\bf{1}}}\), where \({\sigma _{\bf{1}}}\) is the first singular value of B.
  16. A singular value decomposition of an \(m \times n\) matrix B can be written as \(B = P\Sigma Q\), where P is an \(m \times n\) orthogonal matrix and \(\Sigma \) is an \(m \times n\) diagonal matrix.
  17. If A is \(n \times n\), then A and \({A^T}A\) have the same singular values.

Question 8: Use Exercise 7 to show that if A is positive definite, then A has a LU factorization, \(A = LU\), where U has positive pivots on its diagonal. (The converse is true, too).
See all solutions

Recommended explanations on Math Textbooks

Probability and Statistics

Read Explanation

Pure Maths

Read Explanation

Applied Mathematics

Read Explanation

Calculus

Read Explanation

Geometry

Read Explanation

Logic and Functions

Read Explanation
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