Abstract
In 1984, Wang and Zheng (J. Comput. Math. 1984, 1, 70–76) introduced a new fourth order iterative method for the simultaneous computation of all zeros of a polynomial. In this paper, we present new local and semilocal convergence theorems with error estimates for Wang–Zheng’s method. Our results improve the earlier ones due to Wang and Wu (Computing 1987, 38, 75–87) and Petković, Petković, and Rančić (J. Comput. Appl. Math. 2007, 205, 32–52).
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference38 articles.
1. Local convergence of Chebyshev-like method for simultaneous finding polynomial zeros;Cholakov;Compt. Rend. Acad. Bulg. Sci.,2013
2. A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
3. Generalization of Ehrlich-Kjurkchiev method for multiple roots of algebraic equations;Iliev;Serdica Math. J.,1998
4. On a generalization of Obreshkoff-Ehrlich method for simultaneous inclusion of only part of all multiple roots of algebraic polynomials;Iliev;Comput. Math. Math. Phys.,2003
5. A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献