Skip to main content
SpringerLink
Log in

A parallel wilf algorithm for complex zeros of a polynomial

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.

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. E. T. Copson,An Introduction to the Theory of Functions of a Complex Variable, Oxford Univ. Press, Delhi (1974).

    Google Scholar 

  2. D. Dejon and P. Henrici, (Eds.),Proc. Symposium on Constructive Aspects of the Fundamental Theorem of Algebra. Wiley-Interscience, London (1969).

    Google Scholar 

  3. F. R. Gantmacher,Applications of the Theory of Matrices. Wiley-Interscience, New York (1959).

    Google Scholar 

  4. R. T. Gregory,The use of finite segment p-adic arithmetic for exact computation, BIT 18 (1978), 282–300.

    Google Scholar 

  5. E. Hansen, et al.,Some modifications of Laguerre's method. BIT 17 (1977), 409–417.

    Google Scholar 

  6. D. E. Knuth,The Art of Computer Programming, Vol. 1:Fundamental Algorithms. Addison Wesley, Mass, Reading (1968).

    Google Scholar 

  7. A. Kurosh,Higher Algebra. Mir Publishers, Moscow (1972).

    Google Scholar 

  8. J. R. Pinkert,An exact method for finding the roots of a complex polynomial. ACM Trans. Math. Software 2, (1976), 351–363.

    Google Scholar 

  9. H. S. Stone,Problems of parallel computation, pp. 1–16 in ‘Complexity of Sequential and Parallel Numerical Algorithms’, ed. by J. F. Traub, Academic Press, New York (1973).

    Google Scholar 

  10. A. Van der Sluis,Upper bounds for roots of polynomials, Num. Math. 15 (1970), 250–262.

    Google Scholar 

  11. H. S. Wall,Analytical Theory of Continued Fractions, Van Nostrand, New York (1948).

    Google Scholar 

  12. H. S. Wilf,A global bisection algorithm for computing the zeros of polynomials in the complex plane. JACM, Vol. 25, No. 3, (1978), 415–420.

    Google Scholar 

Download references

Author information

Author notes

  1. H. Venkateswaran

    Present address: Department of Computer Science, The University of Tennessee, 37916, Knoxville, Tennesse, USA

Authors and Affiliations

  1. Indian Institute of Science, 560012, Bangalore, India

    E. V. Krishnamurthy & H. Venkateswaran

Authors
  1. E. V. Krishnamurthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Venkateswaran
    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

Krishnamurthy, E.V., Venkateswaran, H. A parallel wilf algorithm for complex zeros of a polynomial. BIT 21, 104–111 (1981). https://doi.org/10.1007/BF01934075

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation