0% found this document useful (0 votes)
43 views12 pages

Gauss Alimination Method New

The Gauss elimination method is an algorithm for solving systems of linear equations. It involves performing row operations on the coefficients matrix to transform it into reduced row echelon form. This is done by eliminating variables from equations one by one, starting from the first, until each equation contains only one variable. The values of the variables are then determined by back-substitution, starting from the last equation. Some key steps are subtracting multiples of rows from other rows to introduce zeros, choosing appropriate pivot elements at each step, and solving the transformed system from bottom to top. Several examples demonstrating this process are provided.

Uploaded by

Nabila Rani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
43 views12 pages

Gauss Alimination Method New

The Gauss elimination method is an algorithm for solving systems of linear equations. It involves performing row operations on the coefficients matrix to transform it into reduced row echelon form. This is done by eliminating variables from equations one by one, starting from the first, until each equation contains only one variable. The values of the variables are then determined by back-substitution, starting from the last equation. Some key steps are subtracting multiples of rows from other rows to introduce zeros, choosing appropriate pivot elements at each step, and solving the transformed system from bottom to top. Several examples demonstrating this process are provided.

Uploaded by

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

Gauss Elimination Method:

Gauss elimination, in linear and multilinear algebra, a process for finding the
solutions of a system of simultaneous linear equations by first solving one of the
equations for one variable in terms of all the others and then substituting this
expression into the remaining equations.

In mathematics, Gaussian elimination also known as row reduction, is an


algorithm for solving systems of linear equations. It consists of a sequence of
operations performed on the corresponding matrix of coefficients.

We can apply this method only when the number of unknown variables and
number of equations are same.

We can also use this method to estimate either of the following rank of the
matrix , determinant of the matrix and the invers of the invertible matrix.
The way to understand the method of elimination, consider the system in three
dimensions:

a 1 u+b 1 v+ c1 w=d 1 ,

original system a 2 u+b 2 v+ c 2 w=d 2 ,

a 3 u+b 3 v +c 3 w=d 3 .

The problem is to find the unknown values of u , v and w, and we shall apply
gauss elimination method. The method starts by subtracting multiples of the
first equation from the other equations. The goal is to eliminate u from the two
equations. This requires that we:
a2
 Subtract a times the first equation from the second.
1

a3
 Subtract a times the first equation from the third.
1

a 1 u+b 1 v+ c 1 w=d 1 ,

equivalent system b´2 v + ć2 w=d´2 ,

b´3 v+ ć3 w=d´3 .

The coefficient a 1is the first pivot. The pivot for the second stage of elimination
is b´2. We know ignore the first equation. A multiple of the second equation will
be subtracted from the remaining equations (in this case there is only the third
one) so we eliminate v.
b́3
 Subtract times the second equation from the third.
b́2

a 1 u+b 1 v+ c1 w=d 1 ,

b´2 v+ c´2 w=d´2 ,

ć 3 w ¿ d´3 .
This system is solved backward , bottom to top .The last equation gives the
value of w. Substituting into the second equation we find v. Then the first
equation gives the value of u.

Example: solve the system of linear equation 2 u+v + w=5,4 u−6 v=−2 and
−2 u+7 v +2 w=9 using the Gauss elimination method.

Solution: Our system of linear equation is:


2 u+v + w=5 ,

4 u−6 v=−2 ,

−2 u+7 v +2 w=9 .
 Subtract 2 times the first equation from second.
 Subtract -1 times the first equation from third.
2 u+v + w=5 ,

−8 v−2 w=−12 ,

8 v+3 w=14 .

 Subtract -1 times the second equation from the third.

2 u+v + w=5 ,

−8 v−2 w=−12 ,

1 w=2.
By solving last equation w=2.

Substituting w in second equation


−8 v−2 ( 2 )=−12 ,

v=1 .

Now substituting w and v in first equation


2 u+1+2=5 ,

u=1.

The required solution of the equation is u=1, v=1∧w=2 .

Example: solve the following system of linear equations by gauss


elimination method 2 x−2 y+3 z=2, x +2 y −z=3∧3 x− y+ 2 z=1.
Solution: our system of linear equation is
2 x−2 y+3 z=2,

x +2 y −z=3 ,

3 x− y +2 z=1 .

 Interchanging first and second equation.


x +2 y −z=3 ,

2 x−2 y+3 z=2,

3 x− y +2 z=1 .

 Subtracting 2 times the first equation from second.


 Subtracting 3 times the first equation from third.
x +2 y −z=3 ,

−6 y +5 z=−4 ,

−7 y +5 z=−8 .

 Subtracting third equation from second.


x +2 y −z=3 ,

−6 y +5 z=−4 ,

− y=−4 .

By solving last equation y=4 .

Substituting the value of y in second equation


−6 ( 4 ) +5 z=−4 ,
z=4 .

Now substituting the value of y and z in first equation


x +2 ( 4 )−4=3 ,

x=−1 .

The required solution of equation is x=−1 , y=4∧z=4 .

Exercise: solve the following equations by Gauss elimination method:


1.2 x+ 4 y +6 z=22 , 3 x+ 8 y +5 z=27 ,−x + y +2 z=2 .

2.2 x−3 y=3 , 4 x−5 y + z =7 ,2 x− y −3 z =5 .


3. x + y + z=9 , 2 x +5 y +7 z=52 , 2 x + y−z=0 .

4.2 x− y +3 z=9 , x+ y+ z =6 , x− y + z=2 .

5.3 x−2 y+ z=5 , 4 x +3 y−3 z=1 ,−6 x + 4 y−7 z=3 .

You might also like