Академический Документы
Профессиональный Документы
Культура Документы
http://numericalmethods.eng.usf.
edu
03/09/15
http://numericalmethods.eng.usf.e
du
Bisection Method
http://numericalmethods.eng.usf
.edu
x
xu
Figure 1 At least one root exists between the two points if the
function is
real, continuous, and changes sign.
3
http://numericalmethods.eng.usf.edu
xu
http://numericalmethods.eng.usf.edu
f(x)
xu
xu
x
http://numericalmethods.eng.usf.edu
xu
f x
Figure 4 If the function
changes sign between two points,
more than one root for the
may exist
f x equation
0
between the two points.
6
http://numericalmethods.eng.usf.edu
http://numericalmethods.eng.usf.edu
Step 1
Choose x and xu as two guesses for the root such that
f(x) f(xu) < 0, or in other words, f(x) changes sign
between x and xu. This was demonstrated in Figure 1.
f(x)
x
xu
Figure 1
8
http://numericalmethods.eng.usf.edu
Step 2
Estimate the root, xm of the equation f (x) = 0 as
the mid point between x and xu as
f(x)
x xu
xm =
2
x
xm
xu
Figure 5
9
Estimate of xm
http://numericalmethods.eng.usf.edu
Step 3
Now check the following
f xl f xm 0
a) If
, then the root lies between x
and xm; then x = x ; xu = xm.
f xl f xm 0
b) If
, then the root lies between xm
and xu; then x = xm; xu = xu.
f xl f xm 0
c) If
; then the root is xm. Stop the
algorithm if this is true.
10
http://numericalmethods.eng.usf.edu
Step 4
Find the new estimate of the root
x xu
xm =
2
old
x new
x
m
m
new
m
100
where
xmold previous estimate of root
xmnew current estimate of root
11
http://numericalmethods.eng.usf.edu
Step 5
Compare the absolute relative approximate
error
a
with the pre-specified errortolerance
.
s
Yes
Go to Step 2 using
new upper and lower
guesses.
No
Is a s ?
http://numericalmethods.eng.usf.edu
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.
http://numericalmethods.eng.usf.edu
Example 1 Cont.
The equation that gives the depth x to which the
ball is submerged under water is given by
x 3 0.165 x 2 3.993 10 4 0
http://numericalmethods.eng.usf.edu
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 2 0.055
0 x 0.11
http://numericalmethods.eng.usf.edu
Example 1 Cont.
Solution
To aid in the
understanding of how
this method works to find
the root of an equation,
the graph of f(x) is shown
to the right,
http://numericalmethods.eng.usf.edu
Example 1 Cont.
Let us assume
x 0.00
xu 0.11
Check if the function changes sign between x
3
2
and xu .
4
Hence
http://numericalmethods.eng.usf.edu
Example 1 Cont.
18
Example 1 Cont.
Iteration 1
The estimate of the root isxm
x xu 0 0.11
0.055
2
2
19
http://numericalmethods.eng.usf.edu
Example 1 Cont.
http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 2
xm
The estimate of the root is
x xu 0.055 0.11
0.0825
2
2
21
http://numericalmethods.eng.usf.edu
Example 1 Cont.
http://numericalmethods.eng.usf.edu
Example 1 Cont.
The absolute relative approximate error
a
Iteration 2 is
at the end of
xmnew xmold
a
100
new
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%.
23
http://numericalmethods.eng.usf.edu
Example 1 Cont.
Iteration 3
The estimate of the root xism
x xu 0.055 0.0825
0.06875
2
2
24
http://numericalmethods.eng.usf.edu
Example 1 Cont.
http://numericalmethods.eng.usf.edu
Example 1 Cont.
The absolute relative approximate error
a
Iteration 3 is
at the end of
xmnew xmold
a
100
new
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.
26
http://numericalmethods.eng.usf.edu
Table 1 Cont.
Table 1 Root of f(x)=0 as function of number of iterations for
bisection method.
27
http://numericalmethods.eng.usf.edu
Table 1 Cont.
Hence the number of significant digits at least correct is given
by the largest value or m for which
a 0.5 10 2 m
0.1721 0.5 10 2 m
0.3442 10 2 m
log 0.3442 2 m
m 2 log 0.3442 2.463
So
m2
http://numericalmethods.eng.usf.edu
Advantages
29
Always convergent
The root bracket gets halved with
each iteration - guaranteed.
http://numericalmethods.eng.usf.edu
Drawbacks
30
Slow convergence
If one of the initial guesses is close
to the root, the convergence is
slower
http://numericalmethods.eng.usf.edu
Drawbacks (continued)
f x x
31
http://numericalmethods.eng.usf.edu
Drawbacks (continued)
1
f x
x
x
32
http://numericalmethods.eng.usf.edu
Additional Resources
For all resources on this topic such as digital
audiovisual lectures, primers, textbook chapters,
multiple-choice tests, worksheets in MATLAB,
MATHEMATICA, MathCad and MAPLE, blogs,
related physical problems, please visit
http://numericalmethods.eng.usf.edu/topics/bise
ction_method.html
THE END
http://numericalmethods.eng.usf.edu