Abstract
We consider various details in multidimensional interval Newton methods and give an algorithm based on consideration of them. The details include choice of points of expansion, computing and reusing Jacobians, and choice of preconditioner. The resulting algorithm differs in several ways from standard procedures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hansen, E. R.: Interval Arithmetic in Matrix Computations, Part I, SIAMJ. Numer. Anal. 2 (1965), pp. 308–320.
Hansen, E. R.: On Solving Systems of Equations Using Interval Arithmetic, Math. Comput. 22 (1968), pp. 374–384.
Hansen, E. R. and Greenberg, R. I.: An Interval Newton Method, Appl. Math. Comput. 12 (1983), pp. 89–98.
Hansen, E. R. and Walster, G. W.: Global Optimization Using Interval Analysis, Marcel Dekker, 2004.
Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, 1996.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, 1990.
Rail, L. B.: Computer Solution of Nonlinear Operator Equations, John Wiley and Sons, 1969.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hansen, E. A Multidimensional Interval Newton Method. Reliable Comput 12, 253–272 (2006). https://doi.org/10.1007/s11155-006-9000-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11155-006-9000-y