Chapter 5
Chapter 5
Chapter 5:
Bisection Method
OBJECTIVE:
At the end of this chapter the student will learn how to use the bisection method as a
means to extract the root of an equation of one variable using a spread sheet
application (e.g. MS Excel, Libre Office Calc)
DISCUSSION:
One of the oldest and perhaps the simplest root finding method is the bisection
method. In this method, which is alternatively called binary chopping, interval halving,
or Bolzano’s method, we begin with the equation f(x) =0 and two values for x, say a and
b with a<b, which bracket a root of the given equation, i.e. there is a root s between a
and b. This is guaranteed by the Intermediate Value Theorem if f is continuous on the
interval [a,b] and f(a)f(b)<0. This latter condition, which we shall refer to as the sign
change condition, says that since f(x) changes sign from x=a to x=b, the graph of f
must cross the x-axis at some number s between a and b, and this number s is a root of
the given equation.
The method uses the midpoint of the interval [a,b]as the intial estimate x1 for the root
and is given by x1=(a+b)/2
The number x1 also divides the interval into two subintervals [a, x1] and [x1, b]. If f(x1) ≠
0, then the root we want is found in one of those intervals. We use the sign change
condition to determine which of these intervals contains the root. Thus, if f(a)(f x1) < 0,
we use the left subinterval. Otherwise, we use the right subinterval. We rename this
interval [a1, b1], and use its midpoint (a1+b1)/2 as the next estimate and so on.
While the algorithm for the bisection method is very simple, the rate of convergence of
the estimates to the true value is slow in the sense that several iterations may be
necessary before a desired level of accuracy is attained.
SAMPLE PROBLEMS:
Example 1: Find the real root of x^3-2x-5 @ [0,3] with e < 1x10^-6
Type the following parameters in your spreadsheet application (MS Excel or Libre Office
Calc)
1|P a ge
ISAT U CEA
where:
x-=lower limit
x+=upper limit
xi+1=midpoint
First, at iteration 0, input the lower and upper limits and get their midpoint.
Second, get the function of xi+1. This is done by simply substituting the value of xi+1 to
the equation
2|P a ge
ISAT U CEA
Fifth, get f(x-)*f(xi+1). This is the most crucial part of the method as its value will
determine the upper and lower limits in the next iteration.
Sixth, indicate in criteria whether f(x-)*f(xi+1) is lesser or greater than 0. Put x-=x-and
x+=xi+1 in update if criteria is <0. Otherwise, put x+=x+ and x-=xi+1+. In this example
f(x-)*f(xi+1) is greater than 0 so we put x+=x+ and x-=xi+1 in update.
3|P a ge
ISAT U CEA
(NOTE: If f(x-)*f(xi+1)<0, the lower limit x- will retain its value and upper limit x+
will be xi+1 in the next iteration. Otherwise, x+ will retain its value and x-=xi+1.
Read the discussion for the explanation.)
Based on the results, the new x- and x+ is 1.5 and 3 respectively. Do several iterations
until e<1x10^-6. In our case, the root is 2.094522
4|P a ge
ISAT U CEA
APPLICATION:
Determine the real root of the following equations until the estimated error e falls below
1x10^-6.
5|P a ge