Report on

Gauss Elimination Method

An Report writing Submitted To

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST

BENGAL
In partial fulfillment for the award of the degree of Bachelor of Technology

Submitted By
Shakrin Perween
Roll No: 12500222109
6th Semester
Stream : IT(B)

Subject Name: Numerical

Subject code: OEC IT601A
Submitted to:
Mr. Somnath Mondal (LECTURER)
Department Of Information Technology
BENGAL COLLEGE OF ENGINEERING & TECHNOLOGY
 Acknowledgement

I Shakrin Perween, student of IT(B), Roll No:12500222109 would like to extend my

heartfelt thanks to Mr. Somnath Mondal, my esteemed teacher, for her continuous
support, encouragement, and guidance throughout this project. Her insightful advice
and constructive feedback have been invaluable in shaping my understanding of the
topic. I truly appreciate her dedication to teaching, which has been a constant source
of motivation for me. Her patience and efforts in helping me refine my work have
been crucial to the successful completion of this report.
 Abstract

Gauss elimination method

the definition of these systems of equations. A system of linear equations is a group
of linear equations with various unknown factors. As we know, unknown factors exist
in multiple equations. Solving a system involves finding the value for the unknown
factors to verify all the equations that make up the system.
Gauss elimination method is a numerical method used to find the value of a
determinant |A|. The basic idea of Gauss elimination method is transforming the
original determinant |A| to upper triangular one |U| and then finding the determinant
|A| value by multiplying the main diagonal numbers of |U|.
Introduction
 Introduction:
(1) Gauss Elimination Method :
To reduce the augmented matrix to row - echelon form you should follow the
following steps:

Step 1. Locate the leftmost column that does not consist entirely of zeros.
Step 2. Interchange the top row with another row , if necessary , to bring a
nonzero entry to the top of the column found in Step 1.
Step 3. If the entry that is now at the top of the column found in Step 1 is b
1
, multiply the first row by in order to introduce a leading 1. b
Step 4. Add suitable multiples of the top row to the rows below so that all
entries below the leading 1 become zeros.
Step 5. Now cover the top row in the matrix and begin again with Step 1 applied
to the submatrix that remains. Continue in this way until the entire matrix
is in row - echelon form.

Example 3.2.8: Solve the following system of linear equations by using the
Gauss elimination method:
5 x1 + 6 x2 = 7
3 x1 + 4 x2 = 5

Solution: The system of linear equations has the following augmented matrix
1
6 7 R R 6 7 R 3R R
5 1 1 1 5 5 2 1 2
5
3 4 5
3 4 5

7 5 6 7
6
1 5 R2 R2 1 5
5 2 5
4 In Row - Echelon
0 2 0 1 2 Form
5 5

The last matrix is in row - echelon form . The corresponding reduced system is:
 6 7
x x (1)
1 2
5 5
x2 2 (2)
Substitute the value of x 2 in equation (1) ,we get
12 7 7 12 5
x x x 1
1 1 1
5 5 5 5 5
Therefore the solution of the system is x1 1 , and x 2 2 .

Example 3.2.9: Solve the following system of linear equations by using the
Gauss elimination method :
4y + 2z = 1
2x + 3y + 5z = 0
3 x + y + z = 11

Solution: The system of linear equations has the following augmented matrix

0 1
0 4 2 1 R R 2 3 5 R1 R1
2 3 5 0 1 2
0 4 2 1 2
11 11
3 1 1 3 1 1

3 5
0
1 2 2 R3 3R R
0 4 2 1 1 3

3 1 1 11

3 5
1 0 1
2 2 R
4 R2 2

0 4 2 1
7 13
0 11
2 2
 3 5
1 0 7
2 2 R
0 1 1 1 3 2 R2 RR23
2 4
7 13 11
0
2 2

3 5
1 0 4 R
2 2 R
1 1 19 3 3
0 1
2 4

0 0 19 95
4 8

3 5
1 0
2 2 In Row - Echelon Form
1 1
0 1
2 4
5
0 0 1
2

The last matrix is in row - echelon form . The corresponding reduced system is:
3
x y 5z 0 (1)
2 2
1 1
y z (2)
2 4
5
z = (3)
2
Substitute the value of z in equation (2) , we get

5 1 1 5 6 3
y y
4 4 4 4 4 2
Substitute the values of y and z in equation (1) , we get
9 25 9 25 16
x 0 x 4
4 4 4 4 4
3 5
Therefore the solution of the system is x = 4 , y = , and z = .
2 2

Example 3.2.10: Solve the following system of linear equations by using the
Gauss elimination method:
3 x1 + 6 x2 9 x3 = 15
2 x1 + 4 x2 6 x3 = 10
2 x1 3 x2 + 4 x3 = 6

Solution: The system of linear equations has the following augmented matrix
1 R
6 9 15
3 R1
10 1
2 4 6 3

2 3 4 6

1 2 3 5
R2 2 R1 R2
2 4 6 10
6
2 3 4

1 2 3 5 R3 2 R1 R3
0 0 0 0
6
2 3 4

