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

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

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 (Δ 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.

Original languageEnglish
Pages (from-to)549-566
Number of pages18
JournalJournal of Computational and Applied Mathematics
Volume206
Issue number1
DOIs
StatePublished - Sep 1 2007

Keywords

  • Domain decomposition
  • Parabolic equation
  • Parallel computing

Fingerprint Dive into the research topics of 'An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations'. Together they form a unique fingerprint.

Cite this