Поиск :
Личный кабинет :
Электронный каталог: Dima, M. - Track Vertexing for Trigger Applications
Dima, M. - Track Vertexing for Trigger Applications
Статья
Автор: Dima, M.
International Journal of Modern Physics E [Electronic resource]: Track Vertexing for Trigger Applications
б.г.
ISBN отсутствует
Автор: Dima, M.
International Journal of Modern Physics E [Electronic resource]: Track Vertexing for Trigger Applications
б.г.
ISBN отсутствует
На полку
Статья
Dima, M.
Track Vertexing for Trigger Applications / M.Dima, M.-T.Dima, M.Mihailescu // International Journal of Modern Physics E [Electronic resource]. – 2024. – Vol. 33, No. 11 : Nucleus-2024: Fundamental Problems and Applications. Part 1 : Selected Papers of LXXIV Int. Conference, Dubna, Russia. – P. 2441013. – URL: https://doi.org/10.1142/S0218301324410131. – Bibliogr.: 15.
In this paper, we present a novel vertexing algorithm for determining the point of primary interaction, based on the linear extrapolation of tracks in the vicinity of the beamline. The algorithm considers tracks as infinitely elongated ellipsoids, thereby reducing the track vertexing problem to a vertex-to-points proximity problem. We have implemented the concept in C++ with the aid of our previously reported NXV4 package three for vectors and matrices, which gives very good CPU performance.
ОИЯИ = ОИЯИ (JINR)2024
Спец.(статьи,препринты) = С 344.1ш - Методы обработки результатов измерений
Спец.(статьи,препринты) = С 17 к - Расчеты по молекулярной динамике. Численное моделирование физических задач
Dima, M.
Track Vertexing for Trigger Applications / M.Dima, M.-T.Dima, M.Mihailescu // International Journal of Modern Physics E [Electronic resource]. – 2024. – Vol. 33, No. 11 : Nucleus-2024: Fundamental Problems and Applications. Part 1 : Selected Papers of LXXIV Int. Conference, Dubna, Russia. – P. 2441013. – URL: https://doi.org/10.1142/S0218301324410131. – Bibliogr.: 15.
In this paper, we present a novel vertexing algorithm for determining the point of primary interaction, based on the linear extrapolation of tracks in the vicinity of the beamline. The algorithm considers tracks as infinitely elongated ellipsoids, thereby reducing the track vertexing problem to a vertex-to-points proximity problem. We have implemented the concept in C++ with the aid of our previously reported NXV4 package three for vectors and matrices, which gives very good CPU performance.
ОИЯИ = ОИЯИ (JINR)2024
Спец.(статьи,препринты) = С 344.1ш - Методы обработки результатов измерений
Спец.(статьи,препринты) = С 17 к - Расчеты по молекулярной динамике. Численное моделирование физических задач
