论文信息 - Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems

Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems

Weaker interval arithmetic tests for existence, uniqueness, and convergence of simplified Newton methods than those of Moore and Qi [SIAM J. Numer Anal., 19 (1982), pp. 845–850] are described. Numerical results are presented.

M. A. Wolfe | J. M. Shearer

[1] L. B. Rall,et al. Computational Solution of Nonlinear Operator Equations , 1969 .

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

[3] Ramon E. Moore,et al. A Successive Interval Test for Nonlinear Systems , 1982 .

[4] Ramon E. Moore,et al. SAFE STARTING REGIONS FOR ITERATIVE METHODS , 1977 .

[5] A GENERALIZATION OF THE KRAWCZYK-MOORE ALGORITHM , 1980 .

[6] Ramon E. Moore. A Computational Test for Convergence of Iterative Methods for Nonlinear Systems , 1978 .

[7] E. Hansen,et al. An interval Newton method , 1983 .