This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-successive column correction algorithm and the modified CM-successive column correction algorithm. A q-superlinear convergence theorem and an r-convergence order estimate are given for both algorithms. The numerical results indicate that these two algorithms, especially the modified algorithm are probably more efficient than some currently used algorithms
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear e...
Garcia et al. [1] present a class of column generation (CG) algorithms for nonlinear programs. Its m...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
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...
This paper presents a QR update implementation of the successive column correction (SCC) method and ...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonline...
The inverse Column-Updating method is a secant algorithm for solving nonlinear systems of equations ...
In this work new quasi-Newton methods for solving large-scale nonlinear systems of equations are pre...
The basic problem considered here is to solve sparse systems of nonlinear equations. A system is co...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
AbstractIn this work new quasi-Newton methods for solving large-scale nonlinear systems of equations...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
This paper presents a successive element correction algorithm and a secant modification of this algo...
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear e...
Garcia et al. [1] present a class of column generation (CG) algorithms for nonlinear programs. Its m...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
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...
This paper presents a QR update implementation of the successive column correction (SCC) method and ...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonline...
The inverse Column-Updating method is a secant algorithm for solving nonlinear systems of equations ...
In this work new quasi-Newton methods for solving large-scale nonlinear systems of equations are pre...
The basic problem considered here is to solve sparse systems of nonlinear equations. A system is co...
In this paper we present a Quasi-Newton type method, which applies to large and sparse nonlinear sys...
AbstractIn this work new quasi-Newton methods for solving large-scale nonlinear systems of equations...
AbstractPractical quasi-Newton methods for solving nonlinear systems are surveyed. The definition of...
This paper presents a successive element correction algorithm and a secant modification of this algo...
In this paper, we present the results obtained by solving consistent sparse systems of n nonlinear e...
Garcia et al. [1] present a class of column generation (CG) algorithms for nonlinear programs. Its m...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...