Loading...

Efficient polynomial root finding using SIMD extensions

Moslemi, M ; Sharif University of Technology | 2005

225 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICPADS.2005.145
  3. Publisher: 2005
  4. Abstract:
  5. In this paper, the parallel implementations of different iterative polynomial root finding methods on a processor with SIMD processing capability are reported. These methods are based on the construction of a sequence of approximations that converge to the set of roots. We have chosen four widely used methods namely Newton's, Durand-Kerner's, Aberth-Ehrlich's, and QD and implemented them using the SIMD instruction set of the Pentium processor with C++ and assembly language. Experiments show that a speedup of 3 or higher can be achieved, depending on the order of polynomial, required accuracy, and the method employed. © 2005 IEEE
  6. Keywords:
  7. Assembly language ; Pentium processors ; SIMD extensions ; SIMD processing ; Approximation theory ; Computer programming languages ; Convergence of numerical methods ; Iterative methods ; Polynomials
  8. Source: 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005, Fukuoka, 20 July 2005 through 22 July 2005 ; Volume 2 , 2005 , Pages 529-533 ; 15219097 (ISSN); 0769522815 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1524367