On a simultaneous method of Newton–Weierstrass’ type for finding all zeros of a polynomial
作者:
Highlights:
•
摘要
Combining a suitable two-point iterative method for solving nonlinear equations and Weierstrass’ correction, a new iterative method for simultaneous finding all zeros of a polynomial is derived. It is proved that the proposed method possesses a cubic convergence locally. Numerical examples demonstrate a good convergence behavior of this method in a global sense. It is shown that its computational efficiency is higher than the existing derivative-free methods.
论文关键词:Root-finding methods,Polynomial zeros,Simultaneous methods,Convergence,Computational efficiency
论文评审过程:Available online 2 September 2009.
论文官网地址:https://doi.org/10.1016/j.amc.2009.08.048