Bracketing Methods
(Bisection)
Jannatim Maisha
Bracketing Methods
Bracketing methods (also known as interpolation methods) start with initial
guesses that ‘bracket’ the root and then systematically reduce the width of the
bracket until the solution is reached.
Two popular method under this category are:
1. Bisection method
2. False position method
Bisection Method
The bisection method (also known as binary chopping or half-interval method)
is one of the simplest and most reliable of iterative methods for the solution of
nonlinear equations. This method based on the repeated application of the
intermediate value theorem.
Intermediate Value Theorem: If f (x) is a continuous function is some interval
[a, b] and f (a) and f (b) are of opposite signs, then the equation f (x) = 0 has at
least one real root or an odd number of real roots in (a, b) if f(a) f(b) < 0.
Bisection Method
Bisection Method
Slopping Criterion
EXAMPLE OF BISECTION
METHOD
BISECTION METHOD
Find a root of an equation 𝒇(𝒙) = 𝒙 𝟑 − 𝒙 − 𝟏 using Bisection method
for the interval [0,2] and given predefined relative error ∈𝒓 = 0.01
Solution:
1st iteration :
Here 𝑓 ( 1 ) = −1 < 0 𝑎𝑛𝑑 𝑓 ( 2 ) = 5 > 0
∴ Now, Root lies between 1 and 2
1+2
𝑥 o= = 1.5
2
𝑓 𝑥0 = 𝑓 1.5 = 0.875 > 0
1.5–1
relative error = 1.5
= 0.33
2nd iteration :
𝐻𝑒𝑟𝑒 𝑓 ( 1 ) = −1 < 0 𝑎𝑛𝑑 𝑓(1.5) = 0.875 > 0
∴ Now, Root lies between 1 and 1.5
1+1.5
𝑥1 = = 1.25
2
𝑓(𝑥 1 ) = 𝑓(1.25) = −0.29688 < 0
1.25–1.5
relative error = 1.25
= 0.2
3rd iteration :
𝐻𝑒𝑟𝑒 𝑓(1.25) = −0.29688 < 0 𝑎𝑛𝑑 𝑓(1.5) = 0.875 > 0
∴ Now, Root lies between 1.25 and 1.5
1.25+1.5
𝑥2 = =1.375
2
𝑓(𝑥 2 ) = 𝑓(1.375) = 0.22461 > 0
1.375–1.25
Relative error = 1.375
= 0.09
4th iteration :
𝐻𝑒𝑟𝑒 𝑓(1.25) = −0.29688 < 0𝑎𝑛𝑑 𝑓(1.375) = 0.22461 > 0
∴ Now, Root lies between 1.25 and 1.375
1.25 + 1.375
𝑥3 = = 1.3125
2
𝑓(𝑥 3 ) = 𝑓(1.3125) = −0.05151 < 0
1.3125–1.375
Relative error = = 0.04
1.3125
5th iteration
:
𝐻𝑒𝑟𝑒 𝑓(1.3125) = −0.05151 < 0 𝑎𝑛𝑑 𝑓(1.375) = 0.22461 > 0
∴ Now, Root lies between 1.3125 and 1.375
𝑥4 = 1.3125+1.375 =1.34375
2
𝑓(𝑥 4 ) = 𝑓(1.34375) = 0.08261 > 0
1.34375- 1 .3125
Relative error = = 0.02
1.34375
6th iteration :
𝐻𝑒𝑟𝑒 𝑓(1.3125) = −0.05151 < 0 𝑎𝑛𝑑 𝑓(1.34375) = 0.08261 > 0
∴ Now, Root lies between 1.3125 and 1.34375
𝑥5 = 1.3125+1.34375 =1.32812
2
𝑓(𝑥 5 )=𝑓(1.32812) = 0.01458 > 0
1.32812-1.34375
Relative error = = 0.01
1.32812
7th iteration
:
𝐻𝑒𝑟𝑒 𝑓(1.3125) = −0.05151 < 0 𝑎𝑛𝑑 𝑓(1.32812) = 0.01458 > 0
∴ Now, Root lies between 1.3125 and 1.32812
1.3125 + 1.32812
𝑥6 = = 1.32031
2
𝑓 𝑥6 = 𝑓 1.32031 = −0.01871 < 0
1.32031–1.32812 = 0.005
Relative error =
1.32031
Relative error is <0.01 after 7th iteration, so approximation root is: 1.32031
Iteration Table for Bisection Method:
𝒂 +𝒃 Relativ
itr a f(a) b f(b) 𝒄= f(c) Update
𝟐 e
error
1 1 -1 2 5 1.5 0.875 b=c 0.33
2 1 -1 1.5 0.875 1.25 -0.29688 a=c 0.2
3 1.25 -0.29688 1.5 0.875 1.375 0.22461 b=c 0.09
4 1.25 -0.29688 1.375 0.22461 1.3125 -0.05151 a=c 0.04
5 1.3125 -0.05151 1.375 0.22461 1.34375 0.08261 b=c 0.02
6 1.3125 -0.05151 1.34375 0.08261 1.32812 0.01458 b=c 0.01
7 1.3125 -0.05151 1.32812 0.01458 1.32031 -0.01871 a=c 0.005
Your turn
Find real root of the equation f (x) = x^2 – 4x – 10 = 0 using Bisection
Method.
