Chapter 03.

03
Bisection Method of Solving a Nonlinear Equation

After reading this chapter, you should be able to:

1. ​follow the algorithm of the bisection method of solving a nonlinear equation, ​2. ​use the
bisection method to solve examples of finding roots of a nonlinear equation, and
3. ​enumerate the advantages and disadvantages of the bisection method.

What is the bisection method and what is it based on?

One of the first numerical methods developed to find the root of a nonlinear equation f​ ​(​x​) ​=
0 ​was the bisection method (also called ​binary-search ​method). The method is based on the
following theorem.

Theorem
An equation ​f (​ ​x​) ​= ​0 ​, where ​f ​(x​ ​) ​is a real continuous function, has at least one root between
 ​x ​and u​ ​x i​ f ​( ) ( ) ​< ​0 u
​ f​ x f x  ​ ​(See Figure 1).
Note that if ​f ​(​x ​ ​) ​f (​ ​xu​ ​) ​> ​0 , there may or may not be any root between 
​ ​x ​and ​u x​
(Figures 2 and 3). If ​( ) ( ) ​< ​0 ​u f​ x f x ​ ,​ then there may be more than one root between ​ x​
and ​u ​x ​(Figure 4). So the theorem only guarantees one root between ​ x​ a​ nd ​u x​ ​.

Bisection method
Since the method is based on finding the root between two points, the method falls
under the category of bracketing methods.
Since the root is bracketed between two points, ​ x​ a​ nd ​u ​x ​, one can find the mid
point, ​m​x b​ etween ​ x​ ​and ​u x​ ​. This gives us two new intervals
1. ​ x​ ​and ​mx​ ​, and
2. m​ x​ ​and u​ x​ ​.

03.03.1
03.03.2 ​Chapter 03.03
 f ​(​x​)

x​ℓ
x​ux​

Figure 1 ​At least one root exists between the two points if the function is real, continuous,
and changes sign.

f ​(​x​)

x​ℓ x​ ​u​x

Figure 2 ​If the function ​f ​(x​ ​) ​does not change sign between the two points, roots of the equation ​f
(​x​) ​= ​0 ​may still exist between the two points.

Bisection Method ​03.03.3

f (​ ​x)​
f ​(​x​)

u​
x​ℓ ​x​ x
x​ℓ x​ u​ x​

Figure 3 ​If the function ​f ​(x​ ​) ​does not change sign between two points, there may not be
any roots for the equation ​f ​(x​ ​) ​= ​0 ​between the two points.

f ​(​x​)

u​
x​ x
x​ℓ

Figure 4 ​If the function ​f ​(x​ ​) ​changes sign between the two points, more than one root for the
equation ​f (​ ​x​) ​= ​0 ​may exist between the two points.

Is the root now between ​ x​ ​and ​mx​ o​ r between ​mx​ a​ nd ​u x​ ​? Well, one can find the sign of ​( ) ( )
m ​f x f x ​ ​, and if ​f ​(​x​ ​) ​f ​(​x​m ​) ​< ​0 ​then the new bracket is between ​ ​x ​and ​m​x ​, otherwise, it is
between ​m​x ​and ​u ​x .​ So, you can see that you are literally halving the interval. As one repeats
this process, the width of the interval [ ​ ] ​u ​x ​, ​x 
​ becomes
​ smaller and smaller, and you can
zero in to the root of the equation ​f ​(​x​) ​= ​0 ​. The algorithm for the bisection method is given
as follows.
03.03.4 ​Chapter 03.03
Algorithm for the bisection method
The steps to apply the bisection method to find the root of the equation ​f ​(​x​) ​= ​0 ​are 1. Choose
 ​x a ​ nd u​ x​ a​ s two guesses for the root such that ​( ) ( ) ​< ​0 u​ f​ x f x 
​ ​, or in other words, ​f
(​x​) ​changes sign between  ​ x​ ​and u​ ​x ​.
2. Estimate the root, ​m​x ​, of the equation ​f (​ ​x​) ​= ​0 ​as the mid-point between ​ x​ ​and ​u x​ ​as
​
x​ +
xx
m

​ ​
u
2=
3. Now check the following
​ )​ ​f (​ ​xm​ ​) ​< ​0 ​, then the root lies between ​ x​ a​ nd ​mx​ ;​ then ​  x​ ​= ​x ​and ​u m ​x =
a) If ​f (​ ​x ​
x ​.
b) If ​f ​(​x ​ ​) ​f ​(​x​m ​) ​> ​0 , then the root lies between m​ x​ a​ nd u​ ​x ​; then ​m ​x ​= ​x 
​ ​and ​u u ​x ​= ​x
.
c) If ​f (​ ​x​ )​ ​f ​(​x​m ​) ​= ​0 ; then the root is ​mx​ .​ Stop the algorithm if this is true.
4. Find the new estimate of the root
​
x​ +
xx
m

​ ​
u
2=

​Find the absolute relative approximate error as ​

100
-​
= ​new
xx
new old
∈⋅
mm
a​
x m
where

