Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations

Abstract EN

Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method.

In particular, Schubert’s method has been proved to be locally and q-superlinearly convergent.

In this paper, we globalize Schubert’s method by using a nonmonotone line search.

Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly.

Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.