Skip to main content
SpringerLink
Log in

A parallel algorithm for finding roots of a complex polynomial

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an improvement over the Wilf algorithm[3].

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. Курош А. Г., Курс В ы с щ е й а лгебры, Гостехиздат, 1952.

  2. Anthony Ralston and Herbert S. Will, Mathematical Methods for Digital Computers, John Wiley & Sons Inc., 1960.

  3. E. V. Krishnamurthy and H. Vendateswaran, A parallel Wilf algorithm for complex zero of a polynomial,BIT,21 (1981), 104–111.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Anhui University, Hefei

    Cheng Jinsong

Authors
  1. Cheng Jinsong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, J. A parallel algorithm for finding roots of a complex polynomial. J. of Comput. Sci. & Technol. 5, 71–81 (1990). https://doi.org/10.1007/BF02946566

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946566

Keywords

Search

Navigation