A matrix being in row echelon form means that Gaussian elimination has operated on the rows, and column echelon form means that Gaussian elimination has operated on the columns. In other words, a matrix is in column echelon form if its transpose is in row echelon form. Therefore, only row echelon forms are considered in the remainder of this article. The similar properties of column echelon form are easily deduced by transposing all the matrices. Specifically, a matrix is in row echelon form if
Some texts add the condition that the leading coefficient must be 1.
These two conditions imply that all entries in a column below a leading coefficient are zeros.
The following is an example of a 3×5 matrix in row echelon form, which is not in reduced row echelon form (see below):
A matrix is in reduced row echelon form (also called row canonical form) if it satisfies the following conditions:
The reduced row echelon form of a matrix may be computed by Gauss–Jordan elimination. Unlike the row echelon form, the reduced row echelon form of a matrix is unique and does not depend on the algorithm used to compute it. For a given matrix, despite the row echelon form not being unique, all row echelon forms and the reduced row echelon form have the same number of zero rows and the pivots are located in the same indices.
This is an example of a matrix in reduced row echelon form, which shows that the left part of the matrix is not always an identity matrix:
For matrices with integer coefficients, the Hermite normal form is a row echelon form that may be calculated using Euclidean division and without introducing any rational number or denominator. On the other hand, the reduced echelon form of a matrix with integer coefficients generally contains non-integer coefficients.
By means of a finite sequence of elementary row operations, called Gaussian elimination, any matrix can be transformed to row echelon form. Since elementary row operations preserve the row space of the matrix, the row space of the row echelon form is the same as that of the original matrix.
The resulting echelon form is not unique; any matrix that is in echelon form can be put in an (equivalent) echelon form by adding a scalar multiple of a row to one of the above rows, for example:
However, every matrix has a unique reduced row echelon form. In the above example, the reduced row echelon form can be found as
This means that the nonzero rows of the reduced row echelon form are the unique reduced row echelon generating set for the row space of the original matrix.
A system of linear equations is said to be in row echelon form if its augmented matrix is in row echelon form. Similarly, a system of linear equations is said to be in reduced row echelon form or in canonical form if its augmented matrix is in reduced row echelon form.
The canonical form may be viewed as an explicit solution of the linear system. In fact, the system is inconsistent if and only if one of the equations of the canonical form is reduced to 0 = 1. Otherwise, regrouping in the right hand side all the terms of the equations but the leading ones, expresses the variables corresponding to the pivots as constants or linear functions of the other variables, if any.
The following pseudocode converts a matrix into a reduced row echelon form:
function ToReducedRowEchelonForm(Matrix M) is lead := 0 rowCount := the number of rows in M columnCount := the number of columns in M for 0 ≤ r < rowCount do if columnCount ≤ lead then stop function end if i = r while M[i, lead] = 0 do i = i + 1 if rowCount = i then i = r lead = lead + 1 if columnCount = lead then stop function end if end if end while if i ≠ r then Swap rows i and r Divide row r by M[r, lead] for 0 ≤ i < rowCount do if i ≠ r do Subtract M[i, lead] multiplied by row r from row i end if end for lead = lead + 1 end for end function
The following pseudocode converts the matrix to a row echelon form (not abbreviated):
function ToRowEchelonForm(Matrix M) is nr := number of rows in M nc := number of columns in M for 0 ≤ r < nr do allZeros := true for 0 ≤ c < nc do if M[r, c] != 0 then allZeros := false exit for end if end for if allZeros = true then In M, swap row r with row nr nr := nr - 1 end if end for p := 0 while p < nr and p < nc do label nextPivot: r := 1 while M[p, p] = 0 do if (p + r) <= nr then p := p + 1 goto nextPivot end if In M, swap row p with row (p + r) r := r + 1 end while for 1 ≤ r < (nr - p) do if M[p + r, p] != 0 then x := -M[p + r, p] / M[p, p] for p ≤ c < nc do M[p + r, c] := M[p , c] * x + M[p + r, c] end for end if end for p := p + 1 end while end function
|The Wikibook Linear Algebra has a page on the topic of: Row Reduction and Echelon Forms|