Skip to main content
SpringerLink
Log in

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

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cosnard, M., Fraigniaud, P.: Analysis of asynchronous polynomial root finding methods on a distributed memory multicomputer. IEEE Trans. Parallel Distributed Syst. 5: 639–648 (1994)

    Article  Google Scholar 

  2. Couturier, R., Canalda, P., Spies, F.: Iterative algorithms on network computing: parallel polynomial root extracting. In: Proceedings of IEEE HiPC 2002, 10–12 Dec. 2002, India. LNCS 2552, pp. 283–291

  3. Eager, D.L., Zahorjan, J., Lazowska, E.D.: Speed versus efficiency in parallel systems. IEEE Trans. Comput. 38: 408–423 (1989)

    Article  Google Scholar 

  4. Oberman, S.: Design issues in high performance floating point arithmetic units. PhD thesis, Stanford Univ. (Nov. 1996)

  5. Zhong, L.: Modular exponentiation algorithm analysis for energy consumption and performance, Technical Report CE-01-ZJL, Department of Electrical Engineering, Princeton University, USA, 2000

  6. Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L., Akl, S.G.: A parallel algorithm for Lagrange interpolation on the star graph. J. Parallel Distributed Comput. 62: 605–621 (2002)

    Article  MATH  Google Scholar 

  7. Sarbazi-Azad, H.: Parallel polynomial root extraction on a ring of processors. In: Proceedings IEEE IPDPS PMEO-PDS Workshop, 12–15 April 2005, USA, p. 555

  8. Duato, J., Yalamanchili, R., Ni, L.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  9. Aberth, O.: Iteration methods for finding all zeros of a polynomial simultaneously. Math. Comp. 27: 339–344 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  10. Alt, R.: Computing roots of polynomials on vector processing machines. Appl. Numer. Math. 1(4), 299–308 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Atanassova, L., Makrelov, I.: Individual and simultaneous determination of the zeros of algebraic polynomials. USSR Comput. Math. Math. Phys. 31(9), 104–107 (1992)

    MathSciNet  Google Scholar 

  12. Cosnard, M., Fraigniaud, P.: Finding the roots of a polynomial on an MIMD multicomputer. Parallel Comput. 15, 75–86 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  13. Freeman, T.L., Bane, M.K.: Asynchronous polynomial zero-finding algorithms. Parallel Comput. 17, 673–681 (1991)

    Article  MathSciNet  Google Scholar 

  14. Guggenheimer, H.: Initial approximations in Durand–Kerner’s root finding method. BIT 26, 537–539 (1986)

    Article  MATH  Google Scholar 

  15. Hopkins, M.: On a method of Weierstrass for the simultaneous calculation of the roots of a polynomial. Z. Angew. Math. Mech. 74, 295–306 (1994)

    MATH  MathSciNet  Google Scholar 

  16. Ben-Or, M., Feig, E., Kozen, D., Tiwari, P.: (1986) A fast parallel algorithm for determining all roots of a polynomial with real roots. In: Proceedings of ACM SAC’86, 1986, pp. 340–349

Download references

Author information

Authors and Affiliations

  1. Sharif University of Technology and IPM School of Computer Science, Tehran, Iran

    Hamid Sarbazi-Azad

Authors
  1. Hamid Sarbazi-Azad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Sarbazi-Azad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sarbazi-Azad, H. The performance of synchronous parallel polynomial root extraction on a ring multicomputer. Cluster Comput 10, 167–174 (2007). https://doi.org/10.1007/s10586-007-0013-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-007-0013-z

Keywords

Search

Navigation