相关论文: Numerical evaluation of iterated integrals related…

We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…

A class of log-trigonometric integrals are evaluated in terms of elliptic functions. From this, by using the elliptic integral singular values, one can obtain closed form evaluations of integrals such as \[…

We investigate a geometric approach to determining the complete set of numerators giving rise to finite Feynman integrals. Our approach proceeds graph by graph, and makes use of the Newton polytope associated to the integral's Symanzik…

We present an algorithm to evaluate multiloop Feynman integrals with an arbitrary number of internal massive lines, with the masses being in general complex-valued, and its implementation in the \textsc{Mathematica} package…

In recent years, differential equations have become the method of choice to compute multi-loop Feynman integrals. Whenever they can be cast into canonical form, their solution in terms of special functions is straightforward. Recently,…

We describe a method to numerically compute multi-loop integrals, depending on one dimensionless parameter $x$ and the dimension $d$, in the whole kinematic range of $x$. The method is based on differential equations, which, however, do not…

In modern quantum field theory, one of the most important tasks is the calculation of loop integrals. Loop integrals appear when evaluating the Feynman diagrams with one or more loops by integrating over the internal momenta. Even though…

Some recent results on evaluating Feynman integrals are reviewed. The status of the method based on Mellin-Barnes representation as a powerful tool to evaluate individual Feynman integrals is characterized. A new method based on Groebner…

The complete elliptic integral of the first and second kind, K(k) and E(k), appear in a multitude of physics and engineering applications. Because there is no known closed-form, the exact values have to be computed numerically. Here,…

We introduce two novel numerical approaches for computing Feynman integrals based on their complete monotonicity (CM) and Stieltjes properties. The first method uses that scalar Feynman integrals are CM, meaning that all their derivatives…

I discuss a progress in calculations of Feynman integrals based on the Gegenbauer Polynomial Technique and the Differential Equation Method.

For an elliptic curve $E$ defined over a field $k\subset \mathbb C$, we study iterated path integrals of logarithmic differential forms on $E^\dagger$, the universal vectorial extension of $E$. These are generalizations of the classical…

It is known that multiple zeta values can be written in terms of certain iterated log-sine integrals. Conversely, we evaluate iterated log-sine integrals in terms of multiple polylogarithms and multiple zeta values in this paper. We also…

In this paper, we consider a discrete version of iterated integrals by the naive (equally divided) Riemann sum. In particular, basic three formulas for usual iterated integrals are discritized. Moreover, we proved cyclic sum formulas for…

Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…

In this paper we study iterated Eisenstein {\tau}-integrals and multiple Eisenstein L-series, they are functions on the complex upper half plane and form two Q-algebras. They reduce to iterated Eisenstein integrals and multiple Hecke…

We develop two applications of the Kronecker's limit formula associated to elliptic Eisenstein series: A factorization theorem for holomorphic modular forms, and a proof of Weil's reciprocity law. Several examples of the general…

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…

We compute Fourier transforms of functions expressed as a ratio of one of the Jacobi elliptic functions divided by $\sinh(\pi x)$ or $\cosh(\pi x)$. In many cases, the resulting Fourier transform remains within the same class of functions.…

A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…