Monotone iterates for solving nonlinear monotone difference schemes (Q2505232)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Monotone iterates for solving nonlinear monotone difference schemes |
scientific article; zbMATH DE number 5059718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotone iterates for solving nonlinear monotone difference schemes |
scientific article; zbMATH DE number 5059718 |
Statements
Monotone iterates for solving nonlinear monotone difference schemes (English)
0 references
4 October 2006
0 references
The focus of this paper is to extend the author's results [J. Comput. Appl. Math. 162, 445--466 (2004; Zbl 1041.65078)]. The extension is of the monotone domain decomposition algorithm to the nonlinear monotone difference schemes in the canonical form. These difference schemes arise in numerical solving of some differential and integral equations. The construction of the algorithm is presented and its monotone convergence is proved. Some numerical experiments where iteration counts and execution times between the monotone (undecomposed) iterative method and the monotone domain decomposition algorithm are compared at the end of the article.
0 references
monotone schemes
0 references
monotone convergence
0 references
domain decomposition
0 references
algorithm
0 references
nonlinear reaction-diffusion singular perturbation
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0.917614221572876
0 references
0.85834139585495
0 references
0.8579656481742859
0 references
0.8525742292404175
0 references