Precision studies of the NNLO DGLAP evolution at the LHC with Candia

Abstract We summarize the theoretical approach to the solution of the NNLO DGLAP equations using methods based on the logarithmic expansions in x-space and their implementation into the C program Candia 1.0.^1 1http://www.le.infn.it/candia. We present the various options implemented in the program and discuss the different solutions. The user can choose the order of the evolution, the type of the solution, which can be either exact or truncated, and the evolution either with a fixed or a varying flavo... Title of program: CANDIA Catalogue Id: AEBK_v1_0 Nature of problem The program provided here solves the DGLAP evolution equations for the parton distribution functions up to NNLO. Versions of this program held in the CPC repository in Mendeley Data AEBK_v1_0; CANDIA; 10.1016/j.cpc.2008.06.004 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)摘要 我们总结了基于x空间对数展开方法求解次次领头阶（Next-to-Next-to-Leading Order, NNLO）Dokshitzer-Gribov-Lipatov-Altarelli-Parisi方程（DGLAP）的理论途径，以及该方法在C语言程序Candia 1.0中的实现^1。^1 http://www.le.infn.it/candia。本文介绍了该程序中实现的各类可配置选项，并讨论了不同的求解方案。用户可选取演化阶数、求解方案类型（精确解或截断解），以及采用固定味或可变味（flav...）的演化方式。 程序名称：CANDIA 目录编号：AEBK_v1_0 问题属性 本文提供的本程序可求解部分子分布函数（parton distribution functions, PDFs）的DGLAP演化方程，最高可达次次领头阶精度。 Mendeley数据平台CPC库中收录的本程序版本： AEBK_v1_0; CANDIA; 10.1016/j.cpc.2008.06.004 本程序源自贝尔法斯特女王大学托管的CPC程序库（1969-2019年）