Monotone iterates for solving nonlinear monotone difference schemes (Q2505232): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q586756
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Ariadna Lucia Pletea / rank
 
Normal rank

Revision as of 08:58, 16 February 2024

scientific article
Language Label Description Also known as
English
Monotone iterates for solving nonlinear monotone difference schemes
scientific article

    Statements

    Monotone iterates for solving nonlinear monotone difference schemes (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references