On the Reynolds-number scaling of Poisson solver complexity
F. Xavier Trias, Àdel Alsalti-Baldellou, Assensi Oliva
TL;DR
The paper investigates how the computational cost of solving the pressure Poisson equation in DNS of incompressible flows scales with Reynolds number. By combining physical scaling arguments from turbulence theory with a detailed analysis of Jacobi and multigrid convergence, the authors derive power-law relationships for the residual and establish a Reynolds-number phase space that predicts the trend of solver iterations. They validate the theory across homogeneous isotropic turbulence, Rayleigh-Bénard convection, bluff-body wakes, and a 1D Burgers model, showing NS turbulence tends to reduce iteration counts with increasing Re while Burgers shows the opposite. The framework yields explicit expressions for the convergence exponent xi and demonstrates that multigrid maintains the same Re-scaling while accelerating convergence, offering guidance for next-generation preconditioning for extreme-scale CFD.
Abstract
We aim to answer the following question: is the complexity of numerically solving the Poisson equation increasing or decreasing for very large simulations of incompressible flows? Physical and numerical arguments are combined to derive power-law scalings at very high Reynolds numbers. A theoretical convergence analysis for both Jacobi and multigrid solvers defines a two-dimensional phase space divided into two regions depending on whether the number of solver iterations tends to decrease or increase with the Reynolds number. Numerical results indicate that, for Navier-Stokes turbulence, the complexity decreases with increasing Reynolds number, whereas for the one-dimensional Burgers equation it follows the opposite trend. The proposed theoretical framework thus provides a unified perspective on how solver convergence scales with the Reynolds number and offers valuable guidance for the development of next-generation preconditioning and multigrid strategies for extreme-scale simulations.
