The Bisection Method is a simple numerical technique used to find the root of a continuous function. It works by dividing an interval [a, b] into two halves and repeatedly narrowing down the interval where the root lies, based on the sign change of the function. The method guarantees convergence if the function is continuous and there’s a sign change at the endpoints. While reliable, the Bisection Method is slower compared to other root-finding methods, especially for high precision.
The Bisection Method is a numerical technique used to find the root (or zero) of a function. This method works on the principle of dividing an interval into two subintervals, checking whether the root lies in the first or second subinterval, and then narrowing down the interval repeatedly until the root is found with the desired level of accuracy.
The formula used in the bisection method is:
Where:
The key idea is to check the function values at the midpoint and decide whether the root lies in the left half or the right half of the interval. The process is repeated until the interval becomes sufficiently small.
The application of the bisection method spans various fields, from engineering to physics and beyond. It's widely used in solving equations that do not have an analytical solution or when finding an exact root is too complicated. The bisection method guarantees convergence if the function is continuous and the initial interval contains the root.
In real-world applications, the bisection method plays a crucial role in solving engineering and physics problems. Some examples include:
Let’s look at an example of the bisection method applied to a simple function:
Suppose we want to find the root of the equation:
We know that f(x) has a root between 0 and 3, as:
Thus, the root lies between 0 and 3. Using the bisection method:
Since f(1.5) is negative, the root lies between 1.5 and 3.
Again, Calculate the mid-point
Since f(2.25) is positive, the root lies between 1.5 and 2.25.
Again, Calculate the mid-point
Since f(1.875) is negative, the root lies between 1.875 and 2.25.
Again, Calculate the mid-point
Since f(2.0625) is positive, the root lies between 1.875 and 2.0625.
Again, Calculate the mid-point
Since f(1.96875) is negative, the root lies between 1.96875 and 2.0625.
Again, Calculate the mid-point
Since f(2.015625) is positive, the root lies between 1.96875 and 2.015625.
Again, Calculate the mid-point
Since f(1.9921875) is negative, the root lies between 1.9921875 and 2.015625.
Again, Calculate the mid-point
Since ( f(2.00390625) is positive, the root lies between 1.9921875 and 2.00390625.
Again, Calculate the mid-point
Since f(1.998046875) is negative, the root lies between 1.998046875 and 2.00390625.
Again, Calculate the mid-point
Since f(2.0009765625) is positive, the root lies between 1.998046875 and 2.0009765625.
Again, Calculate the mid-point
Since f(1.99951171875) is negative, the root lies between 1.99951171875 and 2.0009765625.
Again, Calculate the mid-point
Since f(2.000244140625 is positive, the root lies between 1.99951171875 and 2.000244140625.
We repeat this process, updating the interval in each iteration, and get closer to the root each time. After several steps, we’ll find that the root is approximately x = 2.
The bisection method of finding roots is beneficial for cases where other methods (like Newton’s Method or Secant Method) might fail due to a lack of derivatives or initial guesses. The method’s strength lies in its reliability and simplicity, as it only requires that the function is continuous and that the root lies within the initial interval. However, it can be slower compared to other methods.
While the bisection method is reliable, it does come with certain limitations and challenges:
Here are a couple of bisection method problems to test your understanding:
(Session 2025 - 26)