Parallel Polynomial Root Extraction on A Ring of Processors
Page 276.1
Abstract
In this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand-Kerner's method and consists of two phases: initialization, and iteration. In the initialization phase all the necessary preparation steps are realized to start the parallel computation. It includes register initialization and initial approximation of roots requiring 3n-2 communications, 2 exponentiation, one multiplications, 6 divisions, and 4n-3 additions. In the iteration phase, these initial approximated roots are corrected repeatedly and converge to their accurate values. The iteration phase is composed of some iteration steps, each consisting of 3n communications, 4n+3 additions, 3n+1 multiplications, and one division.
References
[1]
M. Cosnard, P. Fraigniaud, Analysis of asynchronous polynomial root finding methods on a distributed memory multicomputer, IEEE Trans. Parallel & Distributed Systems, 5, 1994, pp. 639-648.
[2]
R. Couturier, P. Canalda, F. Spies, Iterative algorithms on network computing: parallel polynomial root extracting, Proceedings of IEEE HiPC 2002, 10-12 Dec., India, LNCS 2552, pp. 283-291.
[3]
D.L. Eager, J. Zahorjan, E.D. Lazowska, Speed versus efficiency in parallel systems, IEEE Trans. Computers, 38, 1989, pp. 408-423.
[4]
S. Oberman, Design issues in high performance floating point arithmetic units, PhD thesis, Stanford Univ., Nov. 1996.
[5]
Lin Zhong, Modular exponentiation algorithm analysis for energy consumption and performance, Technical Report CE-01-ZJL, Department of Electrical Engineering, Princeton University, USA, 2000.
[6]
H. Sarbazi-Azad, M. Ould-khaoua, L. Mackenzie and S.G. Akl, A parallel algorithm for Lagrange interpolation on the star graph, Journal of Parallel and Distributed Computing, 62, 2002, pp. 605-621.
Index Terms
- Parallel Polynomial Root Extraction on A Ring of Processors
Recommendations
The performance of synchronous parallel polynomial root extraction on a ring multicomputer
AbstractIn this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand–Kerner’s method and consists of two phases: initialisation, and iteration. In the ...
A Highly Parallel Algorithm for Root Extraction
A parallel algorithm for extracting the roots of a polynomial is presented. The algorithm is based on Graeffe's method, which is rarely used in serial implementations, because it is slower than many common serial algorithms, but is particularly well ...
Comments
Information & Contributors
Information
Published In
April 2005
ISBN:0769523129
Publisher
IEEE Computer Society
United States
Publication History
Published: 04 April 2005
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Sep 2024