Scribd
Upload
464 views

Engineering Maths 3 (Week3)

This document discusses Gaussian elimination and solving systems of linear equations. It begins with an overview of Gaussian elimination, which uses elementary row operations to reduce a matrix to row echelon form. This allows the system of equations to be solved using back substitution. The document provides an example of using Gaussian elimination to solve a system of 3 equations with 3 unknowns. It also discusses how Gaussian elimination can be used for overdetermined, underdetermined, determined and inconsistent systems of linear equations.

Uploaded by

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

Engineering Maths 3 (Week3)

This document discusses Gaussian elimination and solving systems of linear equations. It begins with an overview of Gaussian elimination, which uses elementary row operations to reduce a matrix to row echelon form. This allows the system of equations to be solved using back substitution. The document provides an example of using Gaussian elimination to solve a system of 3 equations with 3 unknowns. It also discusses how Gaussian elimination can be used for overdetermined, underdetermined, determined and inconsistent systems of linear equations.

Uploaded by

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

Prepared By: Charles Bong Hin Joo

KNF2033 ENGINEERING MATHEMATICS


III
LINEAR SYSTEMS OF EQUATIONS
(GAUSS ELIMINATION)
Prepared By: Dr. Charles Bong Hin Joo
Gauss Elimination
Prepared By: Dr. Charles Bong Hin Joo
Gaussian Elimination Method
Consider a system of m equations in n unknowns given by
AX=B.

Consider the augmented matrix [A l B]. Apply elementary row
operations on both A and B such that A reduces to an upper
triangular matrix.







The n unknowns x
1
, x
2
, x
n
are solved by back substitution
i.e., first solve the last equation for x
n
, then solve the last
but one equation for x
n-1
and so on.


n n nn
n n
n n
n n
b x a
b x a x a
b x a x a x a
b x a x a x a x a
=
= + +
= + + +
= + + + +
* * *
3
*
3 3
*
33
2
*
2 3
*
23 2
*
22
1 1 3 13 2 12 1 11

..... .......... .......... ..........
....
....
....
Prepared By: Dr. Charles Bong Hin Joo
Gaussian Elimination Method
Example

6 2 4
4 2 3
9 2 3 2
3 2 1
3 2 1
3 2 1
= +
= +
= +
x x x
x x x
x x x
Prepared By: Dr. Charles Bong Hin Joo
Gaussian Elimination Method
Solution



(
(
(

(
(
(

=
(
(
(

(
(
(

6 2 4 1
4 1 2 3
9 2 3 2
form augmented In
6
4
9
2 4 1
1 2 3
2 3 2
3
2
1
x
x
x
(
(
(


(
(
(

+ +
(
(
(

(
(
(

2 1 2 0
5
3
5
2
1 0
6 2 4 1
7
1
) 3 ( ,
5
1
) 2 (
14 7 14 0
3 2 5 0
6 2 4 1
) 1 ( 3 ) 3 ( ), 1 ( 2 ) 2 (
4 1 2 3
9 2 3 2
6 2 4 1
) 3 ( ~ ) 2 (
9 2 3 2
4 1 2 3
6 2 4 1
) 3 ( ~ ) 1 (
Prepared By: Dr. Charles Bong Hin Joo
Gaussian Elimination Method
(
(
(


(
(
(
(
(
(

+
4 1 0 0
5
3
5
2
1 0
6 2 4 1
) 5 ( ) 3 (
5
4
5
1
0 0
5
3
5
2
1 0
6 2 4 1
) 2 ( 2 ) 3 (
(
(
(

=
(
(
(

(
(
(

4
5
3
6
1 0 0
5
2
1 0
2 4 1
3
2
1
x
x
x
2 6 8 4 6 2 4
1 1
5
8
5
3

5
3
5
2
4 4
upwards working row, bottom the from Expanding
1 1 3 2 1
2 2 3 2
3 3
= = + = +
= = + = =
= =
x x x x x
x x x x
x x
Prepared By: Dr. Charles Bong Hin Joo
Gaussian Elimination Method
Now you try it!!


3
5 3 2
2
= + +
= +
= +
z y x
z x
z y
Prepared By: Dr. Charles Bong Hin Joo
Gauss Elimination (overdetermined)

Example
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (overdetermined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (overdetermined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (overdetermined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (underdetermined)
Example
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (underdetermined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (underdetermined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (determined)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (no solution)
Prepared By: Dr. Charles Bong Hin Joo

Gauss Elimination (no solution)
Prepared By: Dr. Charles Bong Hin Joo
Now you try it!!

A firm produces three products, A, B and C which require
processing by three machines. The time (in hours) required
for processing one unit of each product by the three
machines is as follows:






Machine I is available for 850 hours, machine II for 1200
hours and machine III for 550 hours. How many units of
each product should be produce to make use of all the
available time on the machine?


(
(
(

1 1 2
4 2 1
2 1 3
A B C
Machine I
Machine II
Machine III
Prepared By: Dr. Charles Bong Hin Joo
Echelon Form

Prepared By: Dr. Charles Bong Hin Joo
Echelon Form
Prepared By: Charles Bong Hin Joo

You might also like