Abstract

This paper presents some recent advances for parallel-in-time methods applied to linear elasticity. With recent computer architecture changes leading to stagnant clock speeds, but ever increasing numbers of cores, future speedups will be available through increased concurrency. Thus, sequential algorithms, such as time stepping, will suffer a bottleneck. This paper explores multigrid reduction in time (MGRIT) for an important application area, linear elasticity. Previously, efforts at parallel-in-time for elasticity have experienced difficulties, for example, the beating phenomenon. As a result, practical parallel-in-time algorithms for this application area currently do not exist. This paper proposes some solutions made possible by MGRIT (e.g., slow temporal coarsening and FCF-relaxation) and, more importantly, a different formulation of the problem that is more amenable to parallel-in-time methods. Using a recently developed convergence theory for MGRIT and Parareal, we show that the changed formulation of the problem avoids the instability issues and allows the reduction of the error using two temporal grids. We then extend our approach to the multilevel case, where we demonstrate how slow temporal coarsening improves convergence. The paper ends with supporting numerical results showing a practical algorithm enjoying speedup benefits over the sequential algorithm.

Original languageEnglish
Article numbere2155
JournalNumerical Linear Algebra with Applications
Volume25
Issue number3
Early online date14 Feb 2018
DOIs
Publication statusPublished - 1 May 2018

Keywords

  • convergence estimate
  • linear elasticity
  • multigrid reduction in time (MGRIT)
  • parallel-in-time

Fingerprint

Dive into the research topics of 'Convergence of the multigrid reduction in time algorithm for the linear elasticity equations'. Together they form a unique fingerprint.

Cite this