Professional Documents
Culture Documents
Gussian Elimination Method Aim:-: X X X X X X X X
Gussian Elimination Method Aim:-: X X X X X X X X
Equations:
Theory:-
Theory:-
In this method the unknowns of equations below are eliminated and the system
is reduced to an upper triangular system. the unknowns are obtained by back substitution.
Let a system of simultaneous equations in n unknowns x1 , x2 ,………. , xn be
a 21 x1 + a2 2 x 2+ …+a2 n x n=b2
…………………………………….
…………………………………….
a n1 x 1+ an 2 x 2 +…+a n n x n=bn
………………………………………..
………………………………………...
a ' n 2 x 2+ …+a ' nn x n=b ' n
Step 2. We again eliminate x2 from 3rd , 4th …………. nth equation with the help of the
second equation
a 11 x 1 +a12 x 2 +a 13 x 3 …+ a1 n x n=b1
………………………………………..
………………………………………...
………………………………………..
………………………………………...
c nn x n =d n
The given system is reduced to the above form i.e triangular form.
Backward Substitution
We first find out the value of xn from the last equation , the substitute the value of x n
in the (n-1)th equation to get the value of xn-1. Again substitute the value of xn-1 in the (n-2)th
equation to get the value of xn-2 . By this backward substitution we can find the values of all
unknowns.
Output: -
[1.00000000e+00 2.00000000e+00 3.00000000e+00 9.62193288e-17]