Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations

From MaRDI portal





This paper presents a numerical comparison of eight algorithms: Newton's method, Broyden's first method, Schubert's method, the Dennis-Marwil method, and three methods of Martínez's family (the diagonal-scaling method, the row-scaling method and column-scaling method) as applied to solving large sparse nonlinear systems of equations. A survey of convergence results concerning these methods, of various stopping criteria and restarting criteria as well as strategies for singularity and step control is given. Aspects of global implementation of these methods are also examined. Finally, numerical experiments both with local and global algorithms are reported.




Cited in
(57)


Describes a project that uses

Uses Software






This page was built for publication: Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations

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