An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations

Authors:
Yu Zhuang
Affiliations:
Department of Computer Science, Texas Tech University, Lubbock, TX 79409-3104, USA
Venue:
Journal of Computational and Applied Mathematics
Year:
2007

Citing 15
Cited 0

A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation

SIAM Journal on Scientific and Statistical Computing
Domain decomposition on parallel computers

IMPACT of Computing in Science and Engineering
Polynomial collocation using a domain decomposition solution to parabolic PDE's via the penalty method and explicit/implicit time marching

Journal of Scientific Computing
Multiplicative Schwarz methods for parabolic problems

SIAM Journal on Scientific Computing
Explicit/implicit, conservative domain decomposition procedures for parabolic problems based on block-centered finite differences

SIAM Journal on Numerical Analysis
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
A highly accurate fast solver for Helmholtz equations

ICS '97 Proceedings of the 11th international conference on Supercomputing
Domain Decomposition Operator Splittings for the Solution of Parabolic Equations

SIAM Journal on Scientific Computing
A high order ADI method for separable generalized Helmholtz equations

Advances in Engineering Software - Special issue on large-scale analysis, design and intelligent synthesis environments
Unconditional stability of parallel alternating difference schemes for semilinear parabolic systems

Applied Mathematics and Computation
A high-order fast direct solver for singular Poisson equation

Journal of Computational Physics
Stable, globally non-iterative, non-overlapping domain decomposition parallel solvers for parabolic problems

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Stabilized Explicit-Implicit Domain Decomposition Methods for the Numerical Solution of Parabolic Equations

SIAM Journal on Scientific Computing
A class of stable, globally noniterative, nonoverlapping domain decomposition algorithms for the simulation of parabolic evolutionary systems

A class of stable, globally noniterative, nonoverlapping domain decomposition algorithms for the simulation of parabolic evolutionary systems
A parallel and efficient algorithm for multicompartment neuronal modelling

Neurocomputing

Quantified Score

Hi-index	7.29

Visualization

Abstract

Explicit-implicit domain decomposition (EIDD) is a class of globally non-iterative, non-overlapping domain decomposition methods for the numerical solution of parabolic problems on parallel computers, which are highly efficient both computationally and communicationally for each time step. In this paper an alternating EIDD method is proposed which is algorithmically simple, efficient for each time step, highly parallel, and satisfies a stability condition that imposes no additional restriction to the time step restriction imposed by the consistency condition, which guarantees a convergence of order O(@Dth^-^1N"B/N)+O(h^2) in an H^1-type norm, where N"B and N, respectively, denote the number of gridpoints on the interface boundaries B and the number of gridpoints on the entire discrete domain.