Abstract
Modern high-performance computing (HPC) systems are increasingly built with graphics processing units (GPUs) as the primary computing device and are increasingly targeted at highly parallel applications. It is thus of great importance to make efficient use of GPUs for time-implicit solvers for computational fluid dynamics. While highly parallel linear relaxations, such as Jacobi, have existed for a long time, they often suffer from poor convergence rates. We demonstrate that a new crop of fine-grain parallel point-block linear iterations drawn from asynchronous iterations and sparse approximate inverses can achieve robust and scalable speedups over the current state of practice – multicolour Gauss–Seidel iterations – on three generations of GPUs in the context of nonlinear multigrid solvers on multi-block structured grids for compressible Reynolds-averaged Navier–Stokes (RANS) simulations.
| Original language | English |
|---|---|
| Article number | 106714 |
| Journal | Computers and Fluids |
| Volume | 299 |
| DOIs | |
| State | Published - Aug 30 2025 |
Funding
We thank Dr Hong Yang of Bombardier Aerospace for his help with the contour plots shown on this paper. We gratefully acknowledge funding from the Natural Sciences and Engineering Research Council (NSERC) of Canada , Consortium for Research and Innovation in Aerospace in Canada (CARIC) and Québec (CRIAQ), Canada , Bombardier Aerospace, Canada and Cray Inc, Canada .
Keywords
- Asynchronous iterations
- Compressible flow
- External aerodynamics
- Graphics processing unit
- Parallel preconditioner
- Sparse approximate inverse