-
Notifications
You must be signed in to change notification settings - Fork 28
Open
Labels
Description
I'm going to quibble about your presentation of the Gauss-Jordan elimination algorithm, in particular, Activity 1.2.14
https://library.tbil.org/2025/linear-algebra/LE2.html#LE2-4-14 and the video.
Your algorithm focuses on the pivot columns and produces 0's below and above the pivot position before moving on to the next column. The more traditional algorithm produces 0's below the pivot position only and then goes to the next column, which breaks the algorithm into two phases: forward substitution and back substitution. I see this as preferable for the following reasons:
- It reduces flops and is how computers implement the algorithm. I realize that you're doing this "by hand" but a "flop" in this case represents student effort and the potential for mistakes (and this type of mental arithmetic already leads to lots of mistakes).
- The upper triangular form obtained from forward substitution with less effort reveals a great deal about the matrix, namely its rank, a basis for the column space, the determinant, and more. We often don't care about the full RREF.
- Your implementation will not produce an LU factorization whereas LU is a natural byproduct of the traditional algorithm.
- Pedagogically, this also allows for better scaffolding and motivation. Clearly, a diagonal system is the easiest. Starting with an upper triangular system, we can work right to left to get a diagonal system so it turns out that's pretty easy too. So how can we get a general system into an upper triangular form? Implement the forward substitution pass.
#teamforwardsubstitution
StevenClontz