This MedLibrary.org supplementary page on Gauss-Jordan elimination is provided directly from the open source Wikipedia as a service to our readers. Please see the note below on authorship of this content, as well as the Wikipedia usage guidelines. To search for other content from our encyclopedia supplement, please use the form below:
Related Sponsors
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 brings a matrix to reduced row echelon form, whereas Gaussian elimination takes it only as far as row echelon form. Every matrix has a reduced row echelon form, and this algorithm is guaranteed to produce it.
Gauss–Jordan elimination is considerably less efficient than Gaussian elimination with backsubstitution when solving a system of linear equations. However, it is well suited for calculating the matrix inverse.
It is named in honor of Carl Friedrich Gauss and Wilhelm Jordan.
Application to finding inverses
If Gauss–Jordan elimination is applied on a square matrix, it can be used to calculate the matrix's inverse. This can be done by augmenting the square matrix with the identity matrix of the same dimensions, and through the following matrix operations:
![[ A I ] \Longrightarrow
A^{-1} [ A I ] \Longrightarrow
[ I A^{-1} ].](http://upload.wikimedia.org/math/6/e/9/6e91cc5ed5557ae6465772f2cb304853.png)
If the original square matrix, A, is given by the following expression:
Then, after augmenting by the identity, the following is obtained:
![[ A I ] =
\begin{bmatrix}
2 & -1 & 0 & 1 & 0 & 0\\
-1 & 2 & -1 & 0 & 1 & 0\\
0 & -1 & 2 & 0 & 0 & 1
\end{bmatrix}.](http://upload.wikimedia.org/math/e/a/6/ea66fd6076141f91f2cefd5216476dc3.png)
By performing elementary row operations on the AI matrix until A reaches reduced row echelon form, the following is the final result:
![[ I A^{-1} ] =
\begin{bmatrix}
1 & 0 & 0 & \frac{3}{4} & \frac{1}{2} & \frac{1}{4}\\
0 & 1 & 0 & \frac{1}{2} & 1 & \frac{1}{2}\\
0 & 0 & 1 & \frac{1}{4} & \frac{1}{2} & \frac{3}{4}
\end{bmatrix}.](http://upload.wikimedia.org/math/c/1/f/c1f426136c1c5a58f57b5e2b66060f05.png)
The matrix augmentation can now be undone, which gives the following:
A matrix is non-singular (meaning that it has an inverse matrix) iff the identity matrix can be obtained using only elementary row operations.
References
- Lipschutz, Seymour, and Lipson, Mark. "Schaum's Outlines: Linear Algebra". Tata McGraw-hill edition. Delhi 2001. pp. 69-80.
- Strang, Gilbert (2003). Introduction to Linear Algebra (3rd edition ed.). Wellesley, Massachusetts: Wellesley-Cambridge Press. pp. 74–76.
External links
- Algorithm for Gauss-Jordan elimination in Matlab
- Algorithm for Gauss-Jordan elimination in Python
- An online tool solve nxm linear systems using Gauss-Jordan elimination (source-code and mobile version included), by Felipe Santos de Andrade (Spanish)
- Algorithm for Gauss-Jordan elimination in Basic
- Module for Gauss-Jordan Elimination
- Example of Gauss-Jordan Elimination "Step-by-Step"
Wikipedia content modification information:
- This page was last modified on 15 December 2008, at 19:39.
Wikipedia Authorship and Review
Wikipedia content provided here is not reviewed directly by MedLibrary.org. Wikipedia content is authored by an open community of volunteers and is not produced by or in any way affiliated with MedLibrary.org.
Wikipedia Usage Guidelines
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article on "Gauss-Jordan elimination".
The URL for this specific entry is:
All Wikipedia text is available under the terms of the GNU Free Documentation License. (See Copyrights for details). Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.