A scalable high-order multigrid-FFT Poisson solver for unbounded domains on adaptive multiresolution grids
By: Gilles Poncelet , Jonathan Lambrechts , Thomas Gillis and more
Potential Business Impact:
Solves hard math problems faster for science.
Multigrid solvers are among the most efficient methods for solving the Poisson equation, which is ubiquitous in computational physics. For example, in the context of incompressible flows, it is typically the costliest operation. The present document expounds upon the implementation of a flexible multigrid solver that is capable of handling any type of boundary conditions within murphy, a multiresolution framework for solving partial differential equations (PDEs) on collocated adaptive grids. The utilization of a Fourier-based direct solver facilitates the attainment of flexibility and enhanced performance by accommodating any combination of unbounded and semi-unbounded boundary conditions. The employment of high-order compact stencils contributes to the reduction of communication demands while concurrently enhancing the accuracy of the system. The resulting solver is validated against analytical solutions for periodic and unbounded domains. In conclusion, the solver has been demonstrated to demonstrate scalability to 16,384 cores within the context of leading European high-performance computing infrastructures.
Similar Papers
A FFT-based GMRES for fast solving of Poisson equation in concatenated geometry
Numerical Analysis
Solves hard math problems much faster for computers.
Large-scale Multigrid with Adaptive Galerkin Coarsening
Performance
Solves huge math problems faster with less memory.
Implementation techniques for multigrid solvers for high-order Discontinuous Galerkin methods
Numerical Analysis
Makes computer simulations run much faster.