Physics – Nuclear Physics – Nuclear Theory
Scientific paper
1998-11-05
J.Comput.Phys. 162 (2000) 245-266
Physics
Nuclear Physics
Nuclear Theory
36 pages, 15 figures, submitted to Journal of Computational Physics
Scientific paper
10.1006/jcph.2000.6534
We present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the Simulated Annealing method and is dubbed as Simulated Annealing Clusterization Algorithm [SACA]. We discuss the different parameters used in the Simulated Annealing method and present an economical set of the parameters which is based on the extensive analysis carried out for the central and peripheral collisions of Au-Au, Nb-Nb and Pb-Pb. These parameters are crucial for the success of the algorithm. Our set of optimized parameters gives the same results as the most conservative choice, but is very fast. We also discuss the nucleon and fragment exchange processes which are very important for the energy minimization and finally present the analysis of the reaction dynamics using the new algorithm. This algorithm is can be applied whenever one wants to identify which of a given number of constituents form bound objects.
Aichelin Joerg
Puri Rajeev K.
No associations
LandOfFree
Simulated Annealing Clusterization Algorithm for Studying the Multifragmentation 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 Simulated Annealing Clusterization Algorithm for Studying the Multifragmentation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulated Annealing Clusterization Algorithm for Studying the Multifragmentation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-576325