A comparative analysis of the monotone iteration method for elliptic problems (Q5928463)

The paper is concerned with theoretical and numerical aspects of monotone iteration methods, in particular for boundary value problems with second-order semilinear elliptic equations (scalar or cooperative systems). The main emphasis is put on a comparison between monotone iteration and Newton iteration, with the central conclusion that monotone iteration may have advantages in certain situations since the initial approximations (sub- and supersolution) need not be ``close'' to the true solution, in contrast to Newton's iteration. The observations are illustrated by several numerical examples.