Skip to main content
Log in

Verified numerical computation for nonlinear equations

  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

After the introduction basic properties of interval arithmetic are discussed and different approaches are repeated by which one can compute verified numerical approximations for a solution of a nonlinear equation.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Alefeld, Intervallrechnung über den komplexen Zahlen und einige Anwendungen. Ph.D. thesis, Universität Karlsruhe, Karlsruhe, 1968.

    Google Scholar 

  2. G. Alefeld, Inclusion methods for systems of nonlinear equations—the interval Newton method and modifications. Topics in Validated Computations, J. Herzberger (ed.), Elsevier, Amsterdam, 1994, 7–26.

    Google Scholar 

  3. G. Alefeld, X. Chen and F. Potra, Numerical validation of solutions of linear complementarity problems. Numer. Math.,83 (1999), 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Alefeld, X. Chen and F. Potra, Numerical validation of solutions of complementarity problems: the nonlinear case. Numer. Math.,92 (2002), 1–16.

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Alefeld and J. Herzberger, Einführung in die Intervallrechnung. Bibliographisches Institut, Mannheim, 1974.

    MATH  Google Scholar 

  6. G. Alefeld and J. Herzberger, Introduction to Interval Computations., Academic Press, New York, 1983.

    MATH  Google Scholar 

  7. G. Alefeld and G. Mayer, Interval analysis. Theory and applications. J. Comp. Appl. Math.,121 (2000), 421–464.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Alefeld and U. Schäfer, Iterative methods for linear complementarity problems with interval data. Computing,70 (2003), 235–259.

    MATH  MathSciNet  Google Scholar 

  9. G. Alefeld, Z. Shen and Z. Wang, Enclosing solutions of linear complementarity problems for H-matrices. Reliable Computing,10 (2004), 423–435.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Alefeld and Z. Wang, Verification of solutions of almost linear complementarity problems. Annals of the European Academy of Sciences 2005, EAS Publishing House, 211–231.

  11. X. Chen, A verification method for solutions of nonsmooth equations. Computing,58 (1997), 281–294.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Krawczyk, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing,4 (1969), 187–201.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Neumaier, Interval Methods for Systems of Equations. University Press, Cambridge, 1990.

    MATH  Google Scholar 

  14. H. Schwandt, Schnelle fast global konvergente Verfahren für die Fünf-Punkte-Diskrestisierung der Poissongleichung mit Dirichletschen Randbedingungen auf Rechteckgebieten. Thesis, Fachbereich Mathematik der TU Berlin, Berlin, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Goetz Alefeld.

About this article

Cite this article

Alefeld, G. Verified numerical computation for nonlinear equations. Japan J. Indust. Appl. Math. 26, 297–315 (2009). https://doi.org/10.1007/BF03186536

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation