Track Propagator Algorithms

Complete: 1

Goal of the page

State what the reader is expected to learn from this page, e.g., This page is intended to familiarize you with ...

Contacts

Introduction

Propagators are used during track building and fitting to extrapolate track from one layer to the next, or to any other point in space, such as the track's point of closest approach to the beam-line. There are three commonly used types of propagator, which in increasing order of sophistication (and slowness) are:

  1. AnalyticalPropagator just solves analytically for the intercept of a helix with a plane or cylinder.
  2. MaterialPropagator uses (1) but then also uses MaterialEffectsUpdater, which uses EnergyLossUpdator to apply an mean energy loss correction to the helix based on Bethe-Block (or Bethe-Heitler for electrons), and also uses MultipleScatteringUpdator to inflate the track error matrix according to the expected rms scattering angle (from Moliere formula).
  3. RungeKuttaTrackPropagator is like (2) but determines intercept by iterating the track trajectory in many small steps (of automatically chosen size) using a 4th order Runge-Kutta iteration (which is a mathematical technique for solving first order differential equations, such as the ones describing the particle's motion in the B-field). It can take into account variations in the B-field etc.

In general, the AnalyticalPropagator is used only during track-finding, when determining which layers a track crosses, and so which layers should be checked for hits. The MaterialPropagator is used for all other purposes during track-finding, such as extrapolating the TrackCandidates from layer to layer, when searching for additional hits to add to them. The RungeKuttaTrackPropagator is only used for the final fit/smoothing of the found track.

Usage of the algorithm

Explain what a user needs to know when using the algorithm:

  • when to use this algorithm
  • configuration sequences
  • default parameters and how (and why) to change them
  • products

Software architecture

Explain the design of the algorithm to ensure that the software can be maintained once the existing authors have left:
  • design arguments - why this is done as it is done
  • description of algorithm.

Testing

Review status

Reviewer/Editor and Date (copy from screen) Comments
KatiLassilaPerini - 29 Jan 2008 created template page
IanTomalin - 1 Nov 2011 described 3 main propagators

Responsible: ResponsibleIndividual
Last reviewed by: Most recent reviewer

Edit | Attach | Watch | Print version | History: r2 < r1 | Backlinks | Raw View | WYSIWYG | More topic actions
Topic revision: r2 - 2011-11-01 - IanTomalin
 
    • Cern Search Icon Cern Search
    • TWiki Search Icon TWiki Search
    • Google Search Icon Google Search

    CMSPublic All webs login

This site is powered by the TWiki collaboration platform Powered by PerlCopyright & 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback