The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
From MaRDI portal
Publication:5634793
DOI10.2307/2004922zbMath0227.65038OpenAlexW4245772574MaRDI QIDQ5634793
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/2004922
Numerical computation of solutions to systems of equations (65H10) Nonlinear algebraic or transcendental equations (65H99)
Related Items
A new adaptive trust-region method for system of nonlinear equations, On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems, On the local convergence of adjoint Broyden methods, The column-updating method for solving nonlinear equations in Hilbert space, An inexact Newton-like conditional gradient method for constrained nonlinear systems, An interval Newton method, On the updating and assembly of the Hessian matrix in finite element methods, Successive column correction algorithms for solving sparse nonlinear systems of equations, Extension of the Lanczos and CGS methods to systems of nonlinear equations, A modified quasi-Newton method for nonlinear equations, Sinc and the numerical solution of fifth-order boundary value problems, On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems, Between Newton and Cauchy: the diagonal variable metric method; theory and test results, Direct Secant Updates of Matrix Factorizations, A secant method for nonlinear least-squares minimization, A modified Newton-like method for nonlinear equations, Numerical method for the solution of special nonlinear fourth-order boundary value problems., Approximate quasi-Newton methods, A corotational hybrid-Trefftz stress formulation for modelling cohesive cracks, Global convergence of Schubert's method for solving sparse nonlinear equations, A globally convergent inexact Newton method with a new choice for the forcing term, Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations, Local and superlinear convergence for truncated iterated projections methods, On the solution of highly structured nonlinear equations, Partitioned quasi-Newton methods for sparse nonlinear equations, A new nonmonotone line-search trust-region approach for nonlinear systems, Sinc-Galerkin method for solving nonlinear boundary-value problems, Approximation methods for the unconstrained optimization, The substitution secant/finite difference method for large scale sparse unconstrained optimization, Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications, Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations, A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations, An efficient line search trust-region for systems of nonlinear equations, An efficient conjugate gradient trust-region approach for systems of nonlinear equation, Benchmarking results for the Newton-Anderson method, A class of factorization update algorithm for solving systems of sparse nonlinear equations, A Hybrid Algorithm for Solving Sparse Nonlinear Systems of Equations, Inexact methods: Forcing terms and conditioning, Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations, Combining line search and trust-region methods forℓ1-minimization, Subspace projection variants on Newton's method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangular factors of modified matrices
- On the orthonormalization of sparse vectors
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A New Method of Solving Nonlinear Simultaneous Equations
- Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- The Convergence of Single-Rank Quasi-Newton Methods
