A dynamically load-balanced parallel p-adaptive implicit high-order flux reconstruction method for under-resolved turbulence simulation
Links to Fileshttps://arxiv.org/abs/1910.03693
MetadataShow full item record
Type of Work36 pages
journal articles preprints
Citation of Original PublicationWang, Lai; Gobbert, Matthias K.; Yu, Meilin; A dynamically load-balanced parallel p-adaptive implicit high-order flux reconstruction method for under-resolved turbulence simulation; Computational Physics (2019); https://arxiv.org/abs/1910.03693
RightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Subjectsdynamic load balancing
implicit large eddy simulation
implicit high-order flux reconstruction
We present a dynamically load-balanced parallel p-adaptive implicit high-order flux reconstruction method for under-resolved turbulence simulation. The high-order explicit first stage, singly diagonal implicit Runge-Kutta (ESDIRK) method is employed to circumvent the restriction on the time step size. The pseudo transient continuation is coupled with the matrix-free restarted generalized minimal residual (GMRES) method to solve the nonlinear equations at each stage, except the first one, of ESDIRK. We use the spectral decay smoothness indicator as the refinement/coarsening indicator for p-adaptation. A dynamic load balancing technique is developed with the aid of the open-source library ParMETIS. The trivial cost, compared to implicit time stepping, of mesh repartitioning and data redistribution enables us to conduct p-adaptation and load balancing every time step. An isentropic vortex propagation case is employed to study the impact of element weights used in mesh repartitioning on parallel efficiency. We apply the p-adaptive solver for implicit large eddy simulation (ILES) of the transitional flows over a cylinder when Reynolds number (Re) is 3900 and the SD7003 wing when Re is 60000. Numerical experiments demonstrate that a significant reduction in the run time (up to 70%) and total number of solution points (up to 76%) can be achieved with p-adaptation.