Method of Elimination

Linear systems are solved by the Matrix-powered method of elimination.

\left{\begin{matrix} x + 2y + z = 2 \\ 3x+8y+z=12 \\ 4y+z=2 \end{matrix}\right} =================== \underbrace{ \begin{bmatrix} 1&2&1 \\ 3&8&1 \\ 0&4&1 \end{bmatrix} ============= \begin{bmatrix} 2 \\ 12 \\ 2 \end{bmatrix} }\_{ \text{Initial Matrix }Ax = b } \rightarrow \underbrace{ \begin{bmatrix} \boxed{1}& 2& 1 \\ 0&\boxed{2}& -2 \\ 0&0&\boxed{5} \end{bmatrix} ============= \begin{bmatrix} 2 \\ 6 \\ -10 \end{bmatrix} }\_{ \text{Eliminated Matrix }Ux = c } \implies \underbrace{ \left{\begin{matrix} x + 2y+ z = 2\\ 2y-2z=6 \\ 5z=-10 \end{matrix}\right} }\_{ \text{Can easily be solved now} }

With being pivots that cannot equal 0. If there is a zero-pivot, exchanging rows can fix the problem. Complete failure arises when a pivot cannot be altered to not be 0. Then the matrix is uninvertible.

Elimination Matrices

Store the elimination steps that have been taken to solve the system.

Matrix takes \left\[ 1, 0, 0 \right] rows from , hence one time the first row and zero times the others to produce the first row of the eliminated Matrix . It has no change on the row. The second row of subtracts times the first row from the second row of the matrix, eliminating the item at position with that.

To change we need to have two eliminations , that take care of row 2 and 3.

Important Properties

  • Elimination does not change the Row Space of a matrix because it is just taking linear combinations of rows, staying in the same subspace.