AbstractIn this paper we investigate a class of inexact Newton methods which are hypo-quadratically convergent. The methods are designed for solving nonlinear systems of algebraic equations. An interesting feature is the flexibility of these algorithms: there is a trade-off between the rate of convergence and the accuracy required for solving the linearized equations at each iteration
In this paper we describe a variant of the Inexact Newton method for solving nonlinear systems of eq...
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:R...
We define and analyse partial Newton iterations for the solutions of a system of algebraic equations...
AbstractIn this paper we investigate a class of inexact Newton methods which are hypo-quadratically ...
AbstractThe paper presents a convergence analysis of a modified Newton method for solving nonlinear ...
In this paper, we are concerned with the further study for system of nonlinear equations. Since syst...
The inexact Newton method is widely used to solve systems of non-linear equations. It is well-known ...
Abstract. The classical Newton–Kantorovich method for solving systems of equations f(x) = 0 uses th...
The Newton- Krylov iteration is the most prominent iterative method for solving non-linear system of...
AbstractAn algorithm for solving systems of nonlinear algebraic equations is described. The Jacobian...
AbstractWe consider modifications of Newton's method for solving a nonlinear system F(x) = 0 where F...
AbstractA family of new iteration methods without employing derivatives is proposed in this paper. W...
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s...
The asymptotic convergence of parameterized variants of Newton’s method for the solution of nonlinea...
In this paper, we describe a variant of the inexact Newton method for solving nonlinear systems of e...
In this paper we describe a variant of the Inexact Newton method for solving nonlinear systems of eq...
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:R...
We define and analyse partial Newton iterations for the solutions of a system of algebraic equations...
AbstractIn this paper we investigate a class of inexact Newton methods which are hypo-quadratically ...
AbstractThe paper presents a convergence analysis of a modified Newton method for solving nonlinear ...
In this paper, we are concerned with the further study for system of nonlinear equations. Since syst...
The inexact Newton method is widely used to solve systems of non-linear equations. It is well-known ...
Abstract. The classical Newton–Kantorovich method for solving systems of equations f(x) = 0 uses th...
The Newton- Krylov iteration is the most prominent iterative method for solving non-linear system of...
AbstractAn algorithm for solving systems of nonlinear algebraic equations is described. The Jacobian...
AbstractWe consider modifications of Newton's method for solving a nonlinear system F(x) = 0 where F...
AbstractA family of new iteration methods without employing derivatives is proposed in this paper. W...
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step s...
The asymptotic convergence of parameterized variants of Newton’s method for the solution of nonlinea...
In this paper, we describe a variant of the inexact Newton method for solving nonlinear systems of e...
In this paper we describe a variant of the Inexact Newton method for solving nonlinear systems of eq...
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:R...
We define and analyse partial Newton iterations for the solutions of a system of algebraic equations...