
 Rootfinding algorithm  Wikipedia, the free encyclopedia 
  The simplest rootfinding algorithm is the bisection method: we start with two points a and b which bracket a root, and at every iteration, we pick either the subinterval [a, c] or [c, b], where c = (a + b) / 2 is the midpoint between a and b. 
  A rootfinding algorithm is a numerical method or algorithm for finding a value x such that f(x) = 0, for a given function f. 
  The bisection method is guaranteed to converge to a root, however, its progress is rather slow (the rate of convergence is linear). 
 www.wikipedia.org /wiki/Rootfinding_algorithm (765 words) 
