A Parallel Implementation of the Durand-Kerner Algorithm for Polynomial Root-Finding on GPU

Kahina Ghidouche, Raphaïl Couturier,Abderrahmane Sider

INDS '14 Proceedings of the 2014 International Conference on Advanced Networking Distributed Systems and Applications（2014）

引用 5|浏览1

暂无评分

摘要

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 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.

查看译文

关键词

polynomial root-finding, high degree, iterative methods, durant-kerner method, gpu, cuda, parallelization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要