论文信息 - Interval iteration for zeros of systems of equations

Interval iteration for zeros of systems of equations

Easily verifiable existence and convergence conditions are given for a class of interval iteration algorithms for the enclosure of a zero of a system of nonlinear equations. In particular, a quadratically convergent method is obtained which throughout the iteration uses the same interval enclosure of the derivative.

A. Neumaier

[1] E. Hansen,et al. Interval Arithmetic in Matrix Computations, Part II , 1965 .

[2] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[3] K. Nickel. On the Newton Method in Interval Analysis , 1971 .

[4] G. Alefeld. Über die Durchführbarkeit des Gaußschen Algorithmus bei Gleichungen mit Intervallen als Koeffizienten , 1977 .

[5] H. Schwetlick. Numerische Lösung nichtlinearer Gleichungen , 1978 .

[6] Karl Reichmann. Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall‐Gauss‐Algorithmus bei Intervall‐Hessenberg‐Matrizen ohne Pivotsuche , 1979 .

[7] J. Michael Yohe,et al. Software for Interval Arithmetic: A Reasonably Portable Package , 1979, TOMS.

[8] A device for the acceleration of convergence of a monotonously enclosing iteration method , 1982 .

[9] G. Alefeld,et al. Introduction to Interval Computation , 1983 .

[10] A. Neumaier. An interval version of the secant method , 1984 .

[11] Götz Alefeld. On the Convergence of Some Interval-Arithmetic Modifications of Newton’s Method , 1984 .

[12] A. Neumaier. New techniques for the analysis of linear interval equations , 1984 .

[13] Arnold Neumaier,et al. An improved interval Newton operator , 1986 .