Iteration methods for finding all zeros of a polynomial simultaneously 论文
1973Mathematics of Computation引用 315
Iterative Methods for Nonlinear EquationsMatrix Theory and AlgorithmsAdvanced Optimization Algorithms Research
摘要
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.