AbstractInexact Newton method is one of the effective tools for solving systems of nonlinear equations. In each iteration step of the method, a forcing term, which is used to control the accuracy when solving the Newton equations, is required. The choice of the forcing terms is of great importance due to their strong influence on the behavior of the inexact Newton method, including its convergence, efficiency, and even robustness. To improve the efficiency and robustness of the inexact Newton method, a new strategy to determine the forcing terms is given in this paper. With the new forcing terms, the inexact Newton method is locally Q-superlinearly convergent. Numerical results are presented to support the effectiveness of the new forcing t...
AbstractWe consider modifications of Newton's method for solving a nonlinear system F(x) = 0 where F...
AbstractThe present paper is concerned with the convergence problem of inexact Newton methods. Assum...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m> 1)...
AbstractInexact Newton method is one of the effective tools for solving systems of nonlinear equatio...
Abstract. An inexactNewtonmethod is a generalization ofNewton’s method for solving F(x) 0, F n __ in...
. An inexact Newton method is a generalization of Newton's method for solving F (x) = 0, F : I...
The inexact Newton method is widely used to solve systems of non-linear equations. It is well-known ...
Inexact Newton methods for solving F (x) = 0, F: D ∈ IRn → IRn with F ∈ CI1(D), where D is an open ...
In this paper we propose two new strategies to determine the forcing terms that allow one to improve...
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s...
Abstract A solid understanding of convergence behaviour is essential to the design and analysis of i...
AbstractWe use inexact Newton iterates to approximate a solution of a nonlinear equation in a Banach...
Abstract. Inexact Newton methods for finding a zero of F 1 1 are variations of Newton’s method in wh...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m>1) in ...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m > 1) i...
AbstractWe consider modifications of Newton's method for solving a nonlinear system F(x) = 0 where F...
AbstractThe present paper is concerned with the convergence problem of inexact Newton methods. Assum...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m> 1)...
AbstractInexact Newton method is one of the effective tools for solving systems of nonlinear equatio...
Abstract. An inexactNewtonmethod is a generalization ofNewton’s method for solving F(x) 0, F n __ in...
. An inexact Newton method is a generalization of Newton's method for solving F (x) = 0, F : I...
The inexact Newton method is widely used to solve systems of non-linear equations. It is well-known ...
Inexact Newton methods for solving F (x) = 0, F: D ∈ IRn → IRn with F ∈ CI1(D), where D is an open ...
In this paper we propose two new strategies to determine the forcing terms that allow one to improve...
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s...
Abstract A solid understanding of convergence behaviour is essential to the design and analysis of i...
AbstractWe use inexact Newton iterates to approximate a solution of a nonlinear equation in a Banach...
Abstract. Inexact Newton methods for finding a zero of F 1 1 are variations of Newton’s method in wh...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m>1) in ...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m > 1) i...
AbstractWe consider modifications of Newton's method for solving a nonlinear system F(x) = 0 where F...
AbstractThe present paper is concerned with the convergence problem of inexact Newton methods. Assum...
A nonlinear system of equations is said to be reducible if it can be divided into m blocks (m> 1)...