Successive column correction algorithms for solving sparse nonlinear systems of equations

DOI10.1007/BF01582289zbMath0675.65045OpenAlexW2046385114MaRDI QIDQ1122315

Guangye Li

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

algorithmscolumn-update algorithmsparse Broyden algorithmsparse nonlinear systems of equationssuccessive column correction algorithm

Mathematics Subject Classification ID

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

Related Items

Inexact trust region method for large sparse systems of nonlinear equations ⋮ Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation ⋮ Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization ⋮ Hybrid methods for large sparse nonlinear least squares ⋮ On the convergence of partitioning group correction algorithms ⋮ Unnamed Item ⋮ A fast inertial self-adaptive projection based algorithm for solving large-scale nonlinear monotone equations ⋮ Limited memory BFGS method with backtracking for symmetric nonlinear equations ⋮ A limited memory BFGS method for solving large-scale symmetric nonlinear equations ⋮ A choice of forcing terms in inexact Newton iterations with application to pseudo-transient continuation for incompressible fluid flow computations ⋮ Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations^∗ ⋮ Limited memory technique using trust regions for nonlinear equations ⋮ Nonlinear analysis: optimization methods, convergence theory, and applications ⋮ Corrigendum to: ``Krasnosel'skii type hybrid fixed point theorems and their applications to fractional integral equations ⋮ A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Algorithms for solving nonlinear dynamic decision models ⋮ A nonmonotone hybrid method for nonlinear systems^∗ ⋮ Successive element correction algorithms for sparse unconstrained optimization

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• The Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations
• On the Estimation of Sparse Hessian Matrices
• Convergence Results for Schubert’s Method for Solving Sparse Nonlinear Equations
• Testing Unconstrained Optimization Software
• Numerical Solution of Nonlinear Equations
• On the Local and Superlinear Convergence of 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