Reduced row echelon form (Gauss-Jordan elimination)
rank
, orth
, and null
are typically faster and more accurate for computing the rank and basis vectors of a
matrix.
mldivide
is recommended to solve linear systems.
rref
implements Gauss-Jordan elimination with partial pivoting. A
default tolerance of max(size(A))*eps*norm(A,inf)
tests for negligible
column elements that are zeroed-out to reduce roundoff error.