科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we first establish a rational iteration method which can be used as a root-finding algorithm for almost every polynomial. It has no nonrepelling extraneous fixed point in the complex plane and is generally convergent for both quadratic and cubic polynomials. Then some properties of this algorithm are given. By the aid of computer, we produce pictures of the Julia sets for the iterations of some polynomials. Numerical results show that it is a root-finding method with convergence order the same as Halley's method.
- 出版日期2009-1
- 单位浙江大学
