Abstract
We introduce some variations of the interval Newton method for bounding solutions to a set ofn nonlinear equations. It is pointed out that previous implementations of Krawczyk's method are very inefficient and an improved version is given. A superior type of Newton method is introduced.
Similar content being viewed by others
References
Götz Alefeld,Intervallrechnung über den komplexen Zahlen und einige Anwendungen, doctoral dissertation, University of Karlsruhe, 1968.
E. R. Hansen,On solving systems of equations using interval arithmetic, Math. Comp. 22 (1968), 374–384.
E. R. Hansen,On linear algebraic equations with interval coefficients. Topics in Interval Analysis, E. R. Hansen, ed., Oxford University Press, London, 1969.
E. R. Hansen,Interval forms of Newton's method, Computing 20 (1978), 153–163.
E. R. Hansen,A globally convergent interval method for computing and bounding real roots, BIT 18 (1978), 415–424.
E. R. Hansen, and R. R. Smith,Interval arithmetic in matrix computations, part II, SIAM Jour. Numer. Anal. 4 (1967), 1–9.
Richard Hanson,Interval arithmetic as a closed arithmetic system on a computer, Jet Propulsion Lab Report 197, June, 1968.
W. M. Kahan,A more complete interval arithmetic, Lecture notes for a summer course at the University of Michigan, 1968.
R. Krawczyk, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969), 187–201.
R. E. Moore,Interval Analysis, Prentice-Hall, Englewood Cliffs, 1966.
R. E. Moore,Methods and applications of interval analysis, SIAM, Philadelphia, 1979.
M. A. Wolfe,A modification of Krawczyk's algorithm, SIAM Jour. Numer. Anal. 17 (1980), 376–379.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hansen, E., Sengupta, S. Bounding solutions of systems of equations using interval analysis. BIT 21, 203–211 (1981). https://doi.org/10.1007/BF01933165
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01933165