Some parallel methods for polynomial root-finding

AbstractParallelizations of various different methods for determining the roots of a polynomial are discussed. These include methods which locate a single root only as well as those which find all roots. Some techniques for parallelizing such methods are identified and some examples are given. Further places in polynomial root-finding algorithms where parallel behaviour can be introduced are described. Results are presented for a range of programs written to test the effectiveness of methods presented here