Fast Fourier Transform Accelerated Fast Multipole Algorithm
From MaRDI portal
Publication:4874548
Recommendations
- Fast multipole methods and applications
- scientific article; zbMATH DE number 3894433
- scientific article; zbMATH DE number 610966
- Fast computation of multidimensional DFT
- Fast and accurate polar Fourier transform
- Fast and precise Fourier transforms
- Accelerating the Nonuniform Fast Fourier Transform
- Fast computation of partial Fourier transforms
- Fast Fourier orthogonalization
Cited in
(28)- Characterization of the accuracy of the fast multipole method in particle simulations
- A fast algorithm for three-dimensional potential fields calculation: fast Fourier transform on multipoles.
- A fast algorithm for three‐dimensional electrostatics analysis: fast Fourier transform on multipoles (FFTM)
- High performance BLAS formulation of the multipole-to-local operator in the fast multipole method
- Application of new fast multipole boundary integral equation method to crack problems in 3D
- The fast multipole method: Numerical implementation
- Efficient fast multipole method for low-frequency scattering
- The FFT as a Multigrid Algorithm
- Fast Computation of Multidimensional Fourier Integrals
- Grid-Multipole Calculations
- Fast Reciprocal Jacket Transform With Many Parameters
- scientific article; zbMATH DE number 749848 (Why is no real title available?)
- Analytical solutions for a single blade in vertical axis turbine motion in two-dimensions
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Application of fast multipole Galerkin boundary integral equation method to elastostatic crack problems in 3D
- An efficient algorithm for hydrodynamical interaction of many deformable drops
- High performance BLAS formulation of the adaptive fast multipole method
- Fast multipole methods for particle dynamics
- Communications overlapping in fast multipole particle dynamics methods
- Efficient Evaluation of the Rokhlin Translator in Multilevel Fast Multipole Algorithm
- A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D
- Yet another fast multipole method without multipoles -- pseudoparticle multipole method
- Application of the fast multipole method for the evaluation of magnetostatic fields in micromagnetic computations
- A parallel version of the fast multipole method
- Improved Twiddle Access for Fast Fourier Transforms
- A fast adaptive multipole algorithm for calculating screened Coulomb (Yukawa) interactions
- Fast evaluation of vector splines in three dimensions
- A particle method and adaptive treecode for vortex sheet motion in three-dimensional flow
This page was built for publication: Fast Fourier Transform Accelerated Fast Multipole Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4874548)
