Related papers: One class of integrals evaluation in magnet solito…
We propose a method for computing numerically integrals defined via $i \epsilon$ deformations acting on single-pole singularities. We achieve this without an explicit analytic contour deformation. Our solution is then used to produce…
We introduce a method for computing some pseudo-elliptic integrals in terms of elementary functions. The method is simple and fast in comparison to the algebraic case of the Risch-Trager-Bronstein algorithm. This method can quickly solve…
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…
We describe methods for evaluating one-loop integrals in $4-2\e$ dimensions. We give a recursion relation that expresses the scalar $n$-point integral as a cyclicly symmetric combination of $(n-1)$-point integrals. The computation of such…
With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…
The new version 2.1 of the program SecDec is described, which can be used for the factorisation of poles and subsequent numerical evaluation of multi-loop integrals, in particular massive two-loop integrals. The program is not restricted to…
Two classes of infinite series involving harmonic numbers and the binomial coefficient $C(3n,n)$ are evaluated in closed form using integrals. Several remarkable integral values and difficult series identities are stated as special cases of…
Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…
We present an efficient algorithm for one- and two-component relativistic exact-decoupling calculations. Spin-orbit coupling is thus taken into account for the evaluation of relativistically transformed (one-electron) Hamiltonian. As the…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
The precise description of quantum nuclear fluctuations in atomistic modelling is possible by employing path integral techniques, which involve a considerable computational overhead due to the need of simulating multiple replicas of the…
We propose a new approach to combine Restricted Boltzmann Machines (RBMs) that can be used to solve combinatorial optimization problems. This allows synthesis of larger models from smaller RBMs that have been pretrained, thus effectively…
In this note a general result is proved that can be used to evaluate exactly a class of highly oscillatory integrals.
We discuss an algorithm for the numerical evaluation of NLO multiparton processes. We focus hereby on the virtual part of the NLO calculation, i.e. on evaluating the one-loop integration numerically. We employ and extend the ideas of the…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
Mahler equations relate evaluations of the same function $f$ at iterated $b$th powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently,…
An approach to (normalized) infinite dimensional integrals, including normalized oscillatory integrals, through a sequence of evaluations in the spirit of the Monte Carlo method for probability measures is proposed. in this approach the…
The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert large linear systems, where limited computing resources mean that only part of the system can be kept in…
The need to approximate functions is ubiquitous in science, either due to empirical constraints or high computational cost of accessing the function. In high-energy physics, the precise computation of the scattering cross-section of a…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…