Another preprocessing algorithm for generalized one-dimensional fast multipole method
DOI10.1016/j.jcp.2003.10.018zbMath1055.65135OpenAlexW2050992248MaRDI QIDQ598364
Publication date: 6 August 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.10.018
numerical examplessingular value decompositionparticle interactionsComputational complexityFast matrix-vector multiplicationFast multipole methodFast polynomial interpolationFast spherical filterFast spherical harmonic transformLow-rank approximation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform
- A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics
- A fast spherical filter with uniform resolution
- A fast spherical harmonics transform algorithm
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- A fast algorithm for particle simulations
This page was built for publication: Another preprocessing algorithm for generalized one-dimensional fast multipole method