Newton's method for analytic systems of equations with constant rank derivatives

Authors:
Jean-Pierre Dedieu;Myong-Hi Kim
Affiliations:
MIP, Université Paul Sabatier, 31062 Toulouse Cedex 04, France;Department of Mathematics, State University of New York, Stony Brook, New York
Venue:
Journal of Complexity
Year:
2002

Citing 5
Cited 6

Complexity of Bezout's theorem IV: probability of success; extensions

SIAM Journal on Numerical Analysis
Complexity and real computation

Complexity and real computation
Newton's method for overdetermined systems of equations

Mathematics of Computation
Computation complexity of the euler algorithms for the roots of complex polynomials

Computation complexity of the euler algorithms for the roots of complex polynomials
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Kantorovich's type theorems for systems of equations with constant rank derivatives

Journal of Computational and Applied Mathematics
Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory

Journal of Complexity
Local convergence analysis of the Gauss-Newton method under a majorant condition

Journal of Complexity
On the solution of systems of equations with constant rank derivatives

Numerical Algorithms
Extending the applicability of the Gauss---Newton method under average Lipschitz---type conditions

Numerical Algorithms
Local convergence analysis of inexact Gauss-Newton like methods under majorant condition

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the convergence properties of Newton's sequence for analytic systems of equations with constant rank derivatives. Our main result is an alpha-theorem which ensures the convergence of Newton's sequence to a least-square solution of this system.