论文信息 - A hybrid algorithm for solving sparse nonlinear systems of equations

A hybrid algorithm for solving sparse nonlinear systems of equations

This paper presents a hybrid algorithm for solving sparse nonlinear systems of equations. The algorithm is based on dividing the columns of the Jacobian into two parts and using different algorithms on each part. The hybrid algorithm incorporates advantages of both component algorithms by exploiting the special structure of the Jacobian to obtain a good approximation to the Jacobian, using as little effort as possible. A Kantorovich-type analysis and a locally q-superlinear convergence result for this algorithm are given.

J. Dennis | Guangye Li

[1] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[2] Guangye Li,et al. The secant/finite difference algorithm for solving sparse nonlinear systems of equations , 1986 .

[3] John D. Ramsdell,et al. Estimation of Sparse Jacobian Matrices , 1983 .

[4] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[5] J. J. Moré,et al. Estimation of sparse jacobian matrices and graph coloring problems , 1983 .

[6] E. Marwil,et al. Convergence Results for Schubert’s Method for Solving Sparse Nonlinear Equations , 1979 .

[7] J. J. Moré,et al. Quasi-Newton Methods, Motivation and Theory , 1974 .

[8] M. Powell,et al. On the Estimation of Sparse Jacobian Matrices , 1974 .

[9] C. G. Broyden,et al. The convergence of an algorithm for solving sparse nonlinear systems , 1971 .

[10] C. G. Broyden. A Class of Methods for Solving Nonlinear Simultaneous Equations , 1965 .

[11] Lenhart K. Schubert. Modification of a quasi-Newton method for nonlinear equations with a sparse Jacobian , 1970 .