Can anyone recommend good software for verifying row reduction steps?

Question

I work as a tutor for linear algebra. Students will often have a problem that requires them to row reduce, and they'll make an arithmetic mistake somewhere. Often they'll ask for my help finding their mistake.

I often will go through the operations myself, but it takes a bit of time. Do you have any recommendations for an online app that can check each row operation? Ideally the app would:

• Display previous matrices, and the row operations that led to each.
• Allow you to "go back" if you made a mistake.

I've found a couple ones, like this one: https://www.zweigmedia.com/RealWorld/tutorialsf1/scriptpivotold.html. However, it doesn't print the previous versions of the matrix, and it doesn't let you "go back."

Answer 1

There was a nice app at this site by Dan Gries. Unfortunately it required Adobe/Flash.

You could set the matrix size and enter your data. Then the site provides you with three operations: swap two rows, add a multiple of a row to another, or multiply a row by a number. Just the basic elementary row operations. Student is expected to know the Gauss or Gauss-Jordan operation. So that one can perform the process while the app does the arithmetic. A life saver for linear algebra students and teachers, without giving away the final answer!

Edit:

The following apps are not Flash-based:

Pavel Solin, NClab. You need to register first then follow this link.

Michael Eisermann, Stuttgart University.

Answer 2

Not a software exactly, but super useful for those in the process of learning row reduction is the website: Linear Algebra Toolkit, by P. Bogacki. You just choose the number of rows and columns and it will produce the reduced row echelon form, and show each step along the way with the indicated row-op clearly stated. I've used this for years.

For example:

Answer 3

I do this with Mathematica. Remember that each row operation is left multiplication by an elementary matrix.

(* This is the number of rows of the matrix. *)
n = 5;

(* This is a matrix with 1 in position (i,j) and 0 everywhere else. *)
e[i_,j_]:=Table[If[{a,b}=={i,j}, 1, 0], {a,n}, {b,n}];

(* This switches rows i and j *)
switch[i_, j_] := IdentityMatrix[n] + e[i, j] + e[j, i] - e[i, i] - e[j, j];

(* This multiplies row i by t *)
mult[i_, t_] := IdentityMatrix[n] + (t - 1) e[i, i];

(* This adds u times row i to row j *)
add[i_, j_, u_] := IdentityMatrix[n] + u e[j, i];

Given a matrix M, I can do one step of row reduction with a computation like add[1,2,-3].M and can do nested steps by add[1,3,5].add[1,2,-3].M etcetera.

Of course, if you just want the final answer, that is RowReduce[M].