首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求多项式全部零点的异步并行算法
引用本文:崔向照,杨大地,陈均明.求多项式全部零点的异步并行算法[J].重庆大学学报(自然科学版),2003,26(7):56-58.
作者姓名:崔向照  杨大地  陈均明
作者单位:[1]蒙自师范高等专科学校数学系,云南蒙自661100 [2]重庆大学数理学院,重庆400044
摘    要:基于用圆盘算术求多项式全部零点的并行Halley迭代法虽然避免了颇为费事的圆盘开方运算,能同时求得多项式全部零点的带误差估计的近似值,并且具有很高的收敛速度,但它是同步并行算法。这里用圆盘算术构造了一种求多项式全部零点的异步并行算法,并在与Halley迭代法类似的条件下建立了它的收敛性定理。该算法不仅保持了Halley迭代法的优点,而且具有更好的并行性。

关 键 词:多项式  全部零点  异步  并行算法
文章编号:1000-582X(2003)07-0056-03
修稿时间:2003年2月20日

Asynchronous Parallel Algorithm for Finding All Zeros of a Polynomial
CUI Xiang-zhao,YANG Da-di,CHEN Jun-ming.Asynchronous Parallel Algorithm for Finding All Zeros of a Polynomial[J].Journal of Chongqing University(Natural Science Edition),2003,26(7):56-58.
Authors:CUI Xiang-zhao  YANG Da-di  CHEN Jun-ming
Institution:CUI Xiang-zhao 1,2,YANG Da-di 1,CHEN Jun-ming 1
Abstract: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.
Keywords:polynomial  all zeros  asynchronism  parallel algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号