Chapter 7: Problem 10
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
/*! 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
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
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A=L U\), where \(L\) is lower triangular with 1 's on the diagonal and \(U\) is upper triangular. (a) How many scalar additions and multiplications are necessary to solve \(L \mathbf{y}=\mathbf{e}_{j}\) by forward substitution? (b) How many additions/subtractions and multiplications/divisions are necessary to solve \(A \mathbf{x}=\) \(\mathbf{e}_{j} ?\) The solution \(\mathbf{x}_{j}\) of \(A \mathbf{x}=\mathbf{e}_{j}\) will be the \(j\) th column of \(A^{-1}\) (c) Given the factorization \(A=L U\), how many additional multiplications/ divisions and additions/subtractions are needed to compute \(A^{-1} ?\)
Let \(A=Q_{1} R_{1}=Q_{2} R_{2},\) where \(Q_{1}\) and \(Q_{2}\) are orthogonal and \(R_{1}\) and \(R_{2}\) are both upper triangular and nonsingular. (a) Show that \(Q_{1}^{T} Q_{2}\) is diagonal. (b) How do \(R_{1}\) and \(R_{2}\) compare? Explain.
Let \(A\) be a \(3 \times 3\) matrix, and assume that \(A\) can be transformed into a lower triangular matrix \(L\) by using only column operations of type III; that is, \\[ A E_{1} E_{2} E_{3}=L \\] where \(E_{1}, E_{2}, E_{3}\) are elementary matrices of type III. Let $$ U=\left(E_{1} E_{2} E_{3}\right)^{-1} $$ Show that \(U\) is upper triangular with 1 's on the diagonal and \(A=L U .\) (This exercise illustrates a column version of Gaussian elimination.
The exact solution of the system \\[ \begin{array}{r} 0.6000 x_{1}+2000 x_{2}=2003 \\ 0.3076 x_{1}-0.4010 x_{2}=1.137 \end{array} \\] is \(\mathbf{x}=(5,1)^{T} .\) Suppose that the calculated value of \(\mathbf{x}_{2}\) is \(x_{2}^{\prime}=1+\epsilon .\) Use this value in the first equation and solve for \(x_{1}\). What will the error be? Calculate the relative error in \(x_{1}\) if \(\epsilon=0.001\)
Let \\[ A=\left(\begin{array}{rrr} 3 & 3 & -2 \\ 1 & 1 & 1 \\ 1 & -5 & 1 \\ 5 & -1 & 2 \end{array}\right) \\] (a) Determine the scalar \(\beta\) and vector \(\mathbf{v}\) for the Householder matrix \(H=I-(1 / \beta) \mathbf{v v}^{T}\) that zeroes out the last three entries of \(\mathbf{a}_{1}\) (b) Without explicitly forming the matrix \(H, \mathrm{com}\) pute the product \(H A\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.