A parallel implementation of the Durand-Kerner algorithm for polynomial root-finding on GPU
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | A parallel implementation of the Durand-Kerner algorithm for polynomial root-finding on GPU |
| Type de publication | Conference Paper |
| Year of Publication | 2014 |
| Auteurs | Ghidouche K, Couturier R, Sider A |
| Conference Name | 2014 International Conference on Advanced Networking Distributed Systems and Applications (INDS 2014) |
| Publisher | IEEE |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-4799-5178-9 |
| Mots-clés | CUDA, Durant-Kerner method, GPU, high degree, iterative methods, Parallelization, polynomial root-finding |
| Résumé | In this article we present a parallel implementation of the Durand-Kerner algorithm to find roots of polynomials of high degree on a GPU architecture (Graphics Processing Unit). We have implemented both a CPU version in C and a GPU compatible version with CUDA. The main result of our work is a parallel implementation that is 10 times as fast as its sequential counterpart on a single CPU for high degree polynomials that is greater than about 48,000. |
| DOI | 10.1109/INDS.2014.17 |