Logo Logo
Hilfe
Hilfe
Switch Language to English

Bertacchi, Valerio; Bilka, Tadeas; Braun, Nils; Casarosa, Giulia; Corona, Luigi; Cunliffe, Sam; Dattola, Filippo; De Marino, Gaetano; De Nuccio, Michael; De Pietro, Giacomo; Thanh, Van Dong; Dujany, Giulio; Ecker, Patrick; Eliachevitch, Michael; Fillinger, Tristan; Frost, Oliver; Fruehwirth, Rudolf; Gebauer, Uwe; Glazov, Sasha; Gosling, Nicolas; Guo, Aiqiang; Hauth, Thomas; Heck, Martin; Kaleta, Mateusz; Kandra, Jakub; Kleinwort, Claus; Kuhr, Thomas; Kurz, Simon; Kvasnicka, Peter; Lettenbichler, Jakob; Lueck, Thomas; Martini, Alberto; Metzner, Felix; Neverov, Dmitrii; Niebuhr, Carsten; Paoloni, Eugenio; Patra, Sourav; Piilonen, Leo; Praz, Cyrille; Prim, Markus Tobias; Pulvermacher, Christian; Racs, Sebastian; Rad, Navid; Rados, Petar; Ritter, Martin; Rizzo, Giuliana; Rostomyan, Armine; Scavino, Bianca; Schlüter, Tobias; Schwenker, Benjamin; Spataro, Stefano; Spruck, Bjorn; Svidras, Henrikas; Tenchini, Francesco; Uematsu, Yuma; Webb, James; Wessel, Christian und Zani, Laura (2021): Track finding at Belle II. In: Computer Physics Communications, Bd. 259, 107610

Volltext auf 'Open Access LMU' nicht verfügbar.

Abstract

This paper describes the track-finding algorithm that is used for event reconstruction in the Belle II experiment operating at the SuperKEKB B-factory in Tsukuba, Japan. The algorithm is designed to balance the requirements of a high efficiency to find charged particles with a good track parameter resolution, a low rate of spurious tracks, and a reasonable demand on CPU resources. The software is implemented in a flexible, modular manner and employs a diverse selection of global and local track-finding algorithms to achieve an optimal performance. (C) 2020 Elsevier B.V. All rights reserved.

Dokument bearbeiten Dokument bearbeiten