An asynchronous three-field domain decomposition method for first-order evolution problems

Krupička, Lukáš, and Beneš, Michal. "An asynchronous three-field domain decomposition method for first-order evolution problems." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2015. 118-123. <http://eudml.org/doc/269916>.

@inProceedings{Krupička2015,
abstract = {We present an asynchronous multi-domain time integration algorithm with a dual domain decomposition method for the initial boundary-value problems for a parabolic equation. For efficient parallel computing, we apply the three-field domain decomposition method with local Lagrange multipliers to ensure the continuity of the primary unknowns at the interface between subdomains. The implicit method for time discretization and the multi-domain spatial decomposition enable us to use different time steps (subcycling) on different parts of a computational domain, and thus efficiently capture the underlying physics with less computational effort. We illustrate the performance of the proposed multi-domain time integrator by means of a simple numerical example.},
author = {Krupička, Lukáš, Beneš, Michal},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {asynchronous domain decomposition; time-stepping; first-order evolution problem},
location = {Prague},
pages = {118-123},
publisher = {Institute of Mathematics AS CR},
title = {An asynchronous three-field domain decomposition method for first-order evolution problems},
url = {http://eudml.org/doc/269916},
year = {2015},
}

TY - CLSWK
AU - Krupička, Lukáš
AU - Beneš, Michal
TI - An asynchronous three-field domain decomposition method for first-order evolution problems
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2015
CY - Prague
PB - Institute of Mathematics AS CR
SP - 118
EP - 123
AB - We present an asynchronous multi-domain time integration algorithm with a dual domain decomposition method for the initial boundary-value problems for a parabolic equation. For efficient parallel computing, we apply the three-field domain decomposition method with local Lagrange multipliers to ensure the continuity of the primary unknowns at the interface between subdomains. The implicit method for time discretization and the multi-domain spatial decomposition enable us to use different time steps (subcycling) on different parts of a computational domain, and thus efficiently capture the underlying physics with less computational effort. We illustrate the performance of the proposed multi-domain time integrator by means of a simple numerical example.
KW - asynchronous domain decomposition; time-stepping; first-order evolution problem
UR - http://eudml.org/doc/269916
ER -