求多项式全部零点的异步并行算法  

Asynchronous Parallel Algorithm for Finding All Zeros of a Polynomial

作　　者：崔向照[1] 杨大地[1] 陈均明[1] 

机构地区：[1]重庆大学数理学院

出　　处：《重庆大学学报（自然科学版）》2003年第7期56-58,共3页Journal of Chongqing University

摘　　要：基于用圆盘算术求多项式全部零点的并行Halley迭代法虽然避免了颇为费事的圆盘开方运算 ,能同时求得多项式全部零点的带误差估计的近似值 ,并且具有很高的收敛速度 ,但它是同步并行算法。这里用圆盘算术构造了一种求多项式全部零点的异步并行算法 ,并在与Halley迭代法类似的条件下建立了它的收敛性定理。该算法不仅保持了Halley迭代法的优点 。Parallel Halley iteration method, based on circular arithmetic for finding all zeros of a polynomial, avoids troublesome circular extraction operation,and the approximation with error estimation of all zeros of a polynomial can be obtained at the same time with it, and it has higher convergence rate , while it was synchronous parallel algorithm. The asynchronous parallel algorithm was constructed with circular arithmetic in order to find all zeros of a polynomial, and the convergence theory was established under the similar condition of Halley iteration method. The algorithm not only retain the advantage of Halley iteration method, but has better parallelism.

关 键 词：多项式 全部零点 异步 并行算法 

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