A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros

By Merrell L. Patrick

Communications of the ACM, Vol. 15 No. 11, Pages 952-955
10.1145/355606.361872

An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros. The algorithm, which is conceptually suitable for parallel computation, determines its own starting values so that convergence to the zeros is guaranteed. Multiple zeros and their multiplicity are readily determined. At no point in the method is polynomial deflation used.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine