Skip to content

2.3-final-2011-strang

Final Exam, 2011 (strang) · Section 2.3: Matrix Computations and A = LU Source: finalexam_2.pdf, p. 48

Problem

1. (a) For this matrix \(A\), find the usual \(P\) (permutation) and \(L\) and \(U\) so that \(PA = LU\).

\[ A = \begin{bmatrix} 1 & 1 & 2 & 1 \\ 2 & 2 & 4 & 2 \\ 3 & 4 & 7 & 3 \end{bmatrix}. \]

(b) Find a basis for the nullspace of \(A\).

(c) The vector \((b_1, b_2, b_3)\) is in the column space of \(A\) provided it is orthogonal to ______ (give a numerical answer).

Solution (a) Row 2 is twice row 1, so elimination runs into a zero pivot in position (2, 2): the multiplier \(l_{21} = 2\) produces row 2 minus 2 (row 1) = \((0, 0, 0, 0)\). A row exchange is required: permute rows 2 and 3. Then \[ P = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \end{bmatrix}, \qquad L = \begin{bmatrix} 1 & 0 & 0 \\ 3 & 1 & 0 \\ 2 & 0 & 1 \end{bmatrix}, \qquad U = \begin{bmatrix} 1 & 1 & 2 & 1 \\ 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 \end{bmatrix}. \] Check: \(PA = \begin{bmatrix} 1 & 1 & 2 & 1 \\ 3 & 4 & 7 & 3 \\ 2 & 2 & 4 & 2 \end{bmatrix} = LU\). (b) The pivot columns are 1 and 3; the free variables are \(x_2\) and \(x_4\). From \(Ux = 0\): \(x_1 + x_2 + 2x_3 + x_4 = 0\) and \(x_2 + x_3 = 0\). Setting \((x_2, x_4) = (1, 0)\) gives \(x_3 = -1\), \(x_1 = 1\); setting \((x_2, x_4) = (0, 1)\) gives \(x_3 = 0\), \(x_1 = -1\). A basis for the nullspace is \[ \begin{bmatrix} 1 \\ 1 \\ -1 \\ 0 \end{bmatrix}, \quad \begin{bmatrix} -1 \\ 0 \\ 0 \\ 1 \end{bmatrix}. \] (c) \(b\) is in the column space exactly when it is orthogonal to every vector in the left nullspace \(N(A^T)\). Solving \(A^T y = 0\): \(y_1 + 2y_2 + 3y_3 = 0\), \(y_1 + 2y_2 + 4y_3 = 0\) give \(y_3 = 0\) and \(y_1 = -2y_2\), so \(N(A^T)\) is spanned by \((2, -1, 0)\). Therefore \((b_1, b_2, b_3)\) is in the column space of \(A\) provided it is orthogonal to \((2, -1, 0)\), i.e. \(2b_1 - b_2 = 0\).

Keywords: PA = LU, permutation matrix, nullspace basis, left nullspace