Concurrent Algorithms for Root Searching

Ole Eriksen; Jørgen Staunstrup

doi:10.7146/dpb.v11i147.7421

Concurrent Algorithms for Root Searching

Authors

Ole Eriksen
Jørgen Staunstrup

DOI:

https://doi.org/10.7146/dpb.v11i147.7421

Abstract

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.

Author Biographies

Ole Eriksen

Jørgen Staunstrup

Downloads

Published

1982-07-01

How to Cite

Eriksen, O., & Staunstrup, J. (1982). Concurrent Algorithms for Root Searching. DAIMI Report Series, 11(147). https://doi.org/10.7146/dpb.v11i147.7421