Gauss-Jordan elimination is Gaussian elimination carried one stage further: every pivot is scaled to and every entry above it is cleared too. At the end each row says "this unknown equals this number", so no back substitution is needed.
| Step | On | |
|---|---|---|
| 1 | Reduce to echelon form. The forward pass of Gaussian elimination: clear below each pivot. | |
| 2 | Scale each pivot row so the pivot is 1. Divide the whole row, constant included, by its pivot.Elementary row operations ↗ | : |
| 3 | Clear above each pivot, starting from the bottom one. Use the pivot row to make every entry above the pivot zero. Working bottom-up keeps the zeros you have already made.Elementary row operations ↗ | , then |
| 4 | Read the solution. Each pivot row gives one unknown. A column without a pivot is a free variable. | : |