Issue No. 03 - March (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21130
A parallel algorithm for extracting the roots of a polynomial is presented. The algorithm is based on Graeffe's method, which is rarely used in serial implementations, because it is slower than many common serial algorithms, but is particularly well suited to parallel implementation. Graeffe's method is an iterative technique, and parallelism is used to reduce the execution time per iteration.
highly parallel algorithm; root extraction; roots of a polynomial; iterative technique; interprocessor communication; SIMD machine; arithmetic complexity; computational complexity; iterative methods; parallel algorithms; polynomials.
T.A. Rice, L.H. Jamieson, "A Highly Parallel Algorithm for Root Extraction", IEEE Transactions on Computers, vol. 38, no. , pp. 443-449, March 1989, doi:10.1109/12.21130