1. In Exercises 17 and 18, \(A\) is an \(m \times n\) matrix and \(b\) is in \({\mathbb{R}^m}\). Mark each statement True or False. Justify each answer.

17.

  1. The general least-square problem is to find an \(x\) that makes \(Ax\) as close as possible to \(b\).
  2. A least-square solution of \(Ax = b\) is a vector \(\hat x\) that satisfies \(A\hat x = \hat b\), where \(\hat b\) is the orthogonal projection of \(b\)onto \({\rm{Col }}A\).
  3. A least-square solution of \(Ax = b\) is a vector \(\hat x\) such that \(\left\| {b - Ax} \right\| \le \left\| {b - A\hat x} \right\|\) for all \(x\) in \({\mathbb{R}^n}\).
  4. Any solution of \({A^T}Ax = {A^T}b\) is a least-squares solution of \(Ax = b\).
  5. If the columns of \(A\) are linearly independent, then the equation \(Ax = b\) has exactly one least-squares solution.

Short Answer

Expert verified
  1. The given statement is True.
  2. The given statement is True.
  3. The given statement is False.
  4. The given statement is True.
  5. The given statement is True.

Step by step solution

01

The smallest distance

(a)

The general least-square problem is to find \(\left\| {b - Ax} \right\|\) which is equal to the root of a sum of squares. This is equal to the distance between \(b\) and \(Ax\).

Therefore, the statement is true.

02

Orthogonal projection

(b)

If \(b\) is the orthogonal projection of \(b\) onto \({\rm{Col }}A\), then \[Ax = b\]. Also,the orthogonal projection theorem states that \(b - \hat b\) is orthogonal to \({\rm{Col}}\,A\). So,

\(\begin{aligned}{}{A^T}\left( {b - A\hat x} \right) = 0\\{A^T}b - {A^T}A\hat x = 0\\{A^T}A\hat x = {A^T}b\end{aligned}\)

Hence, the statement is true.

03

Solution of least-square solution

(c)

The definition of least-square solution states that a least-square solution of \(Ax = b\) is a vector \(x\) such that \(\left\| {b - Ax} \right\| \ge \left\| {b - A\hat x} \right\|\).

Thus, the statement is false.

04

Based on Theorem 13

(d)

The nonempty set of solutions to the normal equations \({A^T}Ax = {A^T}b\) corresponds to the set of least-square solutions of \(Ax = b\).

Hence, the statement is true.

05

Based on Theorem 14

(e)

If the columns of \(A\) are linearly independent, the equation \(Ax = b\) has only one least square solution, which is provided by \(\hat x = {\left( {{A^T}A} \right)^{ - 1}}{A^T}b\), according to the Theorem 14.

Hence, the statement is true.

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

A certain experiment produce the data \(\left( {1,7.9} \right),\left( {2,5.4} \right)\) and \(\left( {3, - .9} \right)\). Describe the model that produces a least-squares fit of these points by a function of the form

\(y = A\cos x + B\sin x\)

Suppose \(A = QR\), where \(R\) is an invertible matrix. Showthat \(A\) and \(Q\) have the same column space.

In Exercises 11 and 12, find the closest point to\[{\bf{y}}\]in the subspace\[W\]spanned by\[{{\bf{v}}_1}\], and\[{{\bf{v}}_2}\].

11.\[y = \left[ {\begin{aligned}3\\1\\5\\1\end{aligned}} \right]\],\[{{\bf{v}}_1} = \left[ {\begin{aligned}3\\1\\{ - 1}\\1\end{aligned}} \right]\],\[{{\bf{v}}_2} = \left[ {\begin{aligned}1\\{ - 1}\\1\\{ - 1}\end{aligned}} \right]\]

Find an orthogonal basis for the column space of each matrix in Exercises 9-12.

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

For a matrix program, the Gram–Schmidt process worksbetter with orthonormal vectors. Starting with \({x_1},......,{x_p}\) asin Theorem 11, let \(A = \left\{ {{x_1},......,{x_p}} \right\}\) . Suppose \(Q\) is an\(n \times k\)matrix whose columns form an orthonormal basis for

the subspace \({W_k}\) spanned by the first \(k\) columns of A. Thenfor \(x\) in \({\mathbb{R}^n}\), \(Q{Q^T}x\) is the orthogonal projection of x onto \({W_k}\) (Theorem 10 in Section 6.3). If \({x_{k + 1}}\) is the next column of \(A\),then equation (2) in the proof of Theorem 11 becomes

\({v_{k + 1}} = {x_{k + 1}} - Q\left( {{Q^T}T {x_{k + 1}}} \right)\)

(The parentheses above reduce the number of arithmeticoperations.) Let \({u_{k + 1}} = \frac{{{v_{k + 1}}}}{{\left\| {{v_{k + 1}}} \right\|}}\). The new \(Q\) for thenext step is \(\left( {\begin{aligned}{{}{}}Q&{{u_{k + 1}}}\end{aligned}} \right)\). Use this procedure to compute the\(QR\)factorization of the matrix in Exercise 24. Write thekeystrokes or commands you use.

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