Metodebevisregistrering
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.
Kilderegistrering
Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.
Fast Multipole Method (FMM)
Taksonomisk metoderegistrering · 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
Kuraterede påstande
Påstande gemt i bevis-loggen, hver med sin egen vurdering.
Ingen kuraterede påstande endnu
Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.
Relaterede metoder
Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.