Skip to content

2.3-exam1-1997

Hour Exam I, 1997 · Section 2.3: Matrix Computations and A = LU Source: exam1_1.pdf, pp. 2-4

Problem

1. Let \(A = \begin{bmatrix} 1 & 2 & 3 \\ 2 & 4 & 7 \\ 3 & 6 & 10 \\ 3 & 6 & 10 \end{bmatrix}\).

(1a) (16 points) Give an LU-factorization of \(A\).

(1b) (8 points) Give a basis for the column space of \(A\).

(1c) (8 points) Give a basis for the nullspace of \(A\).

(1d) (8 points) Give the complete solution to \(Ax = \begin{bmatrix} 3 \\ 4 \\ 7 \\ 7 \end{bmatrix}\). Recall that \(A = \begin{bmatrix} 1 & 2 & 3 \\ 2 & 4 & 7 \\ 3 & 6 & 10 \\ 3 & 6 & 10 \end{bmatrix}\).

Solution 1a. The LU-factorization is \(A = LU\) with \[ L = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 2 & 1 & 0 & 0 \\ 3 & 1 & 1 & 0 \\ 3 & 1 & 0 & 1 \end{bmatrix}, \qquad U = \begin{bmatrix} 1 & 2 & 3 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}. \] Elimination carries \(A\) to \(U\): \[ A = \begin{bmatrix} 1 & 2 & 3 \\ 2 & 4 & 7 \\ 3 & 6 & 10 \\ 3 & 6 & 10 \end{bmatrix} \to \begin{bmatrix} 1 & 2 & 3 \\ 0 & 0 & 1 \\ 0 & 0 & 1 \\ 0 & 0 & 1 \end{bmatrix} \to \begin{bmatrix} 1 & 2 & 3 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} = U, \] using the multipliers \(l_{21}\): row 2 \(- 2 \times\) row 1, \(l_{31}\): row 3 \(- 3 \times\) row 1, \(l_{41}\): row 4 \(- 3 \times\) row 1, \(l_{32}\): row 3 \(- 1 \times\) row 2, \(l_{42}\): row 4 \(- 1 \times\) row 2, giving \[ L = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 2 & 1 & 0 & 0 \\ 3 & 1 & 1 & 0 \\ 3 & 1 & 0 & 1 \end{bmatrix}. \] 1b. The pivot columns of \(A\) (columns 1 and 3) form a basis for the column space: \[ \begin{bmatrix} 1 \\ 2 \\ 3 \\ 3 \end{bmatrix}, \quad \begin{bmatrix} 3 \\ 7 \\ 10 \\ 10 \end{bmatrix}. \] 1c. The special solution to \(Ux = \begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \end{bmatrix}\) is \[ \begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}, \] which is a basis for the nullspace of \(A\). 1d. Eliminate the augmented matrix: \[ \underbrace{\begin{bmatrix} 1 & 2 & 3 & | & 3 \\ 2 & 4 & 7 & | & 4 \\ 3 & 6 & 10 & | & 7 \\ 3 & 6 & 10 & | & 7 \end{bmatrix}}_{Ax=b} \to \begin{bmatrix} 1 & 2 & 3 & | & 3 \\ 0 & 0 & 1 & | & -2 \\ 0 & 0 & 1 & | & -2 \\ 0 & 0 & 1 & | & -2 \end{bmatrix} \to \begin{bmatrix} 1 & 2 & 3 & | & 3 \\ 0 & 0 & 1 & | & -2 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 0 & | & 0 \end{bmatrix} \to \underbrace{\begin{bmatrix} 1 & 2 & 0 & | & 9 \\ 0 & 0 & 1 & | & -2 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 0 & | & 0 \end{bmatrix}}_{Rx=d}. \] The pivot variables are \(x_1\) and \(x_3\); the free variable is \(x_2\). A particular solution is \(x_{particular} = \begin{bmatrix} 9 \\ 0 \\ -2 \end{bmatrix}\), so the complete solution is the particular solution plus all linear combinations of the special solution(s): \[ x_{complete} = \begin{bmatrix} 9 \\ 0 \\ -2 \end{bmatrix} + x_2 \begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}. \]

Keywords: LU factorization, column space, nullspace, complete solution