Skip to content

2.3-exam1-2005-strang

Quiz 1, 2005 (strang) · Section 2.3: Matrix Computations and A = LU Source: exam1_1.pdf, pp. 146, 151

Problem

3 (40 pts.) (a) Reduce \(A\) to an upper triangular matrix \(U\) and carry out the same elimination steps on the right side \(b\):

\[ \left[ \begin{array}{cccc} 3 & 3 & 1 & b_1 \\ 3 & 5 & 1 & b_2 \\ -3 & 3 & 2 & b_3 \end{array} \right] \longrightarrow \left[ \begin{array}{cc} U & c \end{array} \right] \]

Factor the 3 by 3 matrix \(A\) into \(LU = \text{(lower triangular)(upper triangular)}\).

(b) If you change the last entry in \(A\) from 2 to __ (what number gives \(A_{\text{new}}\)?) then \(A_{\text{new}}\) becomes singular. Describe its column space exactly.

(c) In that singular case from part (b), what condition(s) on \(b_1, b_2, b_3\) allow the system \(A_{\text{new}}x = b\) to be solved?

(d) Write down the complete solution to \(A_{\text{new}}x = \left[ \begin{array}{c} 3 \\ 3 \\ -3 \end{array} \right]\) (the first column).

Solution (a) \[ \left[ \begin{array}{cccc} 3 & 3 & 1 & b_1 \\ 3 & 5 & 1 & b_2 \\ -3 & 3 & 2 & b_3 \end{array} \right] \longrightarrow \left[ \begin{array}{cc} U & c \end{array} \right] = \left[ \begin{array}{cccc} 3 & 3 & 1 & b_1 \\ 0 & 2 & 0 & b_2 - b_1 \\ 0 & 0 & 3 & b_3 - 3b_2 + 4b_1 \end{array} \right]. \] Here \[ A = \left[ \begin{array}{ccc} 3 & 3 & 1 \\ 3 & 5 & 1 \\ -3 & 3 & 2 \end{array} \right] = LU = \left[ \begin{array}{ccc} 1 & 0 & 0 \\ 1 & 1 & 0 \\ -1 & 3 & 1 \end{array} \right] \left[ \begin{array}{ccc} 3 & 3 & 1 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{array} \right]. \] (b) If you change \(A_{33}\) from 2 to \(-1\), the third pivot is reduced by 3 and \(A_{\text{new}}\) becomes singular. Its column space is the *plane in \(\mathbb{R}^3\)* containing all combinations of the first two columns \((3, 3, -3)\) and \((3, 5, 3)\). (c) We need \(b_3 - 3b_2 + 4b_1 = 0\) on the right side (since the left side is now a row of zeros). (d) \(A_{\text{new}}\) gives \[ \begin{bmatrix} 3 & 3 & 1 & 3 \\ 3 & 5 & 1 & 3 \\ -3 & 3 & -1 & -3 \end{bmatrix} \to \begin{bmatrix} 3 & 3 & 1 & 3 \\ 0 & 2 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{bmatrix}. \] Certainly \(x_{\text{particular}} = \begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix}\). Also \(x_{\text{nullspace}} = x_3 \begin{bmatrix} 1 \\ 0 \\ -3 \end{bmatrix}\). The complete solution is \(x_{\text{particular}} +\) any vector in the nullspace.

Keywords: LU factorization, elimination, singular matrix, column space, complete solution