University of Karbala Republic of Iraq

College of Engineering Ministry of higher

Numerical Analysis education
Third Stage
2nd course

The Bisection Method by MATHLAP

By: Mohammad Ahmed Hussein

Supervisor: Dr. Caesar

2021
The Bisection Method
The Bisection Method or interval halving can be used to determine the
solution to f(x) = 0 on an interval [xR1R = a, xR2R = b] if f(x) is real and
continuous on the interval and f(xR1R) and f(xR2R) have opposite signs.
We assume for simplicity that the root in this interval is unique. The
location of the root is then calculated as lying at the midpoint of the
subinterval within which the functions have opposite signs. The process
is repeated to any specified accuracy.
It is based on the fact that a root of an equation is the point
where its curve crosses the x-axis (i.e., y = 0).
For example, this is the graph of the equation:

𝑦 = 2𝑥 2 − 5𝑥 + 3
It searches for the point which is located between two values of x where
the corresponding values of y = f (x) have different signs.
Example: Find the roots of the following equation:

2𝑥 2 − 5𝑥 + 3 = 0
(Analytical solutions: x = 1.5 and x = 1)

Solution:
- we write in MATHLAP the code below :
- now we run the program with that code and make some of try’s

1- we enter the value of ( x1=0.6 ) and ( x2=1.2 ) than get the root of
(1.00000) and (19) bisections or intervals
2- we enter the value of ( x1=1.2 ) and ( x2=1.9 ) than get the root of
(1.50000) and (20) bisections or intervals
3- we enter the value of ( x1=2 ) and ( x2=4 ) than we can`t get roots
in that interval