The Convergence of an Algorithm for Solving Sparse Nonlinear Systems

Cites work

scientific article; zbMATH DE number 3206518 (Why is no real title available?)
scientific article; zbMATH DE number 3302906 (Why is no real title available?)
scientific article; zbMATH DE number 3408799 (Why is no real title available?)
A Class of Methods for Solving Nonlinear Simultaneous Equations
A New Method of Solving Nonlinear Simultaneous Equations
Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
On the orthonormalization of sparse vectors
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
The Convergence of Single-Rank Quasi-Newton Methods
Triangular factors of modified matrices

Cited in

(41)

Direct Secant Updates of Matrix Factorizations
Global convergence of Schubert's method for solving sparse nonlinear equations
On the local convergence of adjoint Broyden methods
A class of factorization update algorithm for solving systems of sparse nonlinear equations
Subspace projection variants on Newton's method
On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems
Extension of the Lanczos and CGS methods to systems of nonlinear equations
An efficient conjugate gradient trust-region approach for systems of nonlinear equation
Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
A corotational hybrid-Trefftz stress formulation for modelling cohesive cracks
A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations
A new adaptive trust-region method for system of nonlinear equations
Sinc-Galerkin method for solving nonlinear boundary-value problems
The substitution secant/finite difference method for large scale sparse unconstrained optimization
The column-updating method for solving nonlinear equations in Hilbert space
Sinc and the numerical solution of fifth-order boundary value problems
Between Newton and Cauchy: the diagonal variable metric method; theory and test results
Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
An inexact Newton-like conditional gradient method for constrained nonlinear systems
Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
An efficient line search trust-region for systems of nonlinear equations
Numerical method for the solution of special nonlinear fourth-order boundary value problems.
On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems
A new nonmonotone line-search trust-region approach for nonlinear systems
A secant method for nonlinear least-squares minimization
A modified quasi-Newton method for nonlinear equations
Benchmarking results for the Newton-Anderson method
Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations
Inexact methods: Forcing terms and conditioning
A modified Newton-like method for nonlinear equations
On the solution of highly structured nonlinear equations
Combining line search and trust-region methods forℓ1-minimization
A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations
Successive column correction algorithms for solving sparse nonlinear systems of equations
On the updating and assembly of the Hessian matrix in finite element methods
An interval Newton method
A globally convergent inexact Newton method with a new choice for the forcing term
Local and superlinear convergence for truncated iterated projections methods
Approximation methods for the unconstrained optimization
Approximate quasi-Newton methods
Partitioned quasi-Newton methods for sparse nonlinear equations

This page was built for publication: The Convergence of an Algorithm for Solving Sparse Nonlinear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5634793)