|
Gauss-Jordan Elimination is a variant of Gaussian Elimination. Again, we are transforming the coefficient matrix into another matrix that is much easier to solve, and the system represented by the new augmented matrix has the same solution set as the original system of linear equations. In Gauss-Jordan Elimination, the goal is to transform the coefficient matrix into a diagonal matrix, and the zeros are introduced into the matrix one column at a time. We work to eliminate the elements both above and below the diagonal element of a given column in one pass through the matrix. The general procedure for Gauss-Jordan Elimination can be summarized in the following steps:
An Example.We will apply Gauss-Jordan Elimination to the same example that was used to demonstrate Gaussian Elimination. Remember, in Gauss-Jordan Elimination we want to introduce zeros both below and above the diagonal.
As before, we use the symbol
At this point we have a diagonal coefficient matrix. The final step in Gauss-Jordan Elimination is to make each diagonal element equal to one. To do this, we divide each row of the augmented matrix by the diagonal element in that row.
![]() Hence, Our solution is simply the right-hand side of the augmented matrix. Notice that the coefficient matrix is now a diagonal matrix with ones on the diagonal. This is a special matrix called the identity matrix. When performing calculations by hand, many individuals choose Gauss-Jordan Elimination over Gaussian Elimination because it avoids the need for back substitution. However, we will show later that Gauss-Jordan elimination involves slightly more work than does Gaussian elimination, and thus it is not the method of choice for solving systems of linear equations on a computer. |
Send comments on material to Cynthia Lanius
These pages are maintained by Hilena
Vargas (hvargas@rice.edu)
Updated: February 26, 2001
Copyright © 2001 Richard Tapia and Cynthia Lanius