A parallel implementation of the Durand-Kerner algorithm for polynomial root-finding on GPU

被引：4

作者：

Ghidouche, Kahina ^{[1
]}

Couturier, Raphael ^{[2
]}

Sider, Abderrahmane ^{[1
]}

机构：

[1] Univ A Mira Bejaia, LIMED Lab, Bejaia, Algeria

[2] Univ Franche Comte, FEMTO ST Inst, IUT Belfort Montbeliard, F-90016 Belfort, France

来源：

2014 International Conference on Advanced Networking Distributed Systems and Applications (INDS 2014) | 2014年

关键词：

polynomial root-finding; high degree; iterative methods; Durant-Kerner method; GPU; CUDA; Parallelization;

D O I：

10.1109/INDS.2014.17

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：53 / 57

页数：5

共 50 条

[21] Real polynomial root-finding by means of matrix and polynomial iterations
Pan, Victor Y.
Zhao, Liang
THEORETICAL COMPUTER SCIENCE, 2017, 681 : 101 - 116
[22] Real Polynomial Root-Finding by Means of Matrix and Polynomial Iterations
Pan, Victor Y.
COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2014, 2014, 8660 : 335 - 349
[23] Quantum algorithm for the root-finding problem
Nagata, Koji
Nakamura, Tadao
QUANTUM STUDIES-MATHEMATICS AND FOUNDATIONS, 2019, 6 (01) : 135 - 139
[24] On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step
Zhu, L
APPLIED MATHEMATICS AND COMPUTATION, 2004, 157 (03) : 623 - 636
[25] Quantum algorithm for the root-finding problem
Koji Nagata
Tadao Nakamura
Quantum Studies: Mathematics and Foundations, 2019, 6 : 135 - 139
[26] ON THE EFFICIENCY OF KUHN ROOT-FINDING ALGORITHM
WANG, ZK
KEXUE TONGBAO, 1982, 27 (09): : 1023 - 1023
[27] ON THE PARALLEL ARITHMETIC COMPLEXITY OF THE ROOT-FINDING PROBLEM
DATTA, K
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1987, 22 (01) : 99 - 104
[28] New progress in real and complex polynomial root-finding
Pan, Victor Y.
Zheng, Ai-Long
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 61 (05) : 1305 - 1334
[29] ON APPROXIMATE ZEROS AND ROOT-FINDING ALGORITHMS FOR A COMPLEX POLYNOMIAL
KIM, MH
MATHEMATICS OF COMPUTATION, 1988, 51 (184) : 707 - 719
[30] The amended DSeSC power method for polynomial root-finding
Pan, VY
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2005, 49 (9-10) : 1515 - 1524

← 1 2 3 4 5 →