| Asynchronous Parallel Algorithm for Finding All Zeros of a Polynomial |
| |
| 作者姓名： | CUI Xiang-zhao YANG Da-di CHEN Jun-ming |
| |
| 摘 要： | 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.
|
| 关 键 词： | polynomial all zeros asynchronism parallel algorithm |
| 修稿时间： | 2003/2/20 0:00:00 |
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].Storage & Process,2003(7):56-58. |
| |
| Authors: | CUI Xiang-zhao YANG Da-di CHEN Jun-ming |
| |
| 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 |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
| 点击此处可从《保鲜与加工》下载免费的PDF全文 |
