Gauss-Jordan Reduction of Linear Equations
(An interactive exploration, step by step.)

The system of equations
can be represented in matrix form:
A * X = B
The X symbolizes the column vector [x1 x2]T, which is multiplied by each row-vector in A to give the column B vector The "T" signifies a transposed matrix. The companion program (above button) can generate them. [B1 B2]T or [1.7 2.8]T.

The equations can now be solved by matrix-multiplication. Gauss-Jordan reduction, to the left, gives the inverse A-1: (Try it; multiply its rows by the columns of the A matrix above.

You will get I, the identity matrix.)

*?
Multiply B = [1.7 2.8]T by this inverse to solve the equations:
(A-1) A X = X = A-1 B:
and specifically,


   . Then triangularize" and solve the matrix

 Set Rank=2      Rank 4      Rank 5      Rank 6