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 条
  • [41] A derivative-free root-finding algorithm using exponential method and its implementation
    Thota, Srinivasarao
    Awad, Mohamed M.
    Shanmugasundaram, P.
    Rathour, Laxmi
    BMC RESEARCH NOTES, 2023, 16 (01)
  • [42] Mcmullen's root-finding algorithm or cubic polynomials
    Hawkins, JM
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2002, 130 (09) : 2583 - 2592
  • [43] SPEED OF CONVERGENCE OF KUHN'S ROOT-FINDING ALGORITHM
    徐森林
    王则柯
    Science Bulletin, 1983, (09) : 1284 - 1284
  • [44] Quasi-analytical root-finding for non-polynomial functions
    Cleonice F. Bracciali
    Michael Carley
    Numerical Algorithms, 2017, 76 : 639 - 653
  • [45] Backward stability of polynomial root-finding using Fiedler companion matrices
    De Teran, Fernando
    Dopico, Froilan M.
    Perez, Javier
    IMA JOURNAL OF NUMERICAL ANALYSIS, 2016, 36 (01) : 133 - 173
  • [46] Inverse multivariate polynomial root-finding: Numerical implementations of the affine and projective Buchberger-Moller algorithm
    Batselier, Kim
    Wong, Ngai
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 320 : 15 - 29
  • [47] Quasi-analytical root-finding for non-polynomial functions
    Bracciali, Cleonice F.
    Carley, Michael
    NUMERICAL ALGORITHMS, 2017, 76 (03) : 639 - 653
  • [48] Real and Complex Polynomial Root-Finding by Means of Eigen-Solving
    Pan, Victor Y.
    Qian, Guoliang
    Zheng, Ai-Long
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2012, 2012, 7442 : 271 - 282
  • [49] Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
    Gemignani, L.
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2016, 72 (04) : 992 - 1001
  • [50] Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques
    Mahmood, M. Khalid
    Ahmad, Farooq
    ABSTRACT AND APPLIED ANALYSIS, 2014,
12345