High Order Search Methods for Finding Roots

• class of search algorithms for locahng the root of a function is devised and studied. Each member of the class of algorithms is globally convergent as m the classical method of binary search However, the class contains members of higher order of convergence as well. These higher order methods require the existence of bounds on derivatives of the function whose root is sought and they proceed by exploiting these bounds.