Complexity of Bezout's theorem IV: probability of success; extensions
SIAM Journal on Numerical Analysis
A new semilocal convergence theorem for Newton's method
Journal of Computational and Applied Mathematics
Complexity and real computation
Complexity and real computation
Convergence of Newton's method and inverse function theorem in Banach space
Mathematics of Computation
Convergence and Complexity of Newton Iteration for Operator Equations
Journal of the ACM (JACM)
Newton's method for overdetermined systems of equations
Mathematics of Computation
The Newton method for operators with Hölder continuous first derivative
Journal of Optimization Theory and Applications
Newton's method for analytic systems of equations with constant rank derivatives
Journal of Complexity
On the Newton-Kantorovich hypothesis for solving equations
Journal of Computational and Applied Mathematics
On the solution of systems of equations with constant rank derivatives
Numerical Algorithms
Hi-index | 7.29 |
The famous Newton-Kantorovich hypothesis has been used for a long time as a sufficient condition for the convergence of Newton's method to a solution of an equation. Here we present a ''Kantorovich type'' convergence analysis for the Gauss-Newton's method which improves the result in [W.M. Hauszler, A Kantorovich-type convergence analysis for the Gauss-Newton-method, Numer. Math. 48 (1986) 119-125.] and extends the main theorem in [I.K. Argyros, On the Newton-Kantorovich hypothesis for solving equations, J. Comput. Appl. Math. 169 (2004) 315-332]. Furthermore, the radius of convergence ball is also obtained.