摘要
本文讨论了一个求多项式根的同步并行算法,它是halley迭代的一种修正。证明了这种算法具四阶敛速,在用Halley迭代进行再次修正后,收敛阶至少是6。最后指出再次修正几乎不增加计算量。
This paper discusses a simultaneous method which can determine theroots of a polynomial. It is a modification of Halley iteration. It isproved that this method is the 4th order convergent. After the secondmodification by the use of Halley iteration, the order of the method is atleast 6. Finally, this paper points out that the second modificationrequires essentially no more operations.
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
1991年第1期7-13,共7页
Journal of Lanzhou University(Natural Sciences)
关键词
多项式
根
迭代法
收敛阶
polynomial
root
iteration method
convergence order