AbstractSome modifications of the secant method for solving nonlinear equations are revisited and the local order of convergence is found in a direct symbolic computation. To do this, a development of the inverse of the first order divided differences of a function of several variables in two points is presented. A generalisation of the efficiency index used in the scalar case to several variables is also analysed in order to use the most competitive algorithm
This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonline...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
AbstractIn this work we study a class of secant-like iterations for solving nonlinear equations in B...
Some modifications of the secant method for solving nonlinear equations are revisited and the local ...
The secant method is a very effective numerical procedure used for solving nonlinear equations of th...
AbstractIn this paper two new iterative methods are built up and analyzed. A generalization of the e...
A theory of inexact Newton methods with secant preconditioners for solving large nonlinear systems o...
summary:We provide new sufficient convergence conditions for the convergence of the secant-type meth...
AbstractWe present a directional secant method, a secant variant of the directional Newton method, f...
A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses...
[EN] The semilocal convergence of double step Secant method to approximate a locally unique solution...
Using our new concept of recurrent functions, we present new sufficient convergence conditions for...
AbstractIn this paper, we present a new secant-like method for solving nonlinear equations. Analysis...
summary:We provide new sufficient conditions for the convergence of the secant method to a locally u...
AbstractWe study an iterative method with order (1+2) for solving nonlinear operator equations in Ba...
This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonline...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
AbstractIn this work we study a class of secant-like iterations for solving nonlinear equations in B...
Some modifications of the secant method for solving nonlinear equations are revisited and the local ...
The secant method is a very effective numerical procedure used for solving nonlinear equations of th...
AbstractIn this paper two new iterative methods are built up and analyzed. A generalization of the e...
A theory of inexact Newton methods with secant preconditioners for solving large nonlinear systems o...
summary:We provide new sufficient convergence conditions for the convergence of the secant-type meth...
AbstractWe present a directional secant method, a secant variant of the directional Newton method, f...
A gradient-secant algorithm for unconstrained optimization problems is presented. The algorithm uses...
[EN] The semilocal convergence of double step Secant method to approximate a locally unique solution...
Using our new concept of recurrent functions, we present new sufficient convergence conditions for...
AbstractIn this paper, we present a new secant-like method for solving nonlinear equations. Analysis...
summary:We provide new sufficient conditions for the convergence of the secant method to a locally u...
AbstractWe study an iterative method with order (1+2) for solving nonlinear operator equations in Ba...
This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonline...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
AbstractIn this work we study a class of secant-like iterations for solving nonlinear equations in B...