Abstract
We consider the following force field computation problem: given a duster of n particles in 3-dimensional space, compute the force exerted on each particle by the other particles. Depending on different applications, the pairwise interaction could be either gravitational or Lennard Jones. Since there are n(n−1)/2pairs, direct method requires θ(n2) time. In this paper, we report our computational experiences with a new O(nlogn) time algorithm for fast evaluation of potential and force field in large Lennard – Jones clusters. This algorithm is based on a fair-split tree which guarantees O(nlogn)worst-case time complexity without any restriction on particle distributions. For randomly generated particle systems, our implementation outperforms the direct method when the number of panicles is 500 or larger This is the lowest cross over point ever reported in the literature.
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.
