Use this tag for questions related to the bisection method, which is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing.
The bisection method is a root-finding method that bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a simple and robust method, but it is also slow, hence its use is often restricted to obtaining quickly a starting point for more rapidly-converging methods. The bisection method is also called the interval halving method, binary search method, or dichotomy method.
