Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/58838
Title: Simulation tools for heavy-ion tracking and collimation
Authors: Hermes, Pascal
Bruce, Roderik
Cerutti, Francesco
Ferrari, A.
Jowett, John
Lechner, Anton
Mereghetti, Alessio
Mirarchi, Daniele
Ortega, Pablo Garcia
Redaelli, Stefano
Salvachua, Belen
Skordis, Eleftheris
Valentino, Gianluca
Vlachoudis, Vassilis
Keywords: Particle tracks (Nuclear physics)
Collimators (Optical instrument)
Issue Date: 2018
Publisher: CERN
Citation: Hermes, P. D., Mirarchi, D., Skordis, E., Lechner, A., Salvachua, B., Vlachoudis, V., ... & Redaelli, S. (2018). Simulation tools for heavy-ion tracking and collimation. ICFA Mini-Workshop on Tracking for Collimation in Particle Accelerators, Geneva. 73-89.
Abstract: The LHC collimation system, which protects the LHC hardware from undesired beam loss, is less efficient with heavy-ion beams than with proton beams due to fragmentation into other nuclides inside the LHC collimators. Reliable simulation tools are required to estimate critical losses of particles scattered out of the collimation system which may quench the superconducting LHC magnets. Tracking simulations need to take into account the mass and charge of the tracked ions. Heavy-ions can be tracked as protons with ion-equivalent rigidity using proton tracking tools like SixTrack, as used in the simulation tool STIER. Alternatively, new tracking maps can be derived from a generalized accelerator Hamiltonian and implemented in SixTrack. This approach is used in the new tool heavy-ion SixTrack. When coupled to particle-matter interaction tools, they can be used to simulate the collimation efficiency with heavy-ion beams. Both simulation tools are presented and compared to measurements.
URI: https://www.um.edu.mt/library/oar/handle/123456789/58838
Appears in Collections:Scholarly Works - FacICTCCE

Files in This Item:
File Description SizeFormat 
CERN-2018-011-CP pages 73 - 89.pdf1.68 MBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.