Related papers: One class of integrals evaluation in magnet solito…
The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with $N$ samples behaves like $1/\sqrt{N}$. This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
In this paper we investigate a class of integrals that were encountered in the course of a work on statistical plasma physics, in the so-called Sommerfeld temperature-expansion of the electronic entropy. We show that such integrals,…
We review the method of the calculation of multiloop integrals recently suggested in Ref.[Lee2010]. A simple method of derivation of the dimensional recurrence relation suitable for automatization is given. Some new analytic results are…
In this pedagogical note I will discuss one-loop integrals, where (i) different regions of the integration region lead to divergences and (ii) where these divergences cancel in the sum over all regions. These integrals cannot be calculated…
We consider a wide range of matrix models and study them using the Monte Carlo technique in the large $N$ limit. The results we obtain agree with exact analytic expressions and recent numerical bootstrap methods for models with one and two…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…
The auxiliary functions provide efficient computation of integrals arising at the self-consistent field (SCF) level for molecules using Slater-type bases. This applies both in relativistic and non-relativistic electronic structure theory.…
The problem of evaluating potential integrals on planar triangular elements has been addressed using a polar coordinate decomposition. The resulting formulae are general, exact, easily implemented, and have only one special case, that of a…
We examine the effect of numerical integration on the convergence of high order pyramidal finite element methods. Rational functions are indispensable to the construction of pyramidal interpolants so the conventional treatment of numerical…
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview of Risch's algorithm including recent developments. The algorithms discussed are suited for both indefinite and definite integration. They…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
In this study, using the analytical and recurrence relations suggested by the authors in previous works, the new efficient and reliable program procedure for the overlap integrals over Slater type orbitals (STOs) is presented. The proposed…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We propose a parallel version of the cross interpolation algorithm and apply it to calculate high-dimensional integrals motivated by Ising model in quantum physics. In contrast to mainstream approaches, such as Monte Carlo and quasi Monte…
A family of general Master theorems for analytic integration over the real (or imaginary) axis with various reciprocal hyperbolic (trig) kernels ($\sinh and/or \cosh$) with varying arguments is developed. Several examples involving…
We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded. Binary or non-negative integer…
In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…