Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A hybrid algorithm for solving sparse nonlinear systems of equations


Authors: J. E. Dennis and Guang Ye Li
Journal: Math. Comp. 50 (1988), 155-166
MSC: Primary 65H10
MathSciNet review: 917823
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: 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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65H10

Retrieve articles in all journals with MSC: 65H10


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1988-0917823-5
PII: S 0025-5718(1988)0917823-5
Keywords: Finite difference, Jacobian, q-superlinear convergence, Kantorovich type analysis, sparsity, nonlinear system of equations
Article copyright: © Copyright 1988 American Mathematical Society