Scribd
Upload
33 views

2 Gauss Jordan and Gaussian

Uploaded by

Irich Espino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

2 Gauss Jordan and Gaussian

Uploaded by

Irich Espino
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Gaussian Elimination

and
Gauss-Jordan Reduction
SYSTEMS OF LINEAR EQUATION

A system of m linear equations in n unknowns is usually denoted


by a11x1 + a12x2 + . . . + a1nxn = b1
a21x1 + a22x2 + . . . + a2nxn = b2
. .
am1 x1 + am2x2 + . . . + amnxn = bm

When at least one of the right hand side values, b1, b2, . . . , bn is not
equal to zero, the system is called non-homogenous. If b1 = b2 = . . . =
bn = 0, the system of equations is called homogenous.
ECHELON FORM OF A MATRIX
1. All rows consisting entirely of zeroes if any at the bottom of the matrix.
2. The first non zero entry in a row that does not consist entirely of zeroes
is a 1 called the leading entry of its row.
3. If rows, 𝑖 𝑎𝑛𝑑 𝑖 + 1 are two successive rows that does not consist
entirely of zeroes, then the leading entry of row 𝑖 + 1 should be to the
right of the leading entry of row 𝑖.
4. If a column contains a leading entry of some row, then all other entries
of that column are zero.
ECHELON FORM OF A MATRIX
• All rows consisting entirely of zeroes if any at the bottom of the
matrix.
1 0 0 0 2
0 1 0 0 −3
𝐾=
0 0 0 1 4
0 0 0 0 0
ECHELON FORM OF A MATRIX
• The first non zero entry in a row that does not consist entirely of
zeroes is a 1 called the leading entry of its row.

1 0 0 0 2
0 1 0 0 −3
𝐾=
0 0 0 1 4
0 0 0 0 0
ECHELON FORM OF A MATRIX
• If rows, 𝑖 𝑎𝑛𝑑 𝑖 + 1 are two successive rows that does not consist
entirely of zeroes, then the leading entry of row 𝑖 + 1 should be to the
right of the leading entry of row 𝑖.

1 2 3 0 2
0 1 −2 0 −3
𝐾=
0 0 0 0 4
0 0 0 1 0
ECHELON FORM OF A MATRIX
• If a column contains a leading entry of some row, then all other entries of
that column are zero.

1 0 0 0 2
0 1 0 0 −3
𝐾=
0 0 0 1 4
0 0 0 0 0
The following matrices
1 0 0 satisfies the properties of
𝐴= 0 1 0 reduced echelon form of a
0 0 1 matrix.

1 0 0 0 2
0 1 0 0 −3
𝐾=
0 0 0 1 4
0 0 0 0 0
Echelon form vs reduced row echelon form

1 4 5 0 2 1 0 0 0 2
0 1 2 6 −3 0 1 0 0 −3
0 0 1 0 4 0 0 1 0 4
0 0 0 1 0 0 0 0 1 0
ELEMENTARY ROW OPERATION
Definition 14. An elementary row operation on an 𝑚 𝑥 𝑛 matrix
𝐴 = 𝑎𝑖𝑗 is any of the following operations:

• Type I operation. Multiply a row of 𝐴 by a non-zero scalar


• Type II operation. Add a multiple of one row to another row.
• Type III operation. Interchange two row.
THEOREM 5

Every non zero 𝑚 𝑥 𝑛 matrix is row equivalent to a


unique matrix in reduced row echelon form.
Find a matrix in reduced row echelon form which is row
equivalent to

0 2 3 1
𝐴= 0 0 1 4
2 2 1 0
Exercises
Row Echelon form are readily solved by
Gaussian Elimination, and systems in
reduced-row echelon form are solved by
Gauss-Jordan Reduction.
GAUSSIAN ELIMINATION
This consists of two steps
Step 1. The transformation of augmented matrix to row
echelon form using the elementary row operations.
Step 2. Solution of the linear system corresponding to the
augmented matrix using the back substitution.
The linear system
𝑥 + 2𝑦 + 3𝑧 = 9
2𝑥 − 𝑦 + 𝑧 = 8
3𝑥 −𝑧 =3

has an augmented matrix


1 2 3 ⋮9
2 −1 1 ⋮ 8
3 0 −1 ⋮ 3
Transforming the matrix to row echelon form, we obtain
1 2 3 ⋮9
0 1 1 ⋮2
0 0 1 ⋮3
Using the back substitution, we have now
𝑧=3 𝑧 = 3,
𝑦 = 2 − 𝑧 = 2 − 3 = −1 𝑦 = −1
𝑥 = 9 − 2𝑦 − 3𝑧 = 9 + 2 − 9 = 2 𝑥=2
Checking

𝑥 + 2𝑦 + 3𝑧 = 9 𝑧 = 3,
2𝑥 − 𝑦 + 𝑧 = 8 𝑦 = −1
3𝑥 −𝑧 =3 𝑥=2

∴The solution is unique.


Suppose the given augmented matrix that is already in its row echelon
form
1 2 3 4 5 ⋮6
0 1 2 3 −1 ⋮ 7
0 0 1 2 3 ⋮7
0 0 0 1 2 :9

The linear system has infinitely many solutions


GAUSS JORDAN REDUCTION

When performing the Gauss Jordan reduction, the


augmented matrix is transformed into its reduced
row echelon form. This means that we can simplify
the linear system without the back substitution.
The linear system
𝑥 + 2𝑦 + 3𝑧 = 6
2𝑥 − 3𝑦 + 2𝑧 = 14
3𝑥 + 𝑦 − 𝑧 = −2

We form the augmented matrix

1 2 3 ⋮6
2 −3 2 ⋮ 14
3 1 −1 ⋮ 2
Transforming the matrix to reduced row echelon form

1 0 0 ⋮1
0 1 0 ⋮ −2
0 0 1 ⋮3

𝑥 = 1, 𝑦 = −2 𝑎𝑛𝑑 𝑧 = 3
Consider the matrix in reduced row echelon form.
1 0 0 0 10 : −1
0 1 0 0 −5 : 2
0 0 0 1 2 :9

The linear system will be


𝑥1 + 10𝑥5 = −1
𝑥2 − 5𝑥5 = 2
𝑥4 + 2𝑥5 = 9

You might also like