{"title":"粒子物理学中的圆形闪拟合算法","authors":"M. Dima, M.-T. Dima, M. Mihailescu","doi":"10.1134/s1547477124701395","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>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.</p>","PeriodicalId":730,"journal":{"name":"Physics of Particles and Nuclei Letters","volume":"9 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Flash-Fit Algorithms for Circles in Particle Physics\",\"authors\":\"M. Dima, M.-T. Dima, M. Mihailescu\",\"doi\":\"10.1134/s1547477124701395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>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.</p>\",\"PeriodicalId\":730,\"journal\":{\"name\":\"Physics of Particles and Nuclei Letters\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Physics of Particles and Nuclei Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1134/s1547477124701395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"PHYSICS, PARTICLES & FIELDS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physics of Particles and Nuclei Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s1547477124701395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"PHYSICS, PARTICLES & FIELDS","Score":null,"Total":0}
Flash-Fit Algorithms for Circles in Particle Physics
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.
期刊介绍:
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.