Abstract
Exact simulations of huge systems of charged particles are impossible in practice, because their cost proportional to N 2, where N is the number of particles. We present an approximate and simple O( N log N) algorithm based upon the idea of recursive bisection of the set of particles. A small fraction of the particle-particle interactions is evaluated exactly by direct summation, while the rest is approximated via multipole expansions. Our algorithm is easy to program (in particular, in parallel, which is trivial), and it is well suited for system with a non-uniform distribution of particles. For uniform systems, its accuracy and execution time are comparable to other fast methods such as tree codes and the fast multipole method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
