Monotone iterates for solving nonlinear monotone difference schemes

From MaRDI portal





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.











This page was built for publication: Monotone iterates for solving nonlinear monotone difference schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505232)