.png){kind=icon}
.png){kind=icon}
Return
Constrained MC for QCD evolution with rapidity ordering and minimum kT
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2008.11.014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the imminent start of LHC experiments, development of phenomenological tools, and in particular the Monte Carlo programs and algorithms, becomes urgent. A new algorithm for the generation of a parton shower initiated by the single initial hadron beam is presented. The new algorithm is of the class of the so-called constrained MC type algorithm (an alternative to the backward evolution MC algorithm), in which the energy and the type of the patron at the end of the parton shower are constrained (predefined). The complete kinematics configurations with explicitly constructed four momenta are generated and tested. Evolution time is identical with rapidity and minimum transverse momentum is used as an infrared cut-off. All terms of the leading-logarithmic approximation in the DGLAP evolution are properly accounted for. In addition, the essential improvements towards the so-called CCFM/BFKL models are also properly implemented. The resulting parton distributions are crosschecked up to the 10(-3) precision level with the help of a multitude of comparisons with other MC and non-MC programs. We regard these tests as an important asset to be exploited at the time when the presented MC will enter as a building block in a larger MC program for WIZ production process at LHC. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
QCD
NLO
DGLAP
Constrained Monte Carlo
Evolution equations
Constrained Markovian process
Radiative corrections
LHC
PDF
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W