Abstract
We present a treecode algorithm for efficiently computing the real space part of Ewald summation in periodic dipolar systems. The algorithm uses multipole expansion in Cartesian coordinates to approximate the real space interaction between a dipole and a distant cluster of dipoles. The necessary Taylor coefficients are computed efficiently using recurrence relations. Two divide-and-conquer evaluation procedures are described. Test results are presented for systems of randomly generated dipoles.
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.
