FFTs and three-dimensional Poisson solvers for hypercubes

DOI10.1016/S0167-8191(05)80100-0MaRDI QIDQ1175197zbMATH OpenOpenAlexFDO

Authors Roland A. Sweet, William L. Briggs, Suely Oliveira, Jules L. Porsche, Thomas Turnbull

Publication date 25 June 1992

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(05)80100-0

zbMATH Keywords

fast Fourier transformsfast Poisson solvershypercubesparallel computationperformancePoisson's equationthree-dimensional Poisson solvers

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05)

Review text

In many applications, very much fast Fourier transforms (FFTs) need to be computed. An important example is provided by various fast Poisson solvers. In particular, Poisson's equation on a cube can be solved by using Fourier transforms in two directions and tridiagonal linear equation solvers for the third coordinate. This paper is a careful study of the performance of various strategies to parallelize these algorithms on hypercubes. A number of alternatives for the FFT are introduced and formulas for their running time are developed and compared with actual performance on an Intel system. A similar study is then conducted for fast Poisson solvers. The paper ends with a discussion of two additional Poisson solvers, which had not been tested by the time of the completion of this project.

Recommendations

• scientific article; zbMATH DE number 278847
• A vectorized multigrid solver for the three-dimensional Poisson equation
• scientific article; zbMATH DE number 3942950
• A fast 3D Poisson solver of arbitrary order accuracy
• FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube
• An FFT based fast Poisson solver on spherical shells
• A hierarchical 3-D Poisson modified Fourier solver by domain decomposition
• P3DFFT: A framework for parallel computations of Fourier transforms in three dimensions
• Fast and high accuracy multigrid solution of the three dimensional Poisson equation
• High-order compact solvers for the three-dimensional Poisson equation

Cited in

(12)

• Fast Poisson solvers for MIMD computers
• Vector and parallel methods for the direct solution of Poisson's equation
• FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube
• OPTIMIZATION OF CONNECTION MACHINE PERFORMANCE
• Hybrid MPI + OpenMP parallelization of an FFT-based 3D Poisson solver with one periodic direction
• scientific article; zbMATH DE number 4074407 (Why is no real title available?)
• scientific article; zbMATH DE number 1875374 (Why is no real title available?)
• A flexible framework for multidimensional DFTs
• scientific article; zbMATH DE number 4182748 (Why is no real title available?)
• FLUPS: a Fourier-based library of unbounded Poisson solvers
• PoisFFT -- a free parallel fast Poisson solver
• GPU-advanced 3D electromagnetic simulations of superconductors in the Ginzburg-Landau formalism

This page was built for publication: FFTs and three-dimensional Poisson solvers for hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175197)