​
new

m​x ​= estimated root from present iteration

​
old

x ​= estimated root from previous iteration

m​
5. Compare the absolute relative approximate error ​∈​a with ​ the pre-specified relative error
tolerance ​∈​s .​ If ​∈​a >∈​
​ s​ , then go to Step 3, else stop the algorithm. Note one should
also check whether the number of iterations is more than the maximum number of
iterations allowed. If so, one needs to terminate the algorithm and notify the user
about it.

Example 1
You are working for ‘DOWN THE TOILET COMPANY’ that makes floats for ABC
commodes. The floating ball has a specific gravity of 0.6 and has a radius of 5.5 cm. You are
asked to find the depth to which the ball is submerged when floating in water.
The equation that gives the depth ​x ​to which the ball is submerged under water is given
by ​0.165 3.993 10 0 3​ 2 4 ​− + ⋅ = −​ ​x x
Use the bisection method of finding roots of equations to find the depth ​x t​ o which the ball
is submerged under water. Conduct three iterations to estimate the root of the above
equation. Find the absolute relative approximate error at the end of each iteration, and the
number of significant digits at least correct at the end of each iteration.

Bisection Method ​03.03.5

Solution
From the physics of the problem, the ball would be submerged between ​x ​= ​0 ​and ​x ​= ​2​R ,​
where
R= ​ ​radius of the ball,
that is
0 ​≤ ​x ≤
​ ​2​R
0 ​≤ ​x ≤ ​ ​2(0.055)
0 ​≤ ​x ≤​ ​0.11

​Figure 5 ​Floating ball problem.

Lets us assume
​
= ​0, ​= ​0.11 ​u ​x x 
Check if the function changes sign between ​ x​ ​and ​u ​x .​
3244​
( ) (0) (0) 0.165(0) 3.993 10 3.993 10 −​ − ​f x​ =
​ ​ −+⋅=⋅
​f =
 3​
244​
( ) (0.11) (0.11) 0.165(0.11) 3.993 10 2.662 10 −​ − ​f x​u = ​ −+⋅=−⋅
​ ​f =
Hence
( ) ( ) (0) (0.11) (3.993 10 )( 2.662 10 ) 0 4​ 4 ​= = ⋅ − ⋅ < −​ − ​f x f x f f ​ ​u
So there is at least one root between ​ x​ ​and ​u ​x ,​ that is between 0 and
0.11. ​Iteration 1
The estimate of the root is
+​ 
x​ = ​
u
m
x x ​2
0 ​+ ​0.11 ​
=
​
2
​= ​0.055
( ) ( ) ( ) ( ) 3​ 2 4 5 ​0.055 0.055 0.165 0.055 3.993 10 6.655 10 −​ − ​f x​m ​= ​f
= − + ⋅ = ⋅ ​( ) ( ) (0) (0.055) ​(3​ .993 10 ​)(​6.655 10 ​) ​0 4​ 4 ​= = ⋅ ⋅ > −​ − ​f x f
x f f ​ ​m
03.03.6 ​Chapter 03.03

Hence the root is bracketed between ​m​x ​and ​u ​x ,​ that is, between 0.055 and 0.11. So, the lower
and upper limit of the new bracket is
​
= ​0.055, ​= ​0.11 ​u x​ x 
At this point, the absolute relative approximate error ​∈​a cannot
​ be calculated as we do not
have a previous approximation.
Iteration 2
The estimate of the root is
+​ 
x​ = ​
u
m
x x ​2
0.055 ​+ ​0.11 ​
=
​
2
​= ​0.0825
3​
244​
( ) (0.0825) (0.0825) 0.165(0.0825) 3.993 10 1.622 10 −​ − ​f xm​ ​= ​f ​= − + ⋅
= − ⋅ (​ ) ( ) (​0.055​) (​0.0825​) ​(​6.655 10 ) ​ ( ​1.622 10 )
​ ​0 5​ 4 ​= = ⋅ ⋅ − ⋅ < −​ −
f x f x f f ​ ​m
Hence, the root is bracketed between  ​ ​x a​ nd m​ ​x ​, that is, between 0.055 and 0.0825. So the
lower and upper limit of the new bracket is
x ​ =
​ ​0.055, ​x​u ​= ​0.0825
The absolute relative approximate error ​∈​a ​at the end of Iteration 2 is
new old
xx
−​
⋅​ ∈=
100 ​new
mm
a​ m
x
 0.0825 0.055​ − ​
⋅​ =
​100
0.0825
​= ​33.33%
None of the significant digits are at least correct in the estimated root of ​x​m ​= ​0.0825 ​because
the absolute relative approximate error is greater than 5%.
Iteration 3
+​ 
x​ = ​
u
m
x x ​2
0.055 ​+ ​0.0825 ​
=
​
2
​= ​0.06875
3245​
( ) (0.06875) (0.06875) 0.165(0.06875) 3.993 10 5.563 10 −​ − ​f x​m ​= ​f = ​ −+⋅
= − ⋅ ​( ) ( ) (0.055) (0.06875) (6.655 10 ) ( 5.563 10 ) 0 5​ 5 ​= = ⋅ ⋅ − ⋅ < −​ ​f x f x f f
 ​m
