TY - JOUR
T1 - An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations
AU - Zhuang, Yu
N1 - Funding Information:
This research was supported in part by the National Science Foundation under NSF Grant no. ACI 0305393, and by NSF cooperative agreement ACI-9619020 through computing resources provided by the National Partnership for Advanced Computational Infrastructure at the San Diego Supercomputer Center and National Center for Supercomputing Applications.
PY - 2007/9/1
Y1 - 2007/9/1
N2 - 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 (Δ th- 1 sqrt(NB / N)) + O (h2) in an H1-type norm, where NB and N, respectively, denote the number of gridpoints on the interface boundaries B and the number of gridpoints on the entire discrete domain.
AB - 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 (Δ th- 1 sqrt(NB / N)) + O (h2) in an H1-type norm, where NB and N, respectively, denote the number of gridpoints on the interface boundaries B and the number of gridpoints on the entire discrete domain.
KW - Domain decomposition
KW - Parabolic equation
KW - Parallel computing
UR - http://www.scopus.com/inward/record.url?scp=34249282729&partnerID=8YFLogxK
U2 - 10.1016/j.cam.2006.08.024
DO - 10.1016/j.cam.2006.08.024
M3 - Article
AN - SCOPUS:34249282729
SN - 0377-0427
VL - 206
SP - 549
EP - 566
JO - Journal of Computational and Applied Mathematics
JF - Journal of Computational and Applied Mathematics
IS - 1
ER -