Parallel TREE code for two-component ultracold plasma analysis

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.cpc.2007.09.003

The TREE method has been widely used for long-range interaction {\it N}-body problems. We have developed a parallel TREE code for two-component classical plasmas with open boundary conditions and highly non-uniform charge distributions. The program efficiently handles millions of particles evolved over long relaxation times requiring millions of time steps. Appropriate domain decomposition and dynamic data management were employed, and large-scale parallel processing was achieved using an intermediate level of granularity of domain decomposition and ghost TREE communication. Even though the computational load is not fully distributed in fine grains, high parallel efficiency was achieved for ultracold plasma systems of charged particles. As an application, we performed simulations of an ultracold neutral plasma with a half million particles and a half million time steps. For the long temporal trajectories of relaxation between heavy ions and light electrons, large configurations of ultracold plasmas can now be investigated, which was not possible in past studies.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Parallel TREE code for two-component ultracold plasma analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel TREE code for two-component ultracold plasma analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel TREE code for two-component ultracold plasma analysis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-256109

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.