A methodology towards automatic implementation of \(N\)-body algorithms

DOI10.1016/S0168-9274(01)00061-7zbMath1009.70002MaRDI QIDQ5957860

No author found.

Publication date: 7 April 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(N\)-body problemcompilable codefast discrete transform algorithmmatrix notationtransform matrix

Mathematics Subject Classification ID

Computational methods for problems pertaining to mechanics of particles and systems (70-08) (n)-body problems (70F10) Numerical methods in Fourier analysis (65T99)

Uses Software

• FFTW

Cites Work

• Unnamed Item
• Unnamed Item
• Modification of the Carrier, Greengard, and Rokhlin FMM for independent source and target fields
• Structured matrix representations of two-parameter Hankel transforms in adaptive optics
• On the numerical evaluation of elastostatic fields in locally isotropic two-dimensional composites
• A Matrix Version of the Fast Multipole Method
• Fast wavelet transforms and numerical algorithms I
• A Fast Adaptive Multipole Algorithm for Particle Simulations
• An Implementation of the Fast Multipole Method without Multipoles
• An Improved Fast Multipole Algorithm for Potential Fields
• A Method of Images for the Evaluation of Electrostatic Fields in Systems of Closely Spaced Conducting Cylinders
• The Fast Gauss Transform
• A fast algorithm for particle simulations

This page was built for publication: A methodology towards automatic implementation of \(N\)-body algorithms