Abstract
The computation time for a particle simulation where long-reaching forces, such as electrostatic forces for charged particles, have to be taken into account, rises asymptotically with O (N2). A significant reduction of computation time can be achieved by applying a tree code algorithm. The algorithm exploits the idea of grouping suitable particles to macroparticles thus reducing the number of necessary calculations within a reasonably limited error bound. Although this algorithm was developed for astronomical galaxy simulations, it can be also used for simulations of microscopical particle with finite radii. The tree code can be used for an efficient collision routine if some additional boundary conditions are taken into account. This results in an asymptotic computation time dependence of O (N log N).
Sign-in/Register to access full text options 
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.
