A New Broyden rank reduction method to solve large systems of nonlinear equations
We propose a modification of limited memory Broyden methods, called dynamical Broyden rank reduction method, to solve high dimensional systems of nonlinear equations. Based on a thresholding process of singular values, the proposed method determines a priori the rank of the reduced update matrix. It significantly reduces the number of singular values decomposition calls of the update matrix during the iterations. Local superlinear convergence of the method is proved and some numerical examples are displayed.
[1] Dennis, J. E. and Schnabel, R. B. (1983). Nu- merical methods for unconstrained optimiza- tion and nonlinear equations. Prentice-Hall.
[2] Kelley, C. T. (1995). Iterative methods for linear and nonlinear equations. Volume 16 of Frontiers in Applied Mathematics, SIAM, Philadelphia.
[3] Ortega, J. M. and Reinboldt, W. C. (2000). Iterative solution of nonlinear equations in several variables. SIAM, Philadelphia.
[4] Broyden, C. G. (1965). A class of methods for solving nonlinear simultaneous equations. Mathematics of Computation, (19), 577–593.
[5] Broyden, C. G., Dennis, J. E. and Mor/e, J. J.(1973). On the local and superlinear conver- gence of quasi-Newton methods. IMA Journal of Applied Mathematics, (12), 223–245.
[6] Byrd, R. H., Nocedal, J. and Schnabel, R. B.(1994). Representations of quasi-Newton ma- trices and their use in limited memory meth- ods. Mathematical Programming, (63), 129– 156.
[7] Van De Rotten, B. and Verduyn Lunel, S. M.(2003). A limited memory Broyden method to solve high dimensional systems of nonlin- ear equations. Technical Report MI 2003-06, Mathematical Institute, University of Leiden, The Netherlands.
[8] Ziani M. and Guyomarc’h F. (2008). An autoadaptative limited memory Broyden’s method to solve systems of nonlinear equa- tions. Applied Mathematics and Computation,(205), 202–211.