Bisection Method
The bisection method in mathematics is a root-finding method which repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method,
but it is also relatively slow. Because of this, it is often used to obtain a
rough approximation to a solution which is then used as a starting point for
more rapidly converging methods. The
method is also called the binary
search method and is similar
to the Binary Search algorithm in computing, where the range of possible solutions is halved
each iteration.
