Professional Documents
Culture Documents
3/11/2017 http://numericalmethods.eng.usf.edu 1
Basis of Bisection Method
Theorem An equation f(x)=0, where f(x) is a real continuous function,
has at least one root between xl and xu if f(xl) f(xu) < 0.
f(x)
x
x
xu
Figure 1 At least one root exists between the two points if the function is
real, continuous, and changes sign.
2
Basis of Bisection Method
f(x)
x x
xu
Figure 2 If function f x does not change sign between two points, roots
f x 0
of the equation may still exist between the two points.
3
Basis of Bisection Method
f(x)
f(x)
x xu
x x
x xu
4
Basis of Bisection Method
f(x)
xu
x
x
5
Algorithm for Bisection Method
6
Step 1
Choose xL and xu as two guesses for the root such that
f(xL)f(xu) < 0, or in other words, f(x) changes sign
between xL and xu. This was demonstrated in Figure 1.
f(x)
x
x
xu
Figure 1
7
Step 2
Estimate the root, xm of the equation f (x) = 0 as the mid
point between xL and xu as
f(x)
x xu
xm =
2
x xm
x
xu
Figure 5 Estimate of xm
8
Step 3
Now check the following
9
Step 4
a 100
m m
new
x m
where
xmold previous estimate of root
xmnew current estimate of root
10
Step 5
x3 0.165 x 2 3.993 10 4 0
a) Use the bisection method of finding roots of equations
to find the depth x to which the ball is submerged under
water. Conduct three iterations to estimate the root of the
above equation.
b) 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.
12
Example 1 Cont.
From the physics of the problem, the ball would be
submerged between x = 0 and x = 2R,
where R = radius of the ball,
that is
0 x 2R
0 x 20.055
0 x 0.11
Solution
Figure 7 http://numericalmethods.eng.usf.
Graph of the function f(x)
edu 14
Example 1 Cont.
Let us assume
x 0.00
xu 0.11
Check if the function changes sign between x and xu .
f xl f 0 0 0.1650 3.993 10 4 3.993 10 4
3 2
Hence
f xl f xu f 0 f 0.11 3.993 10 4 2.662 104 0
So there is at least on root between x and xu, that is between 0 and 0.11
http://numericalmethods.eng.usf.
edu 15
Example 1 Cont.
Iteration 1 x xu 0 0.11
The estimate of the root is xm 0.055
2 2
f xl f xm f 0 f 0.055 3.993 10 4 6.655 10 5 0
Hence the root is bracketed between xm and xu, that is, between 0.055
and 0.11. So, the lower and upper limits of the new bracket are
xl 0.055, xu 0.11
At this point, the absolute relative approximate error a cannot be
calculated as we do not have a previous approximation.
http://numericalmethods.eng.usf.
edu 17
Example 1 Cont.
Hence the root is bracketed between x and xm, that is, between 0.055
and 0.0825. So, the lower and upper limits of the new bracket are
xl 0.055, xu 0.0825
http://numericalmethods.eng.usf.
edu 19
Example 1 Cont.
xmnew xmold
a new
100
xm
0.0825 0.055
100
0.0825
33.333 %
None of the significant digits are at least correct in the estimate root of
xm = 0.0825 because the absolute relative approximate error is greater
than 5%.
http://numericalmethods.eng.usf.
edu 21
Example 1 Cont.
f xl f xm f 0.055 f 0.06875 6.655 10 5 5.563 10 5 0
Hence the root is bracketed between x and xm, that is, between 0.055
and 0.06875. So, the lower and upper limits of the new bracket are
xl 0.055, xu 0.06875
http://numericalmethods.eng.usf.
edu 22
Example 1 Cont.
xmnew xmold
a new
100
xm
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. http://numericalmethods.eng.usf.
edu 24
Table 1 Cont.
Table 1 Root of f(x)=0 as function of number of iterations for
bisection method.
Iteration x xu xm a % f(xm)
http://numericalmethods.eng.usf.
edu 25
Table 1 Cont.
Always convergent
The root bracket gets halved with each
iteration - guaranteed.
http://numericalmethods.eng.usf.
edu 27
Drawbacks
Slow convergence
If one of the initial guesses is close to
the root, the convergence is slower
http://numericalmethods.eng.usf.
edu 28
Drawbacks (continued)
f x x 2
http://numericalmethods.eng.usf.
edu 29
Drawbacks (continued)
f x
f(x)
1
x
x
http://numericalmethods.eng.usf.
edu 30