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.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
- 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
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.