方法证据记录
Fast Multipole Method
The Fast Multipole Method (FMM) is a hierarchical algorithm that reduces the computational complexity of particle interactions from O(n²) to O(n log n) or O(n), developed by Greengard and Rokhlin in 1987. By grouping distant particles and approximating their cumulative effects via multipole expansions, FMM enables efficient simulation of N-body problems, boundary integral equations, and Coulomb interactions.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Fast Multipole Method (FMM)
分类方法记录 · ml-model / numerical-methods
- Greengard, L., & Rokhlin, V. (1987). A fast algorithm for particle simulations. Journal of Computational Physics, 73(2), 325–348. · DOI 10.1016/0021-9991(87)90140-9
- Greengard, L. (1988). The Rapid Evaluation of Potential Fields in Particle Systems. MIT Press. · ISBN 0262071088
- Ying, L., Biros, G., & Zorin, D. (2004). A kernel-independent adaptive fast multipole method. Journal of Computational Physics, 196(2), 591–626. · URL
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。