Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


On the sparse and symmetric least-change secant update
HTML articles powered by AMS MathViewer

by Trond Steihaug PDF
Math. Comp. 42 (1984), 521-533 Request permission


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.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65H05, 65F50
  • Retrieve articles in all journals with MSC: 65H05, 65F50
Additional Information
  • © Copyright 1984 American Mathematical Society
  • Journal: Math. Comp. 42 (1984), 521-533
  • MSC: Primary 65H05; Secondary 65F50
  • DOI:
  • MathSciNet review: 736450