Evaluating numerical algorithm
The Bisection Method is a straightforward and reliable numerical technique used to find roots (solutions) of continuous functions. It works by repeatedly dividing an interval in half and selecting the subinterval where the function changes sign, thereby narrowing down the location of the root.
Find the root of using the Bisection Method with tolerance error margin .
First, set the equation to zero to get our standard function :
Choose two initial points and such that and have opposite signs. Let's choose and :
Since and , a root must lie in !
Calculate the midpoint of the interval :
Since and , both left points are negative. The sign change happens between and .
| Step (k) | Left Bound (a) | Right Bound (b) | Midpoint (C) | Value f(C) | Sign of f(C) | Next Interval |
|---|---|---|---|---|---|---|
| 1 | 0.0000 | 3.0000 | 1.5000 | -1.7500 | f(1.5) < 0 | [1.5000, 3.0000] |
| 2 | 1.5000 | 3.0000 | 2.2500 | +1.0625 | f(2.25) > 0 | [1.5000, 2.2500] |
| 3 | 1.5000 | 2.2500 | 1.8750 | -0.4844 | f(1.875) < 0 | [1.8750, 2.2500] |
| 4 | 1.8750 | 2.2500 | 2.0625 | +0.2539 | f(2.0625) > 0 | [1.8750, 2.0625] |
| 5 | 1.8750 | 2.0625 | 1.9688 | -0.1240 | f(1.9688) < 0 | [1.9688, 2.0625] |
| 6 | 1.9688 | 2.0625 | 2.0156 | +0.0627 | f(2.0156) > 0 | [1.9688, 2.0156] |
| 7 | 1.9688 | 2.0156 | 1.9922 | -0.0311 | f(1.9922) < 0 | [1.9922, 2.0156] |
| 8 | 1.9922 | 2.0156 | 2.0039 | +0.0156 | f(2.0039) > 0 | [1.9922, 2.0039] |
The Bisection Method guarantees convergence as long as you start with points that bracket the root. Notice how the interval width cut in half at every single step () until it dropped below the target error margin , yielding our root estimate of !