A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
- 1 November 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 15 (11) , 952-955
- https://doi.org/10.1145/355606.361872
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Über die Divergenzpunkte des Newtonschen Verfahrens zur Bestimmung von Wurzeln algebraischer Gleichungen. III.Publicationes Mathematicae Debrecen, 2022
- Parallel Methods for Approximating the Root of a FunctionIBM Journal of Research and Development, 1969
- Parallel numerical methods for the solution of equationsCommunications of the ACM, 1967
- Generalizations of Horner's Rule for Polynomial EvaluationIBM Journal of Research and Development, 1962