𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Track Reconstruction Performance in CMS

✍ Scribed by Paolo Azzurri


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
223 KB
Volume
197
Category
Article
ISSN
0920-5632

No coin nor oath required. For personal study only.

✦ Synopsis


The expected performance of track reconstruction with LHC events using the CMS silicon tracker is presented. Track finding and fitting is accomplished with Kalman Filter techniques that achieve efficiencies above 99% on single muons with p T >1 GeV/c. Difficulties arise in the context of standard LHC events with a high density of charged particles, where the rate of fake combinatorial tracks is very large for low pT tracks, and nuclear interactions in the tracker material reduce the tracking efficiency for charged hadrons. Recent improvements with the CMS track reconstruction now allow to efficiently reconstruct charged tracks with p T down to few hundred MeV/c and as few as three crossed layers, with a very small fake fraction, by making use of an optimal rejection of fake tracks in conjunction with an iterative tracking procedure.


πŸ“œ SIMILAR VOLUMES


Track reconstruction with first collisio
✍ J. Bernardini πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 408 KB

The first LHC collisions at center of mass energies of 900 GeV and 2.36 TeV were recorded by the CMS detector in December 2009. The trajectories of charged particles produced in the collsions were reconstructed using the all-silicon tracker and their momenta were measured in the 3.8T solenoidal magn

Photon reconstruction in CMS
✍ J. Nysten πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 187 KB
Vertex reconstruction in CMS
✍ E. Chabanat; J. D’Hondt; N. Estre; R. FrΓΌhwirth; K. Prokofiev; T. Speer; P. Vanl πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 179 KB

Due to the high track multiplicity in the final states expected in proton collisions at the LHC experiments, novel vertex reconstruction algorithms are required. The vertex reconstruction problem can be decomposed into a pattern recognition problem (''vertex finding'') and an estimation problem (''v