求多项式全部零点的快速并行Halley算法  

The fast and parallel Halley algorithm for finding all zeros of a polynomial

作　　者：王秋华[1] 张新东[1] 

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830046

出　　处：《山东大学学报（理学版）》2007年第11期114-120,共7页Journal of Shandong University(Natural Science)

摘　　要：在Halley圆盘迭代法的基础上,用圆盘算术构造了一种求多项式全部零点的快速并行Halley算法,并在与Halley迭代法相同的条件下建立了其收敛性定理,该算法取得了10阶收敛速度。Based on the Halley cicular iteration method, a fast Halley algorithm was constructed by cicular arithmetic for finding all zeros of a polynomial, and the convergence rate was established trader the same condition as that for the Halley iteration method, the convergence rate of 10 order was obtained.

关 键 词：迭代 多项式 全部零点 圆盘迭代 

分 类 号：O241.7[理学—计算数学] O246[理学—数学]