Evaluation of Neutron Tracker Algorithms for Land and Neuland

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/181106
Download file(s):
There are no files associated with this item.
Type: Examensarbete för masterexamen
Master Thesis
Title: Evaluation of Neutron Tracker Algorithms for Land and Neuland
Authors: Gill, Johan
Wranne, Staffan
Abstract: The focus of this report is the neutron detection for the ALADiN-LAND setup at GSI/FAIR. Especially the evaluation of algorithms for reconstructing neutrons inside the LAND-detector, based on simulated data using GEANT3/GEANT4. The algorithm used since 1990 has been compared with a new experimental probabilistic algorithm. The algorithms have also been tested with the next generation neutron detector concepts (NeuLAND). For LAND both algorithms perform similarly, with the main difference that the new algorithm is much slower. The performance of reconstructing the four vector for single incoming neutrons is reasonably good, but decrease with increased number of incoming neutrons. To increase the performance for larger number of incoming neutrons, modification of the existing algorithms are needed. Due to the fact that the existing algorithms are developed for LAND they do not work well for the next generation neutron detectors. The program structure in the original algorithm is too simple to describe the full complexity of neutron interactions in the detectors. The experimental algorithm on the other hand is too slow to be a realistic alternative for neutron reconstruction in NeuLAND. For these detectors the development of new algorithms is needed.
Keywords: Grundläggande vetenskaper;Tungjonsfysik;Basic Sciences;Heavy ion physics
Issue Date: 2011
Publisher: Chalmers tekniska högskola / Institutionen för fundamental fysik
Chalmers University of Technology / Department of Fundamental Physics
URI: https://hdl.handle.net/20.500.12380/181106
Collection:Examensarbeten för masterexamen // Master Theses

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.