Skip to main content
Log in

Some efficient methods for enclosing simple zeros of nonlinear equations

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

Abstract

In the present paper we propose three new methods for computing sequences of enclosing intervals for a zero of a real function without convexity assumptions.

The new methods have been tested on a series of published examples. The numerical experiments show that our methods are comparable in terms of efficiency with the well-known algorithms of Dekker and Brent.

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. Alefeld G., Herzberger J.:Introduction to Interval Computations. Academic Press (1983).

  2. Alefeld G., Potra F.:On two higher order enclosing methods of J. W. Schmidt. Z. angew. Math. Mech. 68 (1988) 8, 331–337.

    Google Scholar 

  3. Alefeld G., Potra F.:A new class of interval methods with higher order of convergence. Computing 42, (1989) 69–80.

    Google Scholar 

  4. Brent R. P.:Algorithms for Minimization without Derivatives. Prentice-Hall. Englewood Cliffs, New Jersey, 1972.

    Google Scholar 

  5. Dekker, T. J.:Finding a zero by means of successive linear interpolation. InConstructive Aspects of the Fundamental Theorem of Algebra. Edited by B. Dejon and P. Henrici. Wiley Interscience (1969).

  6. King, R. F.:Methods without secant steps for finding a bracketed root. Computing 17, (1976), 49–57.

    Google Scholar 

  7. Ostrowski A. M.:Solution of Equations in Banach Spaces. Academic Press, New York 1973.

    Google Scholar 

  8. Potra F.:On Q-order and R-order of convergence. JOTA, 63 (1989), 415–431.

    Google Scholar 

  9. Schmidt J. W.:Eingrenzung der Lösungen nichtlinearer Gleichungen mit höherer Konvergenzgeschwindigkeit. Computing 8 (1971), 208–215.

    Google Scholar 

  10. Schmidt J. W.:On the R-order of coupled sequences. Computing 26 (1981), 333–342.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The present paper was written when this author was visiting the University of Karlsruhe. He would like to acknowledge the support provided by the University of Karlsruhe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alefeld, G.E., Potra, F.A. Some efficient methods for enclosing simple zeros of nonlinear equations. BIT 32, 334–344 (1992). https://doi.org/10.1007/BF01994885

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Subject Classifications

Keywords

Navigation