.png){kind=icon}
Return
A parallel-in-time algorithm for variable step multistep methods
.png){kind=icon}
OA
AI
DOI：10.1016/j.jocs.2019.101029.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a multigrid reduction in time (MGRIT) algorithm for achieving time parallelism using multistep backward difference formula (BDF) methods on variably-spaced temporal grids. This MGRIT approach transforms the linear multistep methods into single step methods applied to groups of time steps. Stability considerations are addressed through lowering of the order on coarse grids. The methods are presented for fixed and variable time step formulations. Numerical results show moderate speedups for the heat equation as well as two IEEE power grid test problems characterized by nonlinear differential algebraic equations (DAE) of index 1. The performance of MGRIT with BDF is compared to MGRIT with Runge-Kutta for both the fixed and variable step methods of the same order. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Parallel in time
Differential-algebraic systems
Power grid simulations
Multigrid reduction in time
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
Cited Papers
.png){kind=icon}
Investigation of Leukocyte Viability in A Setup of Spiral Microchannel for Cell Sorting Application
PREAI
ShareSaveShareSaveShareSave
ShareSave
View more