Draft: T-Track vertex reconstruction
In this MR, a set of new algorithms dedicated to T-Track vertex reconstruction & selection is proposed. The aim is to complement the corresponding developments at HLT2.
Runge-Kutta improvements
- Introduced an adaptive step algorithm
- Proposed alternative
make_simple_stepfunction for extrapolation step estimation- loads the magnetic field vector only once per invocation, effectively reducing the number of accesses to
L1/TEX
- loads the magnetic field vector only once per invocation, effectively reducing the number of accesses to
The reconstruction sequence
- Filtering of
SciFiseeds with momentum cut as well asLong(and potentiallyDownstream) VETO. - Seed extrapolation using the Runge-Kutta extrapolator, introduced in !1961 (merged).
- The same approach as in Rec!4572 (merged)
- The result is stored using a set of intermediate track states at predefined
zpositions. - A cubic-spline interpolation is used to extract a track state at an arbitrary
z.
- Estimation of Point Of Closest Approach (POCA) using a ported (simplified) version of the HLT2
TrajPocaalgorithm. Estimation of additional vertex parameters, such as:- position vector
- parent momentum vector
- DOCA
- Since the algorithm uses SoA containers internally, the final step is conversion from internal SoA to Allen standard track/vertex views.
Validation plots
Track extrapolation
Vertex reconstruction
TODO
-
To define physics and/or monitoring trigger lines -
Add monitoring plots/counters
References
Edited by Volodymyr Svintozelskyi






