Reduction Algorithm

The following algorithm corrects the one in section 3.6 in the book:

1.

Start assuming that the pivot will be the coefficient of the first unknown in the first equation.

2.

If that coefficient is zero, look below the coefficient for one that is nonzero and swap equations to replace the zero coefficient with the nonzero one.

3.

If there are no nonzero coefficients below either, go to the next unknown, i.e. move one place to the right in the matrix and repeat the previous step. (If there are no more unknowns, you are done.)

4.

With the obtained nonzero pivot, create zeros below it.

5.

Go process the submatrix consisting of the remaining equations below the pivot and the remaining unknowns beyond the pivot in the same way.

What is wrong with the book: Step 1 in the book procedure is impossible if the first row is zero. Deleting equations or unknowns is a no-no with your instructor. And step 4 may not be possible since there may not be any equations left after step 3 following the book.