Numerical complexity of helix unraveling algorithm for charged particle tracking
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909102016299008 |
|---|---|
| author | Topolnicki, Kacper Bold, Tomasz |
| author_facet | Topolnicki, Kacper Bold, Tomasz |
| contents | This paper describes a procedure for a realistic estimation of the number of iterations in the main loop of a recent particle detection algorithm from [1]. The calculations are based on a Monte Carlo simulation of the ATLAS inner detector. The resulting estimates of numerical complexity suggest that using the procedure from [1] for online triggering is not feasible. There are however some areas, such as triggering for particles in a specific sub-domain of the phase space, where using this procedure might be beneficial. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_07142 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Numerical complexity of helix unraveling algorithm for charged particle tracking Topolnicki, Kacper Bold, Tomasz Instrumentation and Detectors This paper describes a procedure for a realistic estimation of the number of iterations in the main loop of a recent particle detection algorithm from [1]. The calculations are based on a Monte Carlo simulation of the ATLAS inner detector. The resulting estimates of numerical complexity suggest that using the procedure from [1] for online triggering is not feasible. There are however some areas, such as triggering for particles in a specific sub-domain of the phase space, where using this procedure might be beneficial. |
| title | Numerical complexity of helix unraveling algorithm for charged particle tracking |
| topic | Instrumentation and Detectors |
| url | https://arxiv.org/abs/2402.07142 |