Parallel methods for solving equations

Two classes of algorithms for equation solving are presented and analyzed. These algorithms have been devised in recent years because of the computational facility of the multiprocessor. The first class consists of parallel search methods while the second class consists of asynchronous methods. The first class of methods are fail safe. That is they always provide an approximation to the root as well as the smallest possible interval (for the work done) guaranteed to contain the root. The second class frees the intrinsically interlocked nature of the more complicated forms of algorithms designed for multiprocessors by omitting the synchrony usually demanded in computation. © 1978.