Abstract
We propose an approximate Newton method for solving the coupled nonlinear system $G(u,t) = 0$ and $N(u,t) = 0$ where $u \in R^n $, $t \in R^m $, $G:R^n \times R^m \mapsto R^n $ and $N:R^n \times R^m \mapsto R^m $. The method involves applying the basic iteration S of a general solver for the equation $G(u,t) = 0$, withtfixed. It is therefore well suited for problems for which such a solver already exists or can be implemented more efficiently than a solver for the coupled system. We derive conditions for S under which the method is locally convergent. Basically, if S is sufficiently contractive for G, then convergence for the coupled system is guaranteed. Otherwise, we show how to construct an $\hat S$ from S for which convergence is assured. These results are applied to continuation methods where N represents a pseudo-arclength condition. We show that under certain conditions the algorithm converges if S is convergent for G. Numerical results are given for a two-level nonlinear multi-grid solver applied to a nonlinear elliptic problem.

This publication has 15 references indexed in Scilit: