Corrected explicit-implicit domain decomposition algorithms for two-dimensional semilinear parabolic equations (Q1047886)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Corrected explicit-implicit domain decomposition algorithms for two-dimensional semilinear parabolic equations
scientific article

    Statements

    Corrected explicit-implicit domain decomposition algorithms for two-dimensional semilinear parabolic equations (English)
    0 references
    6 January 2010
    0 references
    This paper is concerned with a corrected explicit-implicit domain decomposition algorithm for the numerical approximation of semilinear parabolic problems on distributed memory processors. First, the spatial domain is divided into smaller parallel strips and cells by straightlines interfaces. At each time level, predictive values are obtained by using the forward Euler scheme on the man-made interior boundary and then subdomain solutions are obtained by means of the backward Euler scheme. Once the subdomain solutions are available, the interface solutions are recomputed by the fully implicit scheme. By using the Leray-Schauder fixed point theorem combined with the discrete energy method, the authors prove that the algorithm is uniquely solvable, unconditionally stable and convergent. In particular, an improved error estimate is achieved. Various numerical results are presented to confirm the stability and accuracy of the method.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    explicit-implicit domain decomposition method
    0 references
    semilinear parabolic problem
    0 references
    convergence
    0 references
    stability
    0 references
    algorithm
    0 references
    backward Euler scheme
    0 references
    discrete energy method
    0 references
    error estimate
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references