Chapter 7: Problem 9
Let \(A\) be an \(m \times n\) matrix and let \(\mathbf{b} \in \mathbb{R}^{m} .\) Show that \(\mathbf{b} \in R(A)\) if and only if \\[ \mathbf{b}=A A^{+} \mathbf{b} \\]
/*! 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}
Learning Materials
Features
Discover
Chapter 7: Problem 9
Let \(A\) be an \(m \times n\) matrix and let \(\mathbf{b} \in \mathbb{R}^{m} .\) Show that \(\mathbf{b} \in R(A)\) if and only if \\[ \mathbf{b}=A A^{+} \mathbf{b} \\]
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A\) be an \(m \times n\) matrix. The 1,2 -norm of \(A\) is given by \\[ \|A\|_{1,2}=\max _{\mathbf{x} \neq \mathbf{0}} \frac{\|A \mathbf{x}\|_{2}}{\|\mathbf{x}\|_{1}} \\] (See Exercise \(19 .)\) Show that \\[ \|A\|_{1,2}=\max \left(\left\|\mathbf{a}_{1}\right\|_{2},\left\|\mathbf{a}_{2}\right\|_{2}, \ldots,\left\|\mathbf{a}_{n}\right\|_{2}\right) \\]
Suppose that you wish to eliminate the last coordinate of a vector \(\mathbf{x}\) and leave the first \(n-2\) coordinates unchanged. How many operations are necessary if this is to be done by a Givens transformation \(G ?\) A Householder transformation \(H ?\) If \(A\) is an \(n \times n\) matrix, how many operations are required to compute \(G A\) and \(H A ?\)
Let \\[ A=\left(\begin{array}{rrr} 3 & -1 & -2 \\ -1 & 2 & -7 \\ 4 & 1 & 4 \end{array}\right) \\] (a) Determine \(\|A\|_{\infty}\) (b) Find a vector \(\mathbf{x}\) whose coordinates are each ±1 such that \(\|A \mathbf{x}\|_{\infty}=\|A\|_{\infty} .\) (Note that \(\|\mathbf{x}\|_{\infty}=1,\) so \(\|A\|_{\infty}=\|A \mathbf{x}\|_{\infty} /\|\mathbf{x}\|_{\infty}\)
Let \(A\) be an \(m \times n\) matrix with singular value decomposition \(U \Sigma
V^{T},\) and suppose that \(A\) has rank \(r,\) where \(r
Let \\[ A=\left(\begin{array}{rrr} 1 & 8 & 6 \\ -1 & -4 & 5 \\ 2 & 4 & -6 \end{array}\right) \quad \text { and } \quad \mathbf{b}=\left(\begin{array}{l} 8 \\ 1 \\ 4 \end{array}\right) \\] Solve the system \(A \mathbf{x}=\mathbf{b}\) using partial pivoting. If \(P\) is the permutation matrix corresponding to the pivoting strategy, factor \(P A\) into a product \(L U\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.