A fast algorithm for three-dimensional potential fields calculation: fast Fourier transform on multipoles.
From MaRDI portal
Publication:1418648
DOI10.1016/j.jcp.2003.07.004zbMath1117.78334MaRDI QIDQ1418648
Publication date: 14 January 2004
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2003.07.004
65T50: Numerical methods for discrete and fast Fourier transforms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method of local corrections for computing the velocity field due to a distribution of vortex blobs
- A fast adaptive multipole algorithm in three dimensions
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Recursions for the Computation of Multipole Translation and Rotation Coefficients for the 3-D Helmholtz Equation
- Multipole Translation Theory for the Three-Dimensional Laplace and Helmholtz Equations
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- A fast algorithm for three‐dimensional electrostatics analysis: fast Fourier transform on multipoles (FFTM)
- A fast algorithm for particle simulations
- A fast, high-order algorithm for the solution of surface scattering problems: Basic implementation, tests, and applications