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.


The inexact, inexact perturbed, and quasi-Newton methods are equivalent models
HTML articles powered by AMS MathViewer

by Emil Cǎtinaş PDF
Math. Comp. 74 (2005), 291-301 Request permission


A classical model of Newton iterations which takes into account some error terms is given by the quasi-Newton method, which assumes perturbed Jacobians at each step. Its high convergence orders were characterized by Dennis and Moré [Math. Comp. 28 (1974), 549–560]. The inexact Newton method constitutes another such model, since it assumes that at each step the linear systems are only approximately solved; the high convergence orders of these iterations were characterized by Dembo, Eisenstat and Steihaug [SIAM J. Numer. Anal. 19 (1982), 400–408]. We have recently considered the inexact perturbed Newton method [J. Optim. Theory Appl. 108 (2001), 543–570] which assumes that at each step the linear systems are perturbed and then they are only approximately solved; we have characterized the high convergence orders of these iterates in terms of the perturbations and residuals. In the present paper we show that these three models are in fact equivalent, in the sense that each one may be used to characterize the high convergence orders of the other two. We also study the relationship in the case of linear convergence and we deduce a new convergence result.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 65H10
  • Retrieve articles in all journals with MSC (2000): 65H10
Additional Information
  • Emil Cǎtinaş
  • Affiliation: Romanian Academy, “T. Popoviciu” Institute of Numerical Analysis, P.O. Box 68–1, Cluj-Napoca 3400, Romania
  • Email:
  • Received by editor(s): July 23, 2001
  • Received by editor(s) in revised form: May 3, 2003
  • Published electronically: March 23, 2004
  • Additional Notes: This research has been supported by the Romanian Academy under grant GAR 97/1999, and by the National Agency for Science, Technology and Innovation under grant GANSTI 6100 GR/2000.
  • © Copyright 2004 American Mathematical Society
  • Journal: Math. Comp. 74 (2005), 291-301
  • MSC (2000): Primary 65H10
  • DOI:
  • MathSciNet review: 2085412