SYSTEM OF LINEAR EQUATION
USING GAUSS JORDAN ELIMINATION
GAUSS JORDAN ELIMINATION
• Gauss-Jordan Elimination is an algorithm that can be used to solve systems of linear
equations and to find the inverse of any invertible matrix. It relies upon three elementary
row operations one can use on a matrix:
1. Swap the positions of two of the rows
2. Multiply one of the rows by a nonzero scalar.
3. Add or subtract the scalar multiple of one row to another row.
GAUSS JORDAN ELIMINATION
Reduced-row echelon form
The purpose of Gauss-Jordan Elimination is to use the three elementary row operations
to convert a matrix into reduced-row echelon form. A matrix is in reduced-row echelon
form, also known as row canonical form, if the following conditions are satisfied:
1. All rows with only zero entries are at the bottom of the matrix
2. The first nonzero entry in a row, called the leading entry or the pivot, of each nonzero row is
to the right of the leading entry of the row above it.
3. The leading entry, also known as the pivot, in any nonzero row is 1.
4. All other entries in the column containing a leading 1 are zeroes.
GAUSS JORDAN ELIMINATION
Matrices A and B are in reduced-row echelon form, but matrices C and D are not. C is not in
reduced-row echelon form because it violates conditions two and three. D is not in reduced-
row echelon form because it violates condition four. In addition, the elementary row
operations can be used to reduce matrix D into matrix B.
GAUSS JORDAN ELIMINATION
Steps for Gauss-Jordan Elimination
1. Swap the rows so that all rows with all zero entries are on the bottom
2. Swap the rows so that the row with the largest, leftmost nonzero entry is on top.
3. Multiply the top row by a scalar so that top row's leading entry becomes 1.
4. Add/subtract multiples of the top row to the other rows so that all other entries in the column
containing the top row's leading entry are all zero.
5. Repeat steps 2-4 for the next leftmost nonzero entry until all the leading entries are 1.
6. Swap the rows so that the leading entry of each nonzero row is to the right of the leading entry of
the row above it.
GAUSS JORDAN ELIMINATION
EXAMPLE
Solve the following equation using Gauss-Jordan Elimination
GAUSS JORDAN ELIMINATION
The augmented matrix of the example is
• Since the matrix satisfy the first 3 steps of gauss Jordan elimination we can now proceed
to step 4
GAUSS JORDAN ELIMINATION
• (Add/subtract multiples of the top row to the other rows so that all other entries in the
column containing the top row's leading entry are all zero.)
• Multiply R1 by 2, then subract it form R2
• 2-(2x2)=0 3-(1x2)= 1 5-(1x2)=3 8-(5x2)=-2
GAUSS JORDAN ELIMINATION
• (Add/subtract multiples of the top row to the other rows so that all other entries in the
column containing the top row's leading entry are all zero.)
• Multiply Row 1 by 4, then subtract to R3
• 4-(1x4)=0 0-(1x4)=-4 5-(1X4)=1 2-(4X5)=-18
GAUSS JORDAN ELIMINATION
• (Add/subtract multiples of the top row to the other rows so that all other entries in the
column containing the top row's leading entry are all zero.)
• Multiply Row 2 by 4, then add to R3
GAUSS JORDAN ELIMINATION
• Divide Row 3 by 13
• Multiply R3 by 3, then subract to R2
GAUSS JORDAN ELIMINATION
• Subtract R3 from R1
• Subtract R2 from R1
GAUSS JORDAN ELIMINATION
• From this final matrix we can now obtain the answer in the equation
• X = 3, Y = 4, Z = -2