FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube
From MaRDI portal
Publication:2815697
parallel computingfast Fourier transformmultigridfast multipole methodco-designPoisson solversexascale algorithms
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical methods for discrete and fast Fourier transforms (65T50) Multipole methods applied to problems in optics and electromagnetic theory (78M16)
Abstract: In this work, we benchmark and discuss the performance of the scalable methods for the Poisson problem which are used widely in practice: the fast Fourier transform (FFT), the fast multipole method (FMM), the geometric multigrid (GMG), and algebraic multigrid (AMG). In total we compare five different codes, three of which are developed in our group. Our FFT, GMG, and FMM are parallel solvers that use high-order approximation schemes for Poisson problems with continuous forcing functions (the source or right-hand side). We examine and report results for weak scaling, strong scaling, and time to solution for uniform and highly refined grids. We present results on the Stampede system at the Texas Advanced Computing Center and on the Titan system at the Oak Ridge National Laboratory. In our largest test case, we solved a problem with 600 billion unknowns on 229,379 cores of Titan. Overall, all methods scale quite well to these problem sizes. We have tested all of the methods with different source functions (the right-hand side in the Poisson problem). Our results indicate that FFT is the method of choice for smooth source functions that require uniform resolution. However, FFT loses its performance advantage when the source function has highly localized features like internal sharp layers. FMM and GMG considerably outperform FFT for those cases. The distinction between FMM and GMG is less pronounced and is sensitive to the quality (from a performance point of view) of the underlying implementations. The high-order accurate versions of GMG and FMM significantly outperform their low-order accurate counterparts.
Recommendations
Cites work
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 671776 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
- A fast adaptive multipole algorithm in three dimensions
- A free-space adaptive FMM-based PDE solver in three dimensions
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A local corrections algorithm for solving Poisson's equation in three dimensions
- A new fast-multipole accelerated Poisson solver in two dimensions
- Algorithm 967
- An overview of the Trilinos project
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Comparison of multigrid algorithms for high-order continuous finite element discretizations.
- FFTs and three-dimensional Poisson solvers for hypercubes
- High-Order Methods for Incompressible Fluid Flow
- Hybrid multigrid/Schwarz algorithms for the spectral element method
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multiprocessor FFTs
- P3DFFT: A framework for parallel computations of Fourier transforms in three dimensions
- PFFT: An extension of FFTW to massively parallel architectures
- PPM -- a highly efficient parallel particle-mesh library for the simulation of continuum systems
- Parallel Algorithms for the Spectral Transform Method
- SuperLU_DIST
- deal.II—A general-purpose object-oriented finite element library
- p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees
Cited in
(32)- FLUPS: a Fourier-based library of unbounded Poisson solvers
- A direction-splitting Navier-Stokes solver on co-located grids
- High-performance implementation of discontinuous Galerkin methods with application in fluid flow
- Quantifying mixing in arbitrary fluid domains: a Padé approximation approach
- A fast multi-resolution lattice Green's function method for elliptic difference equations
- An integral equation method for the Cahn-Hilliard equation in the wetting problem
- Extreme scale FMM-accelerated boundary integral equation solver for wave scattering
- Hybrid multigrid methods for high-order discontinuous Galerkin discretizations
- A High-Accurate Fast Poisson Solver Based on Harmonic Surface Mapping Algorithm
- \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators
- Computation of volume potentials on structured grids with the method of local corrections
- A fast algorithm for fractional Helmholtz equation with application to electromagnetic waves propagation
- Scaling to the stars -- a linearly scaling elliptic solver for \(p\)-multigrid
- FFTs and three-dimensional Poisson solvers for hypercubes
- A source term method for Poisson problems with a discontinuous diffusion coefficient
- Lattice Green’s Functions for High-Order Finite Difference Stencils
- Sparse grid-based adaptive noise reduction strategy for particle-in-cell schemes
- Efficient numerical algorithms based on difference potentials for chemotaxis systems in 3D
- Hybrid numerical method for the Allen-Cahn equation on nonuniform grids
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- An iterative method for elliptic problems with rapidly oscillating coefficients
- An efficient Poisson solver for complex embedded boundary domains using the multi-grid and fast multipole methods
- A performance comparison of continuous and discontinuous Galerkin methods with fast multigrid solvers
- High-order adaptive mesh refinement multigrid Poisson solver in any dimension
- Computing homogenized coefficients \textit{via} multiscale representation and hierarchical hybrid grids
- Geometric multigrid method for solving Poisson's equation on octree grids with irregular boundaries
- A geometric multigrid library for quadtree/octree AMR grids coupled to MPI-AMRVAC
- Fast immersed interface Poisson solver for 3D unbounded problems around arbitrary geometries
- A regularization method for solving the Poisson equation for mixed unbounded-periodic domains
- Finite difference preconditioning for compact scheme discretizations of the Poisson equation with variable coefficients
- An efficient extrapolation full multigrid method for elliptic problems in two and three dimensions
- A Multilevel Algebraic Error Estimator and the Corresponding Iterative Solver with $p$-Robust Behavior
Describes a project that uses
Uses Software
This page was built for publication: FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815697)
