You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
Mathematics of Computation
Vol. 27, No. 122 (Apr., 1973), pp. 339-344
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2005621
Page Count: 6
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Durand and Kerner independently have proposed a quadratically convergent iteration method for finding all zeros of a polynomial simultaneously. Here, a new derivation of their iteration equation is given, and a second, cubically convergent iteration method is proposed. A relatively simple procedure for choosing the initial approximations is described, which is applicable to either method.
Mathematics of Computation © 1973 American Mathematical Society