Поиск :
Личный кабинет :
Электронный каталог: Kireyeu, V. - Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simul...
Kireyeu, V. - Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simul...

Статья
Автор: Kireyeu, V.
Computer Physics Communications: Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simul...
б.г.
ISBN отсутствует
Автор: Kireyeu, V.
Computer Physics Communications: Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simul...
б.г.
ISBN отсутствует
Статья
Kireyeu, V.
Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simulated Annealing, Coalescence / V.Kireyeu. – Text : electronic // Computer Physics Communications. – 2026. – Vol. 327. – P. 110278. – URL: https://doi.org/10.1016/j.cpc.2026.110278. – Bibliogr.: 25.
A new open-source cluster finding library “Common Clusterization Library” (CCL) is proposed to describe the clusters production when applied to the transport codes. The new library was applied to the Parton-Hadron-Quantum-Molecular Dynamics approach to be comparable with the established and well known MST and SACA implementations on the same set of the events. The presented procedures were tested with rapidity density distributions and complex observables like ⟨Mimf⟩ and ⟨Zmax⟩ vs Zbound at the energies of ALADIN and NA49 experiments. A modified simulated annealing chain were used to reduce the computational time. The new “stable” clusters tracking algorithm “sMST” for the “lost” QMD cluster recovering is presented. The results of the “box-like” coalescence procedure and a mixed method which incorporates the coalescence algorithm steps and the negative binding energy criteria are presented. The difference between the helium-3 found by the MST-based cluster finding procedure and the coalescence algorithm applied on the same set of events and baryons is shown for the first time.
Спец.(статьи,препринты) = Ц 840 в - Программы обработки экспериментальных данных и управление физическими установками$
Спец.(статьи,препринты) = С 343 е - Ядерные реакции с тяжелыми ионами$
ОИЯИ = ОИЯИ (JINR)2026
Kireyeu, V.
Modifications in Clusterization Procedures for Heavy-Ion Collisions: Minimum Spanning Tree, Simulated Annealing, Coalescence / V.Kireyeu. – Text : electronic // Computer Physics Communications. – 2026. – Vol. 327. – P. 110278. – URL: https://doi.org/10.1016/j.cpc.2026.110278. – Bibliogr.: 25.
A new open-source cluster finding library “Common Clusterization Library” (CCL) is proposed to describe the clusters production when applied to the transport codes. The new library was applied to the Parton-Hadron-Quantum-Molecular Dynamics approach to be comparable with the established and well known MST and SACA implementations on the same set of the events. The presented procedures were tested with rapidity density distributions and complex observables like ⟨Mimf⟩ and ⟨Zmax⟩ vs Zbound at the energies of ALADIN and NA49 experiments. A modified simulated annealing chain were used to reduce the computational time. The new “stable” clusters tracking algorithm “sMST” for the “lost” QMD cluster recovering is presented. The results of the “box-like” coalescence procedure and a mixed method which incorporates the coalescence algorithm steps and the negative binding energy criteria are presented. The difference between the helium-3 found by the MST-based cluster finding procedure and the coalescence algorithm applied on the same set of events and baryons is shown for the first time.
Спец.(статьи,препринты) = Ц 840 в - Программы обработки экспериментальных данных и управление физическими установками$
Спец.(статьи,препринты) = С 343 е - Ядерные реакции с тяжелыми ионами$
ОИЯИ = ОИЯИ (JINR)2026
На полку