This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonlinear systems of equations. This algorithm is a combination of a finite difference method and a secant method. A q-superlinear convergence result and an r-convergence rate estimate show that this algorithm has good local convergence properties. The numerical results indicate that this algorithm is probably more efficient than some currently used algorithms
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
AbstractSome modifications of the secant method for solving nonlinear equations are revisited and th...
algorithm for solving non-linear equations based on the secant method By J. G. P. Barnes* This paper...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
Abstract. We investigate the role of the secant or quasi-Newton condition in the sparse Broyden or S...
This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-succes...
AbstractIn this paper, we present a new secant-like method for solving nonlinear equations. Analysis...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
In this paper, we investigate the role of the secant or quasi-Newton condition in the sparse Broyden...
Some modifications of the secant method for solving nonlinear equations are revisited and the local ...
The basic problem considered here is to solve sparse systems of nonlinear equations. A system is co...
The secant method is a very effective numerical procedure used for solving nonlinear equations of th...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
Most of the nonlinear equation solvers do not converge always or they use the derivatives of the fun...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
AbstractSome modifications of the secant method for solving nonlinear equations are revisited and th...
algorithm for solving non-linear equations based on the secant method By J. G. P. Barnes* This paper...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
Abstract. We investigate the role of the secant or quasi-Newton condition in the sparse Broyden or S...
This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-succes...
AbstractIn this paper, we present a new secant-like method for solving nonlinear equations. Analysis...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
In this paper, we investigate the role of the secant or quasi-Newton condition in the sparse Broyden...
Some modifications of the secant method for solving nonlinear equations are revisited and the local ...
The basic problem considered here is to solve sparse systems of nonlinear equations. A system is co...
The secant method is a very effective numerical procedure used for solving nonlinear equations of th...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
Most of the nonlinear equation solvers do not converge always or they use the derivatives of the fun...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
AbstractSome modifications of the secant method for solving nonlinear equations are revisited and th...
algorithm for solving non-linear equations based on the secant method By J. G. P. Barnes* This paper...