Chapter 7: Problem 14
Let \(R\) be an \(n \times n\) plane rotation. What is the value of \(\operatorname{det}(R) ?\) Show that \(R\) is not an elementary orthogonal matrix.
/*! 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 14
Let \(R\) be an \(n \times n\) plane rotation. What is the value of \(\operatorname{det}(R) ?\) Show that \(R\) is not an elementary orthogonal matrix.
All the tools & learning materials you need for study success - in one app.
Get started for free
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.
If \(A\) is a symmetric \(n \times n\) matrix with triangular factorization \(L U\), then \(A\) can be factored further into a product \(L D L^{T}\) (where \(D\) is diagonal). Devise an algorithm, similar to Algorithm \(7.2 .2,\) for solving \(L D L^{T} \mathbf{x}=\mathbf{b}\)
Let \(A\) be the matrix in Exercise \(1 .\) Use the \(L U\) factorization of \(A\) to solve \(A \mathbf{x}=\mathbf{b}\) for each of the following choices of \(\mathbf{b}\) (a) \((4,3,-13)^{T}\) (b) \((3,1,-10)^{T}\) (c) \((7,23,0)^{T}\)
Suppose that \(A^{-1}\) and the \(L U\) factorization of \(A\) have already been determined. How many scalar additions and multiplications are necessary to compute \(A^{-1} \mathbf{b} ?\) Compare this number with the number of operations required to solve \(L U \mathbf{x}=\mathbf{b}\) using \(\mathrm{Al}\) gorithm \(7.2 .2 .\) Suppose that we have a number of systems to solve with the same coefficient matrix \(A .\) Is it worthwhile to compute \(A^{-1} ?\) Explain.
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.