Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Direct secant updates of matrix factorizations

Authors: J. E. Dennis and Earl S. Marwil
Journal: Math. Comp. 38 (1982), 459-474
MSC: Primary 65H10
MathSciNet review: 645663
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This paper presents a new context for using the sparse Broyden update method to solve systems of nonlinear equations. The setting for this work is that a Newton-like algorithm is assumed to be available which incorporates a workable strategy for improving poor initial guesses and providing a satisfactory Jacobian matrix approximation whenever required. The total cost of obtaining each Jacobian matrix, or the cost of factoring it to solve for the Newton step, is assumed to be sufficiently high to make it attractive to keep the same Jacobian approximation for several steps. This paper suggests the extremely convenient and apparently effective technique of applying the sparse Broyden update directly to the matrix factors in the iterations between reevaluations in the hope that fewer fresh factorizations will be required. The strategy is shown to be locally and q-superlinearly convergent, and some encouraging numerical results are presented.

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

Article copyright: © Copyright 1982 American Mathematical Society