A comparative analysis of the monotone iteration method for elliptic problems
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.
- Monotone iterations for numerical solutions of nonlinear elliptic partial differential equations
- Block monotone iterative methods for numerical solutions of nonlinear elliptic equations
- Monotone iterative methods for numerical solutions of nonlinear integro-elliptic boundary problems
- On accelerated monotone iterations for numerical solutions of semilinear elliptic boundary value problems
- Block Monotone Iterations for Numerical Solutions of Fourth-Order Nonlinear Elliptic Boundary Value Problems
- Monotone iterations for numerical solutions of nonlinear elliptic partial differential equations
- Accelerated monotone iterations for numerical solutions of nonlinear elliptic boundary value problems
- Block monotone iterative methods for numerical solutions of nonlinear elliptic equations
- Comparison theorems for algorithmic models
- scientific article; zbMATH DE number 3854324 (Why is no real title available?)
- Zur Effektivität des Verfahrens der monotonen Iteration bei semilinearen parabolischen und elliptischen Randwertproblemen
- Iterative Galerkin discretizations for strongly monotone problems
This page was built for publication: A comparative analysis of the monotone iteration method for elliptic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928463)