An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients

Abstract

In this paper, a new descent approximate modified residual algorithm is developed to solve a large scale system of nonlinear symmetric equations, where the basic strategy to improve its numerical performance is to approximately compute the gradients and the difference of gradients. The error bounds of this approximation are presented, and in virtue of this approximation, a conjugate gradient algorithm for solving large-scale optimization problems in the literature is extended to solve the system of nonlinear symmetric equations without needs of computing and storing the Jacobian matrices or their approximate matrices. It is proved that the obtained search directions in our developed algorithm are sufficiently decent with respect to the so-called approximate modified residues. Under mild assumptions, global and local convergence results of the developed algorithm are proved. Numerical tests indicate that the developed algorithm outperforms the other similar ones available in the literature.