… a process with which we solve systems of equations.
The familliar basic process:
e.g.:
We can solve it using gaussian elimination by hand, by eliminating variables, until only one is left:
Now we can solve for :
For :
And for :
Gaussian elimination with matrices
Representing systems of equations as matrices is how every computer solves them.
e.g. continuing with the example from the introduction, we can pull out the coefficients into a matrix:
Now again, we want to eliminate variables from the equation.
is our first so called pivot. We want to knock out from the second equation / row by subtracting times the first row:
We apply the same operations to the vector , which we carry along with us in the augmented matrix.
Step is done and there’s nothing to do in step as is already .
Now clearing out (subtracting times the newly obtained second from the third row):
We now have an upper triangular matrix , with three pivot columns along the main diagonal. And we have a new vector after the elimination.
The determinant of this matrix would be the product of the main diagonal.
Now we do “back-substitution” of the values into a system of equations:
And solve the S.O.E. in reverse order:
The steps we took can be expressed as multiplying with some elimination matrix :
References
Gilbert Strang OCW lecture Lecture 2: Elimination with matrices