Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations (Q1075739)

From MaRDI portal
Revision as of 13:19, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
scientific article

    Statements

    Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations (English)
    0 references
    0 references
    1987
    0 references
    We present a quasi-Newton type method, which applies to large and sparse nonlinear systems of equations and uses the Q-R factorization of the approximate Jacobians. This method belongs to a more general class of algorithms for which we prove a local convergence theorem. Some numerical experiments seem to confirm that the new algorithm is reliable.
    0 references
    local convergence
    0 references
    numerical experiments
    0 references
    quasi-Newton methods
    0 references
    factorization of matrices
    0 references

    Identifiers