Related papers: QCD Evolution Equations: Numerical Algorithms from…
We propose a high-precision numerical quadrature framework based on local Fourier extension (LFE) approximations. The method constructs, on each subinterval, a truncated-SVD stabilized local Fourier continuation of the integrand on an…
We propose a divide-and-conquer (DAC) algorithm for constrained convex optimization over networks, where the global objective is the sum of local objectives attached to individual agents. The algorithm is fully distributed: each iteration…
We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…
The theory of evolutionary computation for discrete search spaces has made significant progress in the last ten years. This survey summarizes some of the most important recent results in this research area. It discusses fine-grained models…
The Douglas--Rachford and Peaceman--Rachford splitting methods are common choices for temporal discretizations of evolution equations. In this paper we combine these methods with spatial discretizations fulfilling some easily verifiable…
QCD evolution equations can be recast in terms of parton branching processes. We present a new numerical solution of the equations. We show that this parton-branching solution can be applied to analyze infrared contributions to evolution,…
Convergence properties of Taylor expansions of observables, which are also used in lattice QCD calculations at non-zero chemical potential, are analyzed in an effective N_f = 2+1 flavor Polyakov-quark-meson model. A recently developed…
Tempered fractional derivatives originated from the tempered fractional diffusion equations (TFDEs) modeled on the whole space R (see [23]). For numerically solving TFDEs, two kinds of generalized Laguerre functions were defined and some…
Laguerre spectral approximations play an important role in the development of efficient algorithms for problems in unbounded domains. In this paper, we present a comprehensive convergence rate analysis of Laguerre spectral approximations…
Recent work of Bornemann has uncovered hitherto hidden integrable structures relating to the asymptotic expansion of quantities at the soft edge of Gaussian and Laguerre random matrix ensembles. These quantities are spacing distributions…
In even-dimensional Euclidean space for integer powers of the Laplacian greater than or equal to the dimension divided by two, a fundamental solution for the polyharmonic equation has logarithmic behavior. We give two approaches for…
Linear and non-linear QCD evolutions at high energy suffer from severe issues related to convergence, due to higher order corrections enhanced by large double and single transverse logarithms. We resum double logarithms to all orders by…
We introduce a novel approach to high-energy QCD factorization of cross-sections for processes involving a dilute projectile and a dense target. Our method preserves the factorization between "fast" and "slow" modes in the longitudinal…
We discuss a new method to solve in a semianalytical way the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi evolution equations at NLO order in the x-space. The method allows to construct an evolution operator expressed in form of a rapidly…
Acceleration is a celebrated cornerstone of convex optimization, enabling gradient-based algorithms to converge sublinearly in the condition number. A major open question is whether an analogous acceleration phenomenon is possible for…
Optimizing over the stationary distribution of stochastic differential equations (SDEs) is computationally challenging. A new forward propagation algorithm has been recently proposed for the online optimization of SDEs. The algorithm solves…
Optimal control problems are inherently hard to solve as the optimization must be performed simultaneously with updating the underlying system. Starting from an initial guess, Howard's policy improvement algorithm separates the step of…
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. We present the various options…
In this paper we consider a sub-diffusion problem where the fractional time derivative is approximated either by the L1 scheme or by Convolution Quadrature. We propose new interpretations of the numerical schemes which lead to a posteriori…
In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…