A class of factorization update algorithm for solving systems of sparse nonlinear equations

DOI10.1007/BF02007738zbMath0869.65035OpenAlexW1972414980MaRDI QIDQ2565209

Deren Wang, Zhong Zhi Bai

Publication date: 1 September 1997

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02007738

zbMATH Keywords

numerical examplesquasi-Newton methods\(Q\)-superlinear convergencematrix triangular factorizationssparse update algorithmsystems of sparse nonlinear equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (4)

Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization ⋮ Newton's method for the quadratic matrix equation ⋮ Thompson metric method for solving a class of nonlinear matrix equation ⋮ The substitution secant/finite difference method for large scale sparse unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations
• A Quasi-Newton Method Employing Direct Secant Updates of Matrix Factorizations
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
• The Convergence of an Algorithm for Solving Sparse Nonlinear Systems

This page was built for publication: A class of factorization update algorithm for solving systems of sparse nonlinear equations