Concurrent Algorithms for Root Searching

Concurrent algorithms for finding the root of a real continuous function are analyzed.A lower bound on the running time is given, this lower bound is obtained by a synchronous algorithm. A new asynchronous algorithm is discussed in detail and its running time is analyzed. Finally, the results from running the asynchronous algorithm on a multiprocessor are shown