Gauss-Jordan Elimination Method

You might also like

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 21

Gauss-Jordan

Elimination Method
OBJECTIVES

In this section you will learn to


• Represent a system of linear equations as an
augmented matrix
• Solve the system using elementary row
operations.
Gauss-Jordan Elimination
Method
The Gauss Jordan Elimination, or Gaussian
Elimination, is an algorithm to solve a system of
linear equations by representing it as an augmented
matrix, reducing it using row operations, and
expressing the system in reduced row-echelon form
to find the values of the variables.
Gauss-Jordan Elimination
Method
G
• to represent a system of linear equations in an
augmented matrix form
O
• then performing the 3 row operations on it until
A
the reduced row echelon form (RREF) is
L achieved
S • Lastly, we can easily recognize the solutions
from the RREF
Example 1

2x + 3y = 7
x-y=4
Augmented Matrix
Example 1

AX=B, where A represented the coefficient matrix,


and B
the matrix of constant terms. As an augmented
matrix, we write the matrix as [AlB].
Row Operations on a Matrix

There are 3 elementary row operations that we can do on


matrices. It won’t change the solution of the system. They are:

• Interchange 2 rows.
• Multiply a row by a non-zero scalar.
• Add or subtract the scalar multiple of one row to another
row.
Reduced Row-Echelon Form
A matrix is said to be in reduced row echelon form, also known as row
canonical form, if the following 4 conditions are satisfied:

• Rows with zero entries (all elements of that row are 0s) are at the
matrix’s bottom.
• The leading entry (the first non-zero entry in a row) of each non-
zero row is to the right of the row’s leading entry directly above
it.
• The leading entry in any non-zero row is 1.
• All entries in the column containing the leading entry (1) are
zeroes
Example 2
Example 2
Example 2

we interchanged row
1 (R1) and row 2
(R2)
Example 2

−2R1+R2
Example 2

−3R1+R3
Example 2

−3R1+R3
Example 2

R2÷(−3)
Example 2

−2R2+R1

5R2+R3
Example 2

R3÷(−4)
Example 2

−R3+R1
Example 2

Clearly, the
solution reads
x=1, y=2, and z=3.
note:
• The process of obtaining a 1 in a location, and then
making all other entries zeros in that column, is called
pivoting.
• The number that is made a 1 is called the pivot
element, and the row that contains the pivot
element is called the pivot row.
• We often multiply the pivot row by a number and
add it to another row to obtain a zero in the latter.
The row to which a multiple of pivot row is added is
called the target row.
Any Questions?

You might also like