Alberto D.

Agbuya
Joshua C. Cayabyab
Ma. Charisa M. Balatayo
Liezl C. Barile
Regine G. Calimlim
Donna Grace A. Corpuz
Jonalyn R. Palisoc

Group V
POWERPOINT
PRESENTATION

Gaussian
Elimination
and
gauss Jordan
elimination

Matrices and Elementary Row

Operations
DEFINITION 1

Matrix: an m x n matrix is an array of

numbers with m rows and n columns.
Example:
Legend:
Red- column
Blue- rows

An m x n matrix is said to be in a row-echelon

form if it satisfies the following:

Each

nonzero lies above every zero row.

The leading entry of a nonzero row lies in a column to

the right of the column with the leading entry of any
preceding row.
If a column contains the leading entry of some row,
then all entries of that column below to the leading
entry are 0.
Example:

Reduced Row Echelon:

If a column contains the leading entry of
some row, then all the other entries of
that column are 0.
The leading entry of each nonzero row is
1.

Matrices and Elementary Row

Operations
THEOREM 2
Any one of the following operations performed on the
augmented matrix, corresponding to a linear system,
produces an augmented matrix corresponding to an
equivalent linear system.
(1) Interchanging any two rows
(2) Multiplying any row by a non zero constant
(3) Adding a multiple of one row to another

Gaussian Elimination
This is done by transforming the systems
augmented matrix form into row-echelon form
by means of row operations. The system is
solved by back substitution.

Gauss-Jordan Elimination
DEFINITION 2
Echelon Form: An m x n matrix is in row echelon
form if
1. Every row with all 0 entries is below every row with
nonzero entries.
2. If rows 1, 2, , k are the rows with nonzero entries
and if the leading nonzero
entry (pivot) in row i
occurs in column ci , for 1, 2, , k, then c1 < c2 < <
ck.

Gauss-Jordan Elimination
The matrix is in reduced row echelon form if, in addition,
3. The first nonzero entry of each row is a 1.
4. Each column that contains a pivot has all other
entries 0.

The process of transforming a matrix to reduced row

echelon form is called Gauss-Jordan Elimination.

Example 1
Solve the linear system.
-2x + y = 1

x 3y = 2
Solution: The linear system in matrix form is

The solution could be in the form of interchanging rows.

Gaussian Elimination

Back Substitution

&

3R2 + R1 R1
Gauss Jordan

Example 2
Solve using Gaussian elimination

MATRIX form

Gaussian elimination

Gauss Jordan

X=2

, y=-1 and z=3

Example 3

Matrix form
Solution

Gaussian elimination

Gauss Jordan

x=8
y=0

Solve the linear system by transforming the

augmented matrix to reduced row echelon form.

x1 x2 2x3 x4 = 0
2x1 x2 3x3 + 2x4 = -6
- x1 + 2x2 + x3 + 3x4 = 2
x1 + x2 x3 + 2x4 = 1

Solution

The augmented matrix of a linear system is

To transform the matrix into reduced row echelon form, we first use
the leading 1 in row 1 as a pivot to eliminate the terms in column 1
of rows 2, 3, and 4. To do this, we use the three row operations
-2 R1 + R2

R2

R1 + R 3

R3

- R1 + R 4

R4

In succession,

transforming the matrix

to

For the second step we use the leftmost 1 in row 2 as the pivot and
eliminate the term in column 2 above the pivot, and the two terms below
the pivot. The required row operations are
R2 + R1
- R2 + R3

- 2R2 + R4

R2
R3
R4

Reducing

the matrix
to

Notice that each in row 3 is evenly divisible by 2. Therefore, a leading 1 in

row 3 is obtained using the operation - R3 R3
Which results in

the matrix

Now, by using the leading 1 in row 3 as a pivot,

the operations
R3 + R1 R1
-R3 + R2 R2
R3 + R4 R4
Row-reduce the matrix
to

Using the operation - R4 R4, we change the signs

of the entries in row 4 to obtain the matrix

Finally, using the leading 1 in row 4 as the pivot,

we eliminate the terms above it in column 4.
Specifically, the operations
R4 + R1 R 1
-2

R 4 + R2 R 2

R 4 + R3 R 3

Applied

to the last matrix give

Which is reduced to the echelon form.

The solution can now be read directly from the
reduced matrix, giving us

x1 = -19

x2 = 16

x3 = -22
= -9

and

x4

Shown in the following list is an outline that

summarizes the process for transforming a matrix
to its equivalent reduced row echelon form.
1. If necessary, interchange rows so that the leading nonzero entry
of row 1 is the leftmost nonzero entry of the matrix. Then divide
each entry of row 1
by the leading entry.
2. Eliminate all other nonzero terms in this leading column.
3. Repeat the first two steps, starting with row 2. Note that the
leading entry may not be in column 2.
4. Continue in this way, making sure that the leading entry of each
row is a 1 with zeros elsewhere in that column.

4. The leading 1 in any row should be

to the right of a leading 1 in the row
above it.
5. All rows of zeros are placed at the
bottom of the matrix.

 We have implicitly assumed in our discussion that

every matrix is row equivalent to exactly one matrix in
reduced row echelon form. It is an important fact that
we will state here as a theorem without proof.

THEOREM 3: The reduced row

echelon form of every matrix is
unique.

Fact Summary
Altering an augmented matrix by interchanging two
rows, or multiplying a row by a nonzero constant, or
replacing a row with the sum of the same row and a
scalar multiple of another row does not alter the set of
solutions of the corresponding linear system.
1.

2. If an augmented matrix is row-reduced to triangular

form, the coefficient matrix has a row of zeros, and
the corresponding augmented term is not zero, then
the linear system has no solutions.
3. Every matrix has a unique reduced row echelon form .

Fact Summary
4. If the augmented matrix of an m x n linear system is
row-reduced to triangular form and the coefficient
matrix has no rows of zeros, then the linear system has
a unique solution.
5. If the augmented matrix of an m x n linear system is
row-reduced to triangular form, the coefficient matrix
has rows of zeros, and each corresponding augmented
term is 0, then the linear system has infinitely many
solutions.