Abstract
In this paper we analyze the use of structured quasi-Newton formulae as preconditioners of iterative linear methods when the inexact-Newton approach is employed for solving nonlinear systems of equations. We prove that superlinear convergence and bounded work per iteration is obtained if the preconditioners satisfy a Dennis-Moré condition. We develop a theory of Least-Change Secant Update preconditioners and we present an application concerning a structured BFGS preconditioner.
Cite
CITATION STYLE
Martínez, J. M. (1993). A theory of secant preconditioners. Mathematics of Computation, 60(202), 681–698. https://doi.org/10.1090/s0025-5718-1993-1176714-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.