Hybrid algorithm for solving sparse nonlinear systems of equations
Journal Article
·
· Math. Comput.; (United States)
This paper presents a hybrid algorithm for solving sparse nonlinear systems of equations. The algorithm is based on dividing the columns of the Jacobian into two parts and using different algorithms on each part. The hybrid algorithm incorporates advantages of both component algorithms by exploiting the special structure of the Jacobian to obtain a good approximation to the Jacobian, using as little effort as possible. A Kantorovich-type analysis and a locally q-superlinear convergence result for this algorithm are given.
- Research Organization:
- Computer Center, Jilin University, People's Republic of China
- OSTI ID:
- 5458148
- Journal Information:
- Math. Comput.; (United States), Journal Name: Math. Comput.; (United States) Vol. 50:181; ISSN MCMPA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sparse quasi-Newton methods and the continuation problem
Tensor methods for large sparse systems of nonlinear equations
PSolve: A concurrent algorithm for solving sparse systems of linear equations
Technical Report
·
Sat Jun 01 00:00:00 EDT 1985
·
OSTI ID:5403490
Tensor methods for large sparse systems of nonlinear equations
Technical Report
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:434848
PSolve: A concurrent algorithm for solving sparse systems of linear equations
Conference
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5768428