## Abstract

Hadron production at low transverse momenta in semi-inclusive deep inelastic scattering can be described by transverse momentum dependent (TMD) factorization. This formalism has also been widely used to study the Drell–Yan process and back-to-back hadron pair production in e^{+}e^{−} collisions. These processes are the main ones for extractions of TMD parton distribution functions and TMD fragmentation functions, which encode important information about nucleon structure and hadronization. One of the most widely used TMD factorization formalism in phenomenology formulates TMD observables in coordinate b_{⊥}-space, the conjugate space of the transverse momentum. The Fourier transform from b_{⊥}-space back into transverse momentum space is sufficiently complicated due to oscillatory integrands that it requires a careful and computationally intensive numerical treatment in order to avoid potentially large numerical errors. Within the TMD formalism, the azimuthal angular dependence is analytically integrated and the two-dimensional b_{⊥} integration reduces to a one-dimensional integration over the magnitude b_{⊥}. In this paper we develop a fast numerical Hankel transform algorithm for such a b_{⊥}-integration that improves the numerical accuracy of TMD calculations in all standard processes. Libraries for this algorithm are implemented in Python 2.7 and 3, C++, as well as FORTRAN77. All packages are made available open source. Program summary: Program Title: Fast Bessel Transform (FBT) CPC Library link to program files: http://dx.doi.org/10.17632/65zkb53z8d.1 Developer's repository link: http://github.com/UCLA-TMD/Ogata Licensing provisions: MIT Programming language: Python 2/3, C++, FORTRAN77 Nature of problem: In order to perform extractions of transverse momentum distribution functions, numerical Hankel transforms must be performed from b_{⊥}-space to momentum space. However, these numerical Hankel transforms are a huge bottleneck in these extractions, making these extractions extremely computationally intensive. Solution method: We develop a numerical Hankel transform algorithm by optimizing Ogata quadrature formula. This algorithm improves the performance of these numerical Hankel transforms by nearly an order of magnitude.

Original language | English (US) |
---|---|

Article number | 107611 |

Journal | Computer Physics Communications |

Volume | 258 |

DOIs | |

State | Published - Jan 2021 |

## All Science Journal Classification (ASJC) codes

- Hardware and Architecture
- General Physics and Astronomy