Skip to main content
Log in

Discrete versus continuous Newton's method: A case study

  • Published:
Acta Applicandae Mathematica Aims and scope Submit manuscript

Abstract

We consider the damped Newton's method N h (z) = zhp(z)/p′(z), 0<h<1 for polynomialsp(z) with complex coefficients. For the usual Newton's method (h=1) and polynomialsp(z), it is known that the method may fail to converge to a root ofp and rather leads to an attractive periodic cycle.N h(z) may be interpreted as an Euler step for the differential equation ż=−p(z)/p′(z) with step sizeh. In contrast to the possible failure of Newton's method, we have that for almost all initial conditions to the differential equation that the solutions converge to a root ofp. We show that this property generally carries over to Newton's methodN h(z) only for certain nondegenerate polynomials and for sufficiently small step sizesh>0. Further we discuss the damped Newton's method applied to the family of polynomials of degree 3.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Barna B.: Ueber die Divergenzpunkte des Newton'schen Verfahrens zur Bestimmung von Wurzeln algebraischer Gleichungen, II,Publ. Math. Debrecen 4 (1956) 384–397.

    Google Scholar 

  2. Blanchard P.: Complex analytic dynamics on the Riemann sphere,Bull. A.M.S. 11, (1984), 35–141.

    Google Scholar 

  3. Braess D.: Ueber die Einzugsgebiete der Nullstellen von Polynomen beim Newton-Verfahren,Numer. Math. 29 (1977), 123–132.

    Google Scholar 

  4. Brolin H.: Invariant sets under iteration of rational functions,Arkiv foer Matematik 6 (1965), 103–144.

    Google Scholar 

  5. Curry J. H., Garnett L., and Sullivan D.: On the iteration of a rational function: computer experiments with Newton's method”,Commun. Math. Phys. 91 (1983), 267–277.

    Google Scholar 

  6. Jongen H. T., Jonker P., and Twilt F.: The continuous, desingularized Newton-method for meromorphic functions,Acta Applic. Math. 13 (1988), 81–121 (this issue).

    Google Scholar 

  7. Peitgen, H. O., Pruefer, M., and Schmitt, K.: Newton flows for real systems of equations, preprint (1986).

  8. Peitgen H. O. and Richter P.:The Beauty of Fractals, Springer-Verlag, New York, 1986.

    Google Scholar 

  9. Peitgen H. O., Saupe D., and v. Haeseler F.: Cayley's problem and Julia sets,Math. Intelligencer 6 (1984), 11–20.

    Google Scholar 

  10. Smale S.: On the efficiency of algorithms of analysis,Bull. A.M.S. 13 (1985), 87–121.

    Google Scholar 

  11. Vrscay W. R.: Julia sets and Mandelbrot-like sets associated with higher order Schroeder rational iteration functions: A computer assisted study,Math. of Computation 46 (1986), 151–169.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saupe, D. Discrete versus continuous Newton's method: A case study. Acta Appl Math 13, 59–80 (1988). https://doi.org/10.1007/BF00047502

Download citation

  • Received:

  • Issue Date:

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

AMS subject classifications (1980)

Key words

Navigation