MAT307 Numerical Analysis Gaussian Elimination

Gauss-Jordan Elimination

MAT307 Numerical Analysis

Gaussian and Gauss-Jordan Eliminations

Dr. Mustafa Ağgül

mustafaaggul@hacettepe.edu.tr

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
Consider the following linear system:
2x1 + x2 − x3 + 2x4 = 5,
4x1 + 5x2 − 3x3 + 6x4 = 9,
−2x1 + 5x2 − 2x3 + 6x4 = 4,
4x1 + 11x2 − 4x3 + 8x4 = 2.

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
We first write the system of linear equations as an augmented matrix
 
2 1 −1 2 5
 
h i  4 5 −3 6 9 
b = .
 
A
 −2 5 −2 6 4 
 
4 11 −4 8 2

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
Then, we put the matrix into row-echelon form
   
2 1 −1 2 5 R2 −2R1 2 1 −1 2 5
 −−−−−→ 
  
 4 5 −3 6 9 
 R3 +R1  0 3 −1 2 −1  R −2R
 −−−−−→   −−3−−−→
2
 

 −2 5 −2 6 4  −3
−2R1  0 6 8 9  R4 −3R2
 
  −R−4−−−→ −−−−−→
4 11 −4 8 2 0 9 −2 4 −8

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
Then, we put the matrix into row-echelon form
   
2 1 −1 2 5 2 1 −1 2 5
   
 0 3 −1 2 −1   0 3 −1 2 −1 
.
   
  
 0 0 −1 4 11  R4 +R3 
 0 0 −1 4 11 
 −−−−−→  
0 0 1 −2 −5 0 0 0 2 6

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
An equivalent system to the original linear system can be found as
2x1 + x2 − x3 + 2x4 = 5,
3x2 − x3 + 2x4 = −1,
−x3 + 4x4 = 11,
2x4 = 6.

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gaussian elimination is a method for solving a system of linear equations.

The main idea is to apply successive elementary row operations to the
augmented matrix to obtain its row equivalent echelon form. Then, using
back substitution, we can find each unknown.
Example
Using back substitution, the solution to the system can be found:
x4 = 3,
x3 = 1,
x2 = −2,
x1 = 1.

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
Consider the following linear system:
x1 + 2x2 − 3x3 − x4 = 0,
−3x2 + 2x3 + 6x4 = −8,
−3x1 − x2 + 3x3 + x4 = 0,
2x1 + 3x2 + 2x3 − x4 = −8.

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
We first write the system of linear equations as an augmented matrix
 
1 2 −3 −1 0
 
h i  0 −3 2 6 −8 
b = .
 
A
 −3 −1 3 1 0 
 
2 3 2 −1 −8

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
We first write the system of linear equations as an augmented matrix
   
1 2 −3 −1 0 1 2 −3 −1 0
   
 0 −3 −8 
2 6  R3 +3R1  0 −3 2 6 −8 

−R
4
 −−−−−→   −−−→
 

 −3 −1 3 1 0  R4 −2R1  0
  5 −6 −2 0  R2 ↔R4

 −−−−−→ −−−−−→
2 3 2 −1 −8 0 −1 8 1 −8

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
We first write the system of linear equations as an augmented matrix
   
1 2 −3 −1 0 −2R2 1 0 13 1 −16
  −R−1−−−→  
 0 1 −8 −1 8  R3 −5R2 

 0 1 −8 −1 8  1 R3
 −−−−−→   −34
−−→
 

 0 5 −6 −2 0  R4 +3R2 
 0 0 34 3 −40  1 R
 − 22 4
 −−−−−→  −−−−−→
0 −3 2 6 −8 0 0 −22 3 16

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
We first write the system of linear equations as an augmented matrix
   
5
1 0 13 1 −16 1 0 0 − 34 − 12
  −R−1−−13R
−−−→ 3
 17

5
 0 1 −8 −1 8  R2 +8R3 

 0 1 0 − 17 − 24 
17 
 −−−−−→ 

 3 20  3

 0 0 1 34
− 17  R4 −R3  0 0 1 34
− 20 
17 
−187
R4
 −−−−−→  −−42
−−−→
3 8 42 84
0 0 1 − 22 − 11 0 0 0 − 187 187

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
We first write the system of linear equations as an augmented matrix
   
5
1 0 0 − 34 − 12
17 R1 + 5 R4 1 0 0 0 −1
  −−−−34−−→  
5
 0 1 0
 − 17 − 24
17
 5 R
 R2 + 17 4 
 0 1 0 0 −2 

 3
 −−−−−−→  
 0 0 1
34
− 20
17
 3 R
 R3 − 34
 0 0 1 0 −1 
 4  
−−−−−−→
0 0 0 1 −2 0 0 0 1 −2

Dr. Mustafa Ağgül Hacettepe University

 MAT307 Numerical Analysis Gaussian Elimination
Gauss-Jordan Elimination

Gauss-Jordan elimination is also a method for solving a system of linear

equations. The main idea is to apply successive elementary row
operations to the augmented matrix to obtain its row reduced echelon
form. Then, using back substitution, we can find each unknown.

Example
Using back substitution, the solution to the system can be found:
x4 = −2,
x3 = −1,
x2 = −2,
x1 = −1.

Dr. Mustafa Ağgül Hacettepe University