Bisection Method by Judith Koeller, University of Waterloo, Canada, jakoelle@math.uwaterloo.ca
Note: This worksheet demonstrates the the bisection method for finding roots of an equation.
2004 Judith Koeller The bisection method can be used to approximate a solution p to an equation f(p)=0 where f(x) is a continuous function. It calculates a sequence of values of c_1 c_1 c_1 , c_2, c_3,...., each of which if an approximation to the root p. It may take infinitely many c_i's to get to p, so we stop with a c_i whose distance from p is at most some small number that we choose.
Bisection Method
Start with a,b (such that a<b and f(a), f(b) have opposite signs). If f is continuous, by the Intermediate Value Theorem, there is a number p in [a,b] such that f(p)=0. The distance from a to b is |b-a|. So b is no further than |b-a| from the root p.
Let c_1 = 1 2 ⁢ a + 1 2 ⁢ b c_1 1 2 a 1 2 b c_1 = 1/2*a+1/2*b , which is the midpoint of [a,b]. Determine f(c_1). If f(a) and f(c_1) have the same sign, choose the next endpoints as [c_1,b]; if f(c_1) and f(b) have the same sign, choose the next endpoints as [a,c_1]. The size of either interval is 1 2 ⁢ b - a 1 2 b a 1/2*abs(b-a) , so p is no further from c_1 than 1 2 ⁢ b - a 1 2 b a 1/2*abs(b-a) .
We repeat this process as often as we need to, each time finding a new c_i half-way between the two endpoints. At each step, the distance between the endpoints becomes half as long, so our error is cut in half each time. We continue the process until the distance between the two endpoints is suitably short; we know that both our last c_i and our root p lie in a very small interval, therefore they must be very close together.
The following maplet demonstrates the bisection method to approximate a root to the function x 2 - 5 x 2 -5 x^2-5 . The "Next Step" button can be used to show the next c_i. The "Zoom" button can be changes the viewing rectangle of the graph to focus on the interval of bisection.