Scholarlink

Abstract <p>We present a new fast vertexing algorithm for the determination of primary vertices, relying on linear extrapolation of tracks near the beamline, as the curvature of the track for such short distances is negligible. The method treats tracks as infinitely elongated ellipsoids, thereby transforming the vertex-finding problem into a proximity one—between points with ellipsoidal error matrices. We have implemented this approach in C++ using our proprietary NXV4 package for vector and matrix operations. We have tested the resolution and speed performance on SpdRoot simulated data, for the SPD experiment at JINR.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Fast Vertexing Code

  • 期刊论文

  • 发表日期：

    2026年7月20日

查看全文
  • M. Dima,
  • M. O. Dima,
  • M. Mihailescu

摘要

Abstract

We present a new fast vertexing algorithm for the determination of primary vertices, relying on linear extrapolation of tracks near the beamline, as the curvature of the track for such short distances is negligible. The method treats tracks as infinitely elongated ellipsoids, thereby transforming the vertex-finding problem into a proximity one—between points with ellipsoidal error matrices. We have implemented this approach in C++ using our proprietary NXV4 package for vector and matrix operations. We have tested the resolution and speed performance on SpdRoot simulated data, for the SPD experiment at JINR.