Row echelon form

Row echelon form

In linear algebra a matrix is in row echelon form if
* All nonzero rows are above any rows of all zeroes, and
* The leading coefficient of a row is always strictly to the right of the leading coefficient of the row above it.

This is the definition used in this article, but some texts add a third condition:
* The leading coefficient of each nonzero row is one. [See, for instance, Larson and Hostetler, "Precalculus", 7th edition.]

A matrix is in reduced row echelon form (also called row canonical form) if it satisfies the above three conditions, and if, in addition
* Every leading coefficient is the only nonzero entry in its column.

The first non-zero entry in each row is called a pivot.

Examples

This matrix is in reduced row echelon form:

:egin{bmatrix}0 & 1 & 4 & 0 & 0 \0 & 0 & 0 & 1 & 0 \0 & 0 & 0 & 0 & 1 \0 & 0 & 0 & 0 & 0 \end{bmatrix}

The following matrix is also in row echelon form, but not in reduced row form:

:egin{bmatrix}1 & 1 & 1 & 1 \0 & 9 & 0 & 2 \0 & 0 & 0 & 3 \end{bmatrix}

However, this matrix is not in row echelon form, as the leading coefficient of row 3 is not strictly to the right of the leading coefficient of row 2.

:egin{bmatrix}1 & 2 & 3 & 4 \0 & 3 & 7 & 2 \0 & 2 & 0 & 0 \end{bmatrix}

Non-uniqueness

Every non-zero matrix can be reduced to an infinite number of echelon forms (they can all be multiples of each other, for example) via elementary matrix transformations. However, all matrices and their row echelon forms correspond to exactly one matrix in reduced row echelon form.

Systems of linear equations

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 equations is said to be in "reduced row echelon form" or "canonical form" if its "augmented matrix" is in "reduced row echelon form".

Pseudocode

The following pseudocode converts a matrix to reduced row-echelon form:

ToReducedRowEchelonForm(Matrix M) Let "lead" = 0 Let "rowCount" be the number of rows in M Let "columnCount" be the number of columns in M FOR "r" = 0 to "rowCount" - 1 IF "columnCount" <= "lead" STOP END IF Let "i" = "r" WHILE M ["i", "lead"] = 0 Increment "i" IF "rowCount" = "i" Let "i" = "r" Increment "lead" IF "columnCount" = "lead" STOP END IF END IF END WHILE Swap rows "i" and "r" Divide row "r" by M ["r", "lead"] FOR all rows "i", from 0 to number of rows, every row except "r" Subtract M [i, lead] multiplied by row "r" from row "i" END FOR Increment "lead" END FOR END ToReducedRowEchelonForm

ee also

*Gaussian elimination
*Gauss–Jordan elimination

Notes


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Echelon — * ECHELON is an intelligence gathering network run by an international alliance of signals intelligence organizations known as UKUSA * The Echelon is the street publicity team of the band 30 Seconds to Mars, and also the name of a song on their… …   Wikipedia

  • Row equivalence — In linear algebra, two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations. Alternatively, two m times; n matrices are row equivalent if and only if they have the same row space. The concept… …   Wikipedia

  • Row space — In linear algebra, the row space of a matrix is the set of all possible linear combinations of its row vectors. The row space of an m times; n matrix is a subspace of n dimensional Euclidean space. The dimension of the row space is called the… …   Wikipedia

  • Euclidean subspace — In linear algebra, an Euclidean subspace (or subspace of R n ) is a set of vectors that is closed under addition and scalar multiplication. Geometrically, a subspace is a flat in n dimensional Euclidean space that passes through the origin.… …   Wikipedia

  • Gaussian elimination — In linear algebra, Gaussian elimination is an algorithm for solving systems of linear equations. It can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square… …   Wikipedia

  • Rank (linear algebra) — The column rank of a matrix A is the maximum number of linearly independent column vectors of A. The row rank of a matrix A is the maximum number of linearly independent row vectors of A. Equivalently, the column rank of A is the dimension of the …   Wikipedia

  • Column space — The column vectors of a matrix. In linear algebra, the column space of a matrix (sometimes called the range of a matrix) is the set of all possible linear combinations of its column vectors. The column space of an m × n matrix is a… …   Wikipedia

  • Kernel (matrix) — In linear algebra, the kernel or null space (also nullspace) of a matrix A is the set of all vectors x for which Ax = 0. The kernel of a matrix with n columns is a linear subspace of n dimensional Euclidean space.[1] The dimension… …   Wikipedia

  • Gauss–Jordan elimination — In linear algebra, Gauss–Jordan elimination is a version of Gaussian elimination that puts zeros both above and below each pivot element as it goes from the top row of the given matrix to the bottom. In other words, Gauss Jordan elimination… …   Wikipedia

  • System of linear equations — In mathematics, a system of linear equations (or linear system) is a collection of linear equations involving the same set of variables. For example,:egin{alignat}{7}3x ; + ; 2y ; ; z ; = ; 1 2x ; ; 2y ; + ; 4z ; = ; 2 x ; + ; frac{1}{2} y ; ; z …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”