Flash-Fit Algorithms for Circles in Particle Physics

IF 0.4 Q4 PHYSICS, PARTICLES & FIELDS

Physics of Particles and Nuclei Letters Pub Date : 2024-08-14 DOI:10.1134/s1547477124701395

M. Dima, M.-T. Dima, M. Mihailescu

引用次数: 0

Abstract

Circle fit routines are used in helix reconstruction for tracking and in ring reconstruction for particle ID. While accurate fits can be achieved with iterative fits, often resolution can be relaxed in favor of speed. We present and compare two flash-algorithms in terms of resolution, CPU speed and mathematical advantage (linearity). The second algorithm is novel.

Abstract Image

查看原文本刊更多论文

粒子物理学中的圆形闪拟合算法

摘要圆拟合例程用于跟踪的螺旋重建和粒子识别的环重建。虽然可以通过迭代拟合实现精确拟合，但为了提高速度，通常可以放宽分辨率。我们从分辨率、CPU 速度和数学优势（线性）等方面介绍并比较了两种闪光拟合算法。第二种算法很新颖。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Physics of Particles and Nuclei Letters PHYSICS, PARTICLES & FIELDS-

CiteScore

0.80

自引率

20.00%

发文量

108

期刊介绍： The journal Physics of Particles and Nuclei Letters, brief name Particles and Nuclei Letters, publishes the articles with results of the original theoretical, experimental, scientific-technical, methodological and applied research. Subject matter of articles covers: theoretical physics, elementary particle physics, relativistic nuclear physics, nuclear physics and related problems in other branches of physics, neutron physics, condensed matter physics, physics and engineering at low temperatures, physics and engineering of accelerators, physical experimental instruments and methods, physical computation experiments, applied research in these branches of physics and radiology, ecology and nuclear medicine.