No abstract

No abstract

No abstract

In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s k of the Newton's system J (x k )s = −F (x k ) is found. This means that s k must satisfy a condition like F (x k ) + J (x k )s k ≤ η k F (x k ) for a forcing term η k ∈ [0, 1). Possible choices for η k have already been presented. In this work, a new choice for η k is proposed. The method is globalized using a robust backtracking strategy proposed by Birgin et al. (Numerical Algorithms 32:249-260, 2003), and its convergence properties are proved. Several numerical experiments with boundary value problems are presented. The numerical performance of the proposed algorithm is analyzed by the performance profile tool proposed by Dolan and Moré (Mathematical Programming Series A 91:201-213, 2002). The results obtained show a competitive inexact Newton method for solving academic and applied problems in several areas.Keywords Nonlinear systems of equations · Inexact Newton method · Forcing term · Newton iterative methods · Line search Consider the nonlinear systemwhere F ∈ C 1 (D, R n ) with D an open convex set, and assume that there is x * ∈ D such that F (x * ) = 0 with J (x * ) nonsingular, where J (y) is the Jacobian matrix of F at y. From now on, · is a norm in R n and also the corresponding induced matrix norm.

No abstract