GaussianElimination[F](A) makes a copy of the Matrix A and reduces it to row echelon form (upper triangular form) with leading ones.

ReducedRowEchelonForm[F](A) makes a copy of the Matrix A and reduces it to reduced row echelon form.

RREF is an abbreviation for ReducedRowEchelonForm

The (indexed) parameter F, which specifies the domain of computation, a field, must be a Maple table/module which has the following values/exports:

F[`0`]: a constant for the zero of the ring F

F[`1`]: a constant for the (multiplicative) identity of F

F[`+`]: a procedure for adding elements of F (nary)

F[`-`]: a procedure for negating and subtracting elements of F (unary and binary)

F[`*`]: a procedure for multiplying two elements of F (commutative)

F[`/`]: a procedure for dividing two elements of F

F[`=`]: a boolean procedure for testing if two elements in F are equal

ReducedRowEchelonForm can use either Gaussian Elimination or the Bareiss algorithm to reduce the system to triangular form. If the Bareiss algorithm is used, the leading entries of each row are normalized to one and back substitution is performed, which avoids normalizing entries which are eliminated during back substitution.

The Bareiss algorithm requires the field to support exact division, i.e., it requires F to be an integral domain with the following operation:

F[Divide]: a boolean procedure for dividing two elements of F where F[Divide](a,b,'q') outputs true if b | a and optionally assigns q the quotient such that a = b q.

If the method is not given and the operation F[Divide] is defined, then the Bareiss algorithm is used, otherwise Gaussian Elimination is used.