Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



On the sparse and symmetric least-change secant update

Author: Trond Steihaug
Journal: Math. Comp. 42 (1984), 521-533
MSC: Primary 65H05; Secondary 65F50
MathSciNet review: 736450
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: To find the sparse and symmetric n by n least-change secant update we have to solve a consistent linear system of n equations in n unknowns, where the coefficient matrix is symmetric and positive semidefinite. We give bounds on the eigenvalues of the coefficient matrix and show that the preconditioned conjugate gradient method is a very efficient method for solving the linear equation. By solving the linear system only approximately, we generate a family of sparse and symmetric updates with a residual in the secant equation. We address the question of how accurate a solution is needed not to impede the convergence of quasi-Newton methods using the approximate least-change update. We show that the quasi-Newton methods are locally and superlinearly convergent after one or more preconditioned conjugate gradient iterations.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65H05, 65F50

Retrieve articles in all journals with MSC: 65H05, 65F50

Additional Information

Article copyright: © Copyright 1984 American Mathematical Society