Gaussian elimination is a powerful and widely-used method for solving systems of linear equations. It is used across many fields, from engineering to economics, for finding the values of variables that satisfy a system of equations. Whether you’re working with data science models, electrical circuits, or optimization problems, understanding this technique is crucial.
Row Echelon Form
For each row in a matrix, if the row does not consist of only zeros, then the leftmost nonzero entry is called the pivot of that row.
If two leading entries are in the same column, then a row replacement operation can be used to make one of those entries zero.
Then by using the row swapping operation, one can always order the rows so that for every non-zero row, the leading entry is to the right of the leading entry of the row above.
The following matrix is in echelon form
Reduced Row Echelon Form (RREF)
A matrix is said to be in reduced row echelon form if
- Leading entries are 1’s
- Leading 1’s are to the right of those above
- Rows with all zeroes are at the bottom
- Each leading 1’s must be the only non-zero entry in its column
Row Echelon Form Example
Suppose the goal is to find and describe the set of solutions to the following system of linear equations
Then it’s associated augmented matrix is
Applying and
Applying
Row Echelon Form Example
We will continue from the previous example
Applying
Applying and
Applying and
Therefore the solution is
Leave a comment