5
1 2 3 R2 R3
0 0 0 0
0 1 2 4

1 2 3 5
0 1 2 4 In Row Echelon Form

0 0 0 0
The last matrix is in row - echelon form. The corresponding reduced system is:
x 1 + 2 x2 3 x3 = 5
x2 2 x3 = 4

Equation (2) implies that x2 = 2 x 3 + 4

Substitute the value of x2 in equation (1), we get

x 1 + 4 x3 + 8 3 x3 = 5 x1 = x3 3

If we let x3 = t , then for any real number t , we have:

x1 = t 3
x2 = 2 t + 4
x3 = t
Therefore the system has infinite number of solutions.

If t = 0, the solution will be x1 = 3 , x 2 = 4 and x3 = 0

If t = 1, the solution will be x1 = 4 , x 2 = 6 and x3 = 1

If t = 2, the solution will be x1 = 1 , x 2 = 0 and x3 = 2

If t = 3.5, the solution will be x1 = 6.5 , x 2 = 11 and x 3 = 3.5

Exercises 3.2.11:

(1) Solve the following system of linear equations by using the Gauss
elimination method:
x1 + x2 + x3 = 2
2 x1 + 3 x2 x3 = 9
x1 + 3 x2 + 2 x3 = 5

(2) Solve the following system of linear equations by using the Gauss
elimination method:

x + y + 2 z = 14
x 3 y + 2 z = 10
2x y + 2 z = 15
 Methodology

History of Guassian Elimination

Classic books on the History of Mathematics, as well as recent studies on this subject,
place the origins of Guassian Elimination in a variety of ancient texts from different
places and times: China, Greece, Rome, India, medieval Arabic countries, and
European Renaissance. However, it is not exact to say that these ancient texts
describe what we understand today as the method of Guassian Elimination, since
these texts mainly present some specific problems that are solved in a way that is
accepted as Guassian Elimination, butthey do not include any explicit statement of
the set of rules that constitute the method of GE. The schoolbook elimination period
corresponds to the development of GE essentially as it is presented incurrent high
school textbooks. This period started with Isaac Newton who lectured on Algebraas it
appeared in Renaissance texts. Isaac Newton established first the rules of Gaussian
elimination as they are still presented in current high school textbooks. Carl Friedrich
Gauss developed efficient methods for solving normal equations, i.e., the special type
of linear equations that may arise in solutions of least square problems, via Gaussian
elimination of linear equations via hand computations.

Guassian Elimination
Guassian elimination is the standard method for solving linear equations. As it is a
ubiquitous algorithm and plays a fundamental role in scientific computation.
Guassian elimination is a tool for obtaining the solution of equations, to compute the
determinant, for deducing rank of coefficient matrix. However Guassian Elimination
depends more on matrix analysis and computation. It emphasis on block pivoting,
methods of iteration and a means to improve the computed solution quality. It
involves two stages forward and backward stage. Forward stage: Unknowns are
eliminated in this stage by manipulation of equations and constitute an echelon form.
 Conclusion
There are different direct and indirect methods which are used to compute the linear
system of equations. Guassian Elimination is a type of direct method used to calculate
the unknown variables. Many scientific and engineering domains of computation may
take the form of linear equations. The equations in this field may contain large
number of variables and hence it is important to solve these equations in an efficient
manner. This paper comprises of Guassian Elimination method an efficient method to
solve these equations. Although the comparison on the basis of execution time is
carried out along with the Guass Jordan method and it has been concluded that
Guassian Elimination is faster than the other elimination methods and it is used in
various scientific fields where large number of computations are performed by
elimination of variables. Our future directions are to use and develop the simple and
efficient method for non linear system of equations.
 Application
The primary application of the Gauss Elimination Method is to solve systems of linear
equations. It is used in various fields such as physics, engineering, economics, and
computer science, where systems of equations arise. The Gauss Elimination Method can
be utilized to find the inverse of a matrix.

Solving linear equations:

This is the primary application, where a set of linear equations with multiple variables
can be solved by converting them into a matrix and performing row operations to find
the values of each variable.

Matrix inverse calculation:

By augmenting the matrix with the identity matrix and applying Gauss Elimination, one
can compute the inverse of a square matrix.

Determinant calculation:

The determinant of a matrix can be calculated by performing row operations to bring the
matrix into upper triangular form and multiplying the diagonal elements.

Rank of a matrix:

Gauss Elimination can be used to determine the rank of a matrix by identifying the
number of non-zero rows after performing row operations.

Curve fitting:

In data analysis, Gauss Elimination can be used to find the best fit line or curve to a set
of data points by solving a system of equations representing the curve.
 References
1. Noreen direct and indirect solvers for linear system 2012.
2. Froilán M. Dopico, Turing and the origins of modern
Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM, December 14, 2012.
3.

Research (IJCCER), Information Technology Department, Volume 2,02- march-

2014.
4. -Jordan

5.
Math., 38(2):163_218, 2011.
6. Etienne Loute, elimination as computational August 2003.
7.