A binary tree data structure is used to represent a nuclear multifragmentation, we constrict the tree in all but one of the leaf nodes. We use geometric arguments in the velocity space to graphically show how the tree can be solved by assigning velocity vectors in both the lab and CM systems at each of the nodes. An experimental comparison with a ternary reaction is also shown.
An ideal multifragmentation kinematics algorithm for nuclear physics, a binary reaction approach
De Luca S.;
2018
Abstract
A binary tree data structure is used to represent a nuclear multifragmentation, we constrict the tree in all but one of the leaf nodes. We use geometric arguments in the velocity space to graphically show how the tree can be solved by assigning velocity vectors in both the lab and CM systems at each of the nodes. An experimental comparison with a ternary reaction is also shown.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
