A parallel-in-time method based on the Parareal algorithm and High-Order Dynamic Mode Decomposition with applications to fluid simulations
Weifan Liu
TL;DR
This work introduces Parareal-HODMD, a parallel-in-time method that replaces the costly coarse propagator for stiff problems with a data-driven coarse step guided by High-Order Dynamic Mode Decomposition. By running two coarse solvers in parallel and using HODMD to predict corrections from their difference, the method delivers low-cost, accurate coarse updates within the Parareal iterations. Through fluid-structure interaction examples and lubrication-type thin-film flows, the approach achieves significant reductions in serial work and improved speedups over classic Parareal, particularly for long-time simulations. The results suggest a flexible, scalable pathway to accelerate stiff-time integrations on modern heterogeneous architectures, with future work focusing on scalable SVD techniques and expanded parallelism in the DMD computations.
Abstract
The high cost of sequential time integration is one major constraint that limits the speedup of a time-parallel algorithm like the Parareal algorithm due to the difficulty of coarsening time steps in a stiff numerical problem. To address this challenge, we develop a parallel-in-time approach based on the Parareal algorithm, in which we construct a novel coarse solver using a data-driven method based on Dynamic Mode Decomposition in place of a classic time marching scheme. The proposed solver computes an approximation of the solution using two numerical schemes of different accuracies in parallel, and apply High-Order Dynamic Mode Decomposition (HODMD) to reduce the cost of sequential computations. Compared to the original Parareal algorithm, the proposed approach allows for the construction of low-cost coarse solvers for many complicated stiff problems. We demonstrate through several numerical examples in fluid dynamics that the proposed method can effectively reduce the serial computation cost and improve the parallel speedup of long-time simulations which are hard to accelerate using the original Parareal algorithm.