Hence, the root is bracketed between ​ x​ a​ nd ​m​x ​, that is, between 0.055 and 0.06875. So the
lower and upper limit of the new bracket is
​
= ​0.055, ​= ​0.06875 ​u x​ x 
The absolute relative approximate error ​∈​a at​ the ends of Iteration 3 is
Bisection Method ​03.03.7

new old
xx
−​
⋅​ ∈=
100 ​new
mm
a​ m
x
0.06875 0.0825​ − ​
⋅​ =
​100
0.06875
​= ​20%
Still none of the significant digits are at least correct in the estimated root of the equation as
the absolute relative approximate error is greater than 5%.
Seven more iterations were conducted and these iterations are shown in Table 1.

​Table 1 ​Root of ​f (​ ​x)​ ​= ​0 ​as function of number of iterations for bisection method.
Iteration ​x u​ x x
m​ ∈​a %
​
( ) ​m ​f x

1 0.00000 0.11 0.055 ---------- ​ 6.655 10​− ​⋅

5​

2 0.055 0.11 0.0825 33.33 4​

1.622 10​− ​−
⋅

3 0.055 0.0825 0.06875 20.00 5​

5.563 10​− ​−
 ⋅

4 0.055 0.06875 0.06188 11.11 ​ 4.484 10​− ​⋅

6​

5 0.06188 0.06875 0.06531 5.263 5​

2.593 10​− ​−
⋅

6 0.06188 0.06531 0.06359 2.702 5​

1.0804 10​− ​− ⋅

7 0.06188 0.06359 0.06273 1.370 6​

3.176 10​− ​−
⋅

8 0.06188 0.06273 0.0623 0.6897 ​ 6.497 10​− ​⋅

7​

9 0.0623 0.06273 0.06252 0.3436 6​

1.265 10​− ​−
⋅

10 0.0623 0.06252 0.06241 0.1721 7​

3.0768 10​− ​− ⋅

At the end of 10​th ​iteration,

∈​a ​= ​0.1721%
Hence the number of significant digits at least correct is given by the largest value of ​m ​for
which
m
−​
∈ ≤ ⋅ 2​
0.5 10 ​a
−​m ​
≤ ⋅ 2​ ​0.1721 0.5 10
≤ ​ 0.3442 10
−​m ​ 2 ​

log(0.3442) ​≤ ​2 ​− ​m
m ​≤ ​2 ​− ​log(0.3442) ​= ​2.463
So
m= ​ ​2
The number of significant digits at least correct in the estimated root of ​0.06241 ​at the end of
the th​ ​10 ​iteration is 2.

Advantages of bisection method

a) The bisection method is always convergent. Since the method brackets the root, the
method is guaranteed to converge.
b) As iterations are conducted, the interval gets halved. So one can guarantee the
error in the solution of the equation.
03.03.8 ​Chapter 03.03

Drawbacks of bisection method

a) The convergence of the bisection method is slow as it is simply based on halving
the interval.
b) If one of the initial guesses is closer to the root, it will take larger number of
iterations to reach the root.
 c) If a function ​f ​(​x)​ ​is such that it just touches the ​x -​ axis (Figure 6) such as ​(
​ ​x =
) 0 2​ ​f x = ​
​it will be unable to find the lower guess, ​ x​ ​, and upper guess, ​u ​x ​, such that ​(
​
) ( ) ​< ​0 u​ ​f x f x 
d) For functions ​f (​ ​x)​ ​where there is a singularity​1 ​and it reverses sign at the
singularity, the bisection method may converge on the singularity (Figure 7). An
example includes
1​
f x​ ( ) ​=
x
​where ​x​ =​ −​ 2 , ​
x ​
u​ = ​
3 are valid initial guesses which satisfy
​
( ) ( ) ​< ​0 ​u f​ x f x 
However, the function is not continuous and the theorem that a root exists is also
not applicable.
f ​(​x​)

​Figure 6 ​The equation ​( ) 0 2​ ​f x ​= ​x ​= ​has a single root at ​x ​= ​0 ​that cannot be bracketed.

1​
A singularity in a function is defined as a point where the function becomes infinite. For example, for a function
such as ​1/ ​x ,​ the point of singularity is ​x ​= ​0 ​as it becomes infinite.

Bisection Method ​03.03.9

 f ​(​x​)

1 ​= = ​
​Figure 7 ​The equation ​( ) ​0 ​ x
​ as no root but changes sign.
fxh

NONLINEAR EQUATIONS
Topic Bisection method of solving a nonlinear equation
Summary These are textbook notes of bisection method of finding roots of nonlinear
equation, including convergence and pitfalls.
Major General Engineering
Authors Autar Kaw
Date January 15, 2012
Web Site http://numericalmethods.eng.usf.edu