Numerical complexity of helix unraveling algorithm for charged particle tracking

2024
journal article
article
dc.abstract.enThis paper describes a procedure for estimating the number of iterations in the main loop of a recently proposed algorithm designed to detect helical charged particle tracks in detectors submerged in a magnetic field. The calculations are based on a Monte Carlo simulation of the ATLAS inner detector. The resulting estimates of numerical complexity suggest that using the new procedure 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.
dc.affiliationWydział Fizyki, Astronomii i Informatyki Stosowanej : Instytut Fizyki im. Mariana Smoluchowskiego
dc.contributor.authorTopolnicki, Kacper - 138772
dc.contributor.authorBold, Tomasz
dc.date.accessioned2024-05-24T08:07:26Z
dc.date.available2024-05-24T08:07:26Z
dc.date.issued2024
dc.date.openaccess0
dc.description.accesstimew momencie opublikowania
dc.description.number6
dc.description.versionostateczna wersja wydawcy
dc.description.volume55
dc.identifier.articleidA1
dc.identifier.doi10.5506/APhysPolB.55.6-A1
dc.identifier.issn0587-4254
dc.identifier.urihttps://ruj.uj.edu.pl/handle/item/342862
dc.languageeng
dc.language.containereng
dc.rightsUdzielam licencji. Uznanie autorstwa 4.0 Międzynarodowa
dc.rights.licenceCC-BY
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/legalcode.pl
dc.share.typeotwarte czasopismo
dc.subtypeArticle
dc.titleNumerical complexity of helix unraveling algorithm for charged particle tracking
dc.title.journalActa Physica Polonica, Series B.
dc.typeJournalArticle
dspace.entity.typePublicationen
dc.abstract.en
This paper describes a procedure for estimating the number of iterations in the main loop of a recently proposed algorithm designed to detect helical charged particle tracks in detectors submerged in a magnetic field. The calculations are based on a Monte Carlo simulation of the ATLAS inner detector. The resulting estimates of numerical complexity suggest that using the new procedure 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.
dc.affiliation
Wydział Fizyki, Astronomii i Informatyki Stosowanej : Instytut Fizyki im. Mariana Smoluchowskiego
dc.contributor.author
Topolnicki, Kacper - 138772
dc.contributor.author
Bold, Tomasz
dc.date.accessioned
2024-05-24T08:07:26Z
dc.date.available
2024-05-24T08:07:26Z
dc.date.issued
2024
dc.date.openaccess
0
dc.description.accesstime
w momencie opublikowania
dc.description.number
6
dc.description.version
ostateczna wersja wydawcy
dc.description.volume
55
dc.identifier.articleid
A1
dc.identifier.doi
10.5506/APhysPolB.55.6-A1
dc.identifier.issn
0587-4254
dc.identifier.uri
https://ruj.uj.edu.pl/handle/item/342862
dc.language
eng
dc.language.container
eng
dc.rights
Udzielam licencji. Uznanie autorstwa 4.0 Międzynarodowa
dc.rights.licence
CC-BY
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/legalcode.pl
dc.share.type
otwarte czasopismo
dc.subtype
Article
dc.title
Numerical complexity of helix unraveling algorithm for charged particle tracking
dc.title.journal
Acta Physica Polonica, Series B.
dc.type
JournalArticle
dspace.entity.typeen
Publication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
11
Views per month
Views per city
Cieszyn
4
Krakow
4
Skawina
1
Downloads
topolnicki_bold_numerical_complexity_of_helix_2024.pdf
1