The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
- 1 April 1971
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 25 (114) , 285-294
- https://doi.org/10.2307/2004922
Abstract
A new algorithm for solving systems of nonlinear equations where the Jacobian is known to be sparse is shown to converge locally if a sufficiently good initial estimate of the solution is available and if the Jacobian satisfies a Lipschitz condition. The results of numerical experiments are quoted in which systems of up to 600 equations have been solved by the method.Keywords
This publication has 6 references indexed in Scilit:
- The Convergence of Single-Rank Quasi-Newton MethodsMathematics of Computation, 1970
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse JacobianMathematics of Computation, 1970
- A New Method of Solving Nonlinear Simultaneous EquationsThe Computer Journal, 1969
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- A Class of Methods for Solving Nonlinear Simultaneous EquationsMathematics of Computation, 1965
- Triangular factors of modified matricesNumerische Mathematik, 1965