Abstract
The aim of this article is to develop a new block monotone iterative method for the numerical solutions of a nonlinear elliptic boundary value problem. The boundary value problem is discretized into a system of nonlinear algebraic equations, and a block monotone iterative method is established for the system using an upper solution or a lower solution as the initial iteration. The sequence of iterations can be computed in a parallel fashion and converge monotonically to a maximal solution or a minimal solution of the system. Three theoretical comparison results are given for the sequences from the proposed method and the block Jacobi monotone iterative method. The comparison results show that the sequence from the proposed method converges faster than the corresponding sequence given by the block Jacobi monotone iterative method. A simple and easily verified condition is obtained to guarantee a geometric convergence of the block monotone iterations. The numerical results demonstrate advantages of this new approach.
| Original language | English |
|---|---|
| Pages (from-to) | 680-701 |
| Number of pages | 22 |
| Journal | Numerical Methods for Partial Differential Equations |
| Volume | 27 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 2011 |
Keywords
- block monotone iterative method
- elliptic boundary value problem
- finite difference system
- geometric convergence
- parallel computation
- upper and lower solutions