论文信息 - The convergence of an algorithm for solving sparse nonlinear systems

The convergence of an algorithm for solving sparse nonlinear systems

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

C. G. Broyden | By C. G. Broyden

[1] L. Kantorovich,et al. Functional analysis in normed spaces , 1952 .

[2] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .

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

[4] J. M. Bennett. Triangular factors of modified matrices , 1965 .

[5] William F. Tinney,et al. Power Flow Solution by Newton's Method , 1967 .

[6] Allen A. Goldstein,et al. Constructive Real Analysis , 1967 .

[7] Reginald P. Tewarson,et al. The Gaussian elimination and sparse systems , 1968 .

[8] C. G. Broyden. A New Method of Solving Nonlinear Simultaneous Equations , 1969, Comput. J..

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

[10] C. G. Broyden. The convergence of single-rank quasi-Newton methods , 1970 .

[11] Fred G. Gustavson,et al. Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations , 1970, JACM.