论文信息 - The secant/finite difference algorithm for solving sparse nonlinear systems of equations

The secant/finite difference algorithm for solving sparse nonlinear systems of equations

Abstract : This paper presents an algorithm, the secant/finite difference algorithm, for solving sparse nonlinear systems of equations. This algorithm is a combination of a finite difference method and a secant method. A q-superlinear convergence result and an r-convergence rate estimate show that this algorithm has good local convergence properties. The numerical results indicate that this algorithm is probably more efficient than some currently used algorithms.

Guangye Li | Guangye Li

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

[2] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[3] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

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

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

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

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

[8] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.

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

[10] M. Powell,et al. On the Estimation of Sparse Hessian Matrices , 1979 .

[11] John E. Dennis,et al. On the Convergence of Broyden's Method for Nonlinear Systems of Equations , 1971 .

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

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