A Report

on

Computational method

In partial fulfillment of practical exam of mathematics

Koshi Saint James Secondary School

Itahari-9, Sunsari

Submitted to: Submitted by:

Mr. Rajiv shah Bimarsha Pokhrel

Koshi St James Sec school Roll no – 7 (seven)

Class – XII ‘D’

Signature: ________________

i
 Table of Contents

[Link]----------------------------
-----------1
[Link] of computational
method------------2
[Link] Elimination
Method-----------------------------3
3.1 Augmented Matrix Formation
3.2 Forward Elimination and Back Substitution

[Link]-Seidel
Method------------------------------------4
4.1 Diagonally Dominant Condition
4.2 Iterative Formula

[Link]
Method------------------------------------------5
5.1 Slack Variables
5.2 Simplex Tableau

[Link] of computational method

-------------6
[Link] and
method----------------------------------7

ii
8.
References-----------------------------------------
--------8

iii
1. Acknowledgement
I would like to express my sincere gratitude to my Mathematics teacher
for providing valuable guidance, encouragement, and continuous support
during the preparation of this project on Advanced Computational
Methods. Their clear explanations and suggestions helped me to
understand topics such as Gauss Elimination, Gauss-Seidel Method, and
Simplex Method more effectively.

I am also thankful to my school administration for including project

work as a part of the academic curriculum, which helped me enhance my
research and presentation skills. I would like to extend my heartfelt
thanks to my parents and friends for their constant motivation and
support throughout the completion of this report.

Finally, I acknowledge the use of textbooks, reference books, and

reliable educational websites that provided useful information for the
successful completion of this project.

1
2. Introduction to Computational
Methods
Computational Methods are a branch of applied mathematics that deal
with solving mathematical problems using systematic, step-by-step
numerical techniques. These methods are especially useful when
problems are too complex to be solved accurately using traditional
algebraic or analytical approaches. In modern science, engineering,
economics, and management, computational methods play a vital role in
obtaining approximate and efficient solutions to real-world problems.

In many practical situations, such as solving large systems of linear

equations, optimizing resources, or predicting outcomes, exact solutions
are either difficult or impossible to obtain. Computational methods
provide approximate solutions with a high degree of accuracy by using
iterative procedures and algorithmic steps. With the advancement of
computers and technology, these methods have become faster, more
reliable, and widely applicable across various disciplines.

One of the major applications of computational methods is in solving

systems of linear equations, which appear frequently in physics,
engineering, economics, and social sciences. Direct methods, such as the
Gauss Elimination Method, transform the system into a simpler form
and produce exact solutions (subject to rounding errors). On the other
hand, iterative methods, such as the Gauss-Seidel Method, start with an
initial guess and improve the solution step by step until it converges to
an acceptable level of accuracy.

Computational methods are also essential in the field of optimization,

especially in Linear Programming Problems (LPP). The Simplex
Method is a powerful computational technique used to find the
maximum or minimum value of an objective function under given
constraints. Such optimization problems are commonly found in
business planning, transportation, production management, and
economics, where limited resources must be utilized efficiently.
2
3. Gauss Elimination Method
Gauss Elimination is a direct method used to solve a
system of linear equations. It reduces the system step-by-
step into an upper triangular form, from which the
solution can be obtained easily.

3.1 Augmented Matrix

Consider the system of linear equations:
a1 x +b1 y +c 1 z ¿ d 1
a 2 x +b2 y +c 2 z ¿ d 2
a 3 x +b3 y +c 3 z ¿ d 3

This system can be written in augmented matrix form as:

[ ]
a1 b1 c1 d 1
a2 b2 c2 d 2
a3 b3 c3 d 3

3.2 Procedure

1. Forward Elimination
Elementary row operations are applied to eliminate the
variables below the main diagonal, converting the matrix
into an upper triangular matrix.

2. Back Substitution
The last equation is solved first to find the value of the last
variable. This value is substituted into the previous
equations to find the remaining variables one by one .

3
4. Gauss-Seidel Method
The Gauss-Seidel method is an iterative method used to
find approximate solutions of a system of linear
equations. It is especially useful for large systems where
direct methods are time-consuming.

4.1 Diagonal Dominance

For convergence, the coefficient matrix should be diagonally
dominant, i.e.,
|aii|≥ ∑|a ij|for each row
j ≠i

If this condition is satisfied, the method converges faster and

more reliably.

4.2 Iterative Formula

For a system:
a1 x +b1 y +c 1 z ¿ d 1
a 2 x +b2 y +c 2 z ¿ d 2
a 3 x +b3 y +c 3 z ¿ d 3

The equations are rewritten as:

1
x (k+1 ) ¿ (d −b y (k )−c 1 z (k ) )
a1 1 1
1
¿ ( d 2−a2 x −c 2 z )
( k+1) ( k+1 ) (k )
y
b2
1
¿ ( d 3−a 3 x −b3 y )
( k +1) ( k+1) ( k+1 )
z
c3

I
mportant Feature:

4
Newly calculated values are used immediately in the same
iteration, making Gauss-Seidel faster than the Jacobi method.

5. Simplex Method
The Simplex Method is used to solve Linear Programming
Problems (LPP) to maximize or minimize an objective
function under given constraints.

5.1 Slack Variables

Constraints are usually given in inequality form. To convert them
into equations, slack variables are added.
Example:
x + y ≤ 10 ⇒ x + y + s=10

where s ≥ 0 is the slack variable

5.2 Simplex Tableau

The Simplex method is performed using a tableau.
Steps:
1. Pivot Column:
The column with the most negative value in the objective
function row.

2. Pivot Row:
Calculated by dividing the RHS by the corresponding
positive pivot column entries. The smallest ratio is chosen.

3. Pivoting:
Row operations are used to make the pivot element 1 and
all other elements in that column 0.

5
The process continues until all values in the objective function
row are non-negative, giving the optimal solution.

6. Applications of Computational
Methods
Computational methods are widely used in various fields:

Engineering and Science

They are used to solve systems of equations in electrical circuits, structural
analysis, fluid mechanics, and numerical simulations.

Economics and Business

The Simplex method is applied in profit maximization, cost minimization,
production planning, and transportation problems.

Computer Science and Data Analysis

Iterative methods like Gauss-Seidel are used in numerical algorithms,
simulations, and optimization problems.

Management and Operations Research

Computational techniques help in decision-making, resource allocation, and
scheduling under limited constraints.

Education and Research

These methods form the foundation for higher studies in mathematics,
engineering, and applied sciences.

6
7. Materials and Methods

Materials
 Laptop
 Printer
 Internet connection
 Calculator
 Pen and pencil
 A4 size paper
 Stapler
 Plastic file

Methods
 Study of Grade 12 Mathematics textbook and
reference books
 Online study of educational mathematics websites
 Collection of information related to computational
methods
 Understanding and practice of Gauss Elimination,
Gauss-Seidel, and Simplex Method
 Organization of collected information
7
  Preparation of the report using MS Word

8. References
1. Curriculum Development Centre (CDC), Nepal – Secondary Level
Mathematics Curriculum (Grade 11–12)

2. MeroSiksha – Grade 12 Mathematics Notes

3. Bed Prasad Dhakal – Grade 12 Mathematics, Educational Publishing

House, Nepal