Loading...

The performance of synchronous parallel polynomial root extraction on a ring multicomputer

Sarbazi Azad, H ; Sharif University of Technology | 2007

210 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s10586-007-0013-z
  3. Publisher: 2007
  4. Abstract:
  5. In this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand-Kerner's method and consists of two phases: initialisation, and iteration. In the initialisation phase all the necessary preparation steps are realised to start the parallel computation. It includes register initialisation and initial approximation of roots requiring 3n - 2 communications, 2 exponentiation, one multiplications, 6 divisions, and 4n - 3 additions. In the iteration phase, these initial approximated roots are corrected repeatedly and converge to their accurate values. The iteration phase is composed of some iteration steps, each consisting of 3n communications, 4n + 3 additions, 3n + 1 multiplications, and one division. © Springer Science+Business Media, LLC 2007
  6. Keywords:
  7. Iterative methods ; Parallel algorithms ; Polynomial approximation ; Durand-kerner method ; Polynomial root extraction ; Ring multicomputer ; Parallel processing systems
  8. Source: Cluster Computing ; Volume 10, Issue 2 , 2007 , Pages 167-174 ; 13867857 (ISSN)
  9. URL: https://link.springer.com/article/10.1007%2Fs10586-007-0013-z