Chapter 7: Problem 10
A vector \(\mathbf{y}\) in \(\mathbb{R}^{n}\) can also be viewed as an \(n \times 1\) matrix \(Y=(\mathbf{y}) .\) Show that (a) \(\|Y\|_{2}=\|\mathbf{y}\|_{2}\) (b) \(\left\|Y^{T}\right\|_{2}=\|\mathbf{y}\|_{2}\)
/*! 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 10
A vector \(\mathbf{y}\) in \(\mathbb{R}^{n}\) can also be viewed as an \(n \times 1\) matrix \(Y=(\mathbf{y}) .\) Show that (a) \(\|Y\|_{2}=\|\mathbf{y}\|_{2}\) (b) \(\left\|Y^{T}\right\|_{2}=\|\mathbf{y}\|_{2}\)
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 and let \(\sigma_{1}\) be the largest singular value of \(A .\) Show that if \(\mathbf{x}\) and \(\mathbf{y}\) are nonzero vectors in \(\mathbb{R}^{n},\) then each of the following holds: (a) \(\frac{\left|\mathbf{x}^{T} A \mathbf{y}\right|}{\|\mathbf{x}\|_{2}\|\mathbf{y}\|_{2}} \leq \sigma_{1}\) [Hint: Make use of the Cauchy-Schwarz inequality. (b) \(\max _{\mathbf{x} \neq \mathbf{0}, \mathbf{y} \neq \mathbf{0}} \frac{\left|\mathbf{x}^{T} A \mathbf{y}\right|}{\|\mathbf{x}\|\|\mathbf{y}\|}=\sigma_{1}\)
Let \(A=\mathbf{x y}^{T},\) where \(\mathbf{x} \in \mathbb{R}^{m}, \mathbf{y} \in \mathbb{R}^{n},\) and both x and \(y\) are nonzero vectors. Show that \(A\) has a singular value decomposition of the form \(H_{1} \Sigma H_{2}\) where \(H_{1}\) and \(H_{2}\) are Householder transformations and \\[ \sigma_{1}=\|\mathbf{x}\|\|\mathbf{y}\|, \quad \sigma_{2}=\sigma_{3}=\cdots=\sigma_{n}=0 \\]
Let \\[ A=\left(\begin{array}{rrr} 0 & 3 & 1 \\ 1 & 2 & -2 \\ 2 & 5 & 4 \end{array}\right) \quad \text { and } \quad \mathbf{b}=\left(\begin{array}{r} 1 \\ 7 \\ -1 \end{array}\right) \\] (a) Reorder the rows of \((A | \mathbf{b})\) in the order (2,3,1) and then solve the reordered system. (b) Factor \(A\) into a product \(P^{T} L U\), where \(P\) is the permutation matrix corresponding to the reordering in part (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}\)
What would the machine epsilon be for a computer that uses 16 -digit base- 10 floating-point arithmetic?
What do you think about this solution?
We value your feedback to improve our textbook solutions.