A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations (Q870296)

From MaRDI portal
Revision as of 23:07, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations
scientific article

    Statements

    A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations (English)
    0 references
    0 references
    0 references
    12 March 2007
    0 references
    A class of globally convergent inexact Newton methods, the Newton-GMRES with quasi-conjugate-gradient backtracking (NGQCGB) methods, for solving large sparse systems of nonlinear equations are presented. These methods can be considered as a suitable combination of the Newton-GMRES iteration and some efficient backtracking strategies. In some cases, known Newton-GMRES backtracking (NGB) methods stagnate for some iterations or even fail. To avoid this disadvantage of NGB methods the authors propose a new alternative strategy, called quasi-conjugate-gradient with backtracking (QCGB), using the known information such as the projection of the gradient of the merit function on a proper subspace and last nonlinear step. Numerical computations show that the NGQCGB method is more robust and efficient than both the NGB method and the Newton-GMRES with eqality curve backtracking (NGECB) method.
    0 references
    0 references
    systems of nonlinear equations
    0 references
    inexact Newton method
    0 references
    GMRES
    0 references
    global convergence
    0 references
    numerical examples
    0 references
    generalized minimal residual
    0 references
    quasi-conjugate-gradient backtracking
    0 references
    0 references