Abstract
A treecode algorithm is presented for computing the electrostatic potential and electric field in a system of charged particles. The algorithm is grid-free and with N particles it reduces the operation count to O ( N log N ) , as opposed to O ( N 2 ) which is required for direct summation of pairwise interactions. The key idea is to replace the particle–particle interactions by particle–cluster interactions which are evaluated using a Taylor approximation in Cartesian coordinates. The treecode is combined here with a boundary integral method to simulate electron dynamics in a Penning–Malmberg trap.
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.
