cid f417fe6138bb9af6af95320ee55cf7b0b685d3f72c96eb3f49f62a82b94d5506 · original · open access · via wikipedia
Title: Bisection method Authors: Venue: Wikipedia Year: unknown Canonical: wiki:bisection-method URL: https://en.wikipedia.org/wiki/Bisection_method Collector: wikipedia OA: true ABSTRACT In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values, then selecting the subinterval in which the function changes sign, which therefore must contain a root. 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 interval halving method, the binary search method, or the dichotomy method.