Accelerated Matrix Element Method with Parallel Computing
TRIUMF, 4004 Wesbrook Mall, Vancouver, BC
arXiv:1407.7595 [physics.comp-ph], (30 Jul 2014)
@article{2014arXiv1407.7595S,
author={Schouten}, D. and {DeAbreu}, A. and {Stelzer}, B.},
title={"{Accelerated Matrix Element Method with Parallel Computing}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1407.7595},
primaryClass={"physics.comp-ph"},
keywords={Physics – Computational Physics, High Energy Physics – Experiment, High Energy Physics – Phenomenology},
year={2014},
month={jul},
adsurl={http://adsabs.harvard.edu/abs/2014arXiv1407.7595S},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
The matrix element method utilizes ab initio calculations of probability densities as powerful discriminants for processes of interest in experimental particle physics. The method has already been used successfully at previous and current collider experiments. However, the computational complexity of this method for final states with many particles and degrees of freedom sets it at a disadvantage compared to supervised classification methods such as decision trees, k nearest-neighbour, or neural networks. This note presents a concrete implementation of the matrix element technique using graphics processing units. Due to the intrinsic parallelizability of multidimensional integration, dramatic speedups can be readily achieved, which makes the matrix element technique viable for general usage at collider experiments.
August 2, 2014 by hgpu
