A convergence theorem for Newton-like methods in Banach spaces
Numerische Mathematik
The generalized inverse matrix and the surface-surface intersection problem
Theory and practice of geometric modeling
An efficient surface intersection algorithm based on lower-dimensional formulation
ACM Transactions on Graphics (TOG)
Convergence and Complexity of Newton Iteration for Operator Equations
Journal of the ACM (JACM)
On the Newton-Kantorovich hypothesis for solving equations
Journal of Computational and Applied Mathematics
On the R-order of convergence of Newton's method under mild differentiability conditions
Journal of Computational and Applied Mathematics
On a class of Newton-like methods for solving nonlinear equations
Journal of Computational and Applied Mathematics
Extending the Newton-Kantorovich hypothesis for solving equations
Journal of Computational and Applied Mathematics
Majorizing sequences for iterative procedures in Banach spaces
Journal of Complexity
Journal of Complexity
Weaker Kantorovich type criteria for inexact Newton methods
Journal of Computational and Applied Mathematics
Expanding the applicability of Newton's method using Smale's α-theory
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
Newton's method is often used for solving nonlinear equations. In this paper, we show that Newton's method converges under weaker convergence criteria than those given in earlier studies, such as Argyros (2004) [2, p. 387], Argyros and Hilout (2010)[11, p. 12], Argyros et al. (2011) [12, p. 26], Ortega and Rheinboldt (1970) [26, p. 421], Potra and Ptak (1984) [36, p. 22]. These new results are illustrated by several numerical examples, for which the older convergence criteria do not hold but for which our weaker convergence criteria are satisfied.