اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFeynman Integral Evaluation by a Sector decomposiTion Approach (FIESTA)
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Up to the moment there are two known algorithms of sector decomposition: an original private algorithm of Binoth and Heinrich and an algorithm made public lastyear by Bogner and Weinzierl. We present a new program performing the sector decomposition and integrating the expression afterwards. The program takes a set of propagators and a set of indices as input and returns the epsilon-expansion of the corresponding integral.
قيم البحث
اقرأ أيضاً
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision arithmetic and par
allelization technique can be used in this method if required. We present the recent progress in development of this method and show results such as one-loop 5-point and two-loop 3-point integrals.
For loop integrals, the standard method is reduction. A well-known reduction method for one-loop integrals is the Passarino-Veltman reduction. Inspired by the recent paper [1] where the tadpole reduction coefficients have been solved, in this paper w
e show the same technique can be used to give a complete integral reduction for any one-loop integrals. The differential operator method is an improved version of the PV-reduction method. Using this method, analytic expressions of all reduction coefficients of the master integrals can be given by algebraic recurrence relation easily. We demonstrate our method explicitly with several examples.
We develop a new representation for the integrals associated with Feynman diagrams. This leads directly to a novel method for the numerical evaluation of these integrals, which avoids the use of Monte Carlo techniques. Our approach is based on based
on the theory of generalized sinc ($sin(x)/x$) functions, from which we derive an approximation to the propagator that is expressed as an infinite sum. When the propagators in the Feynman integrals are replaced with the approximate form all integrals over internal momenta and vertices are converted into Gaussians, which can be evaluated analytically. Performing the Gaussians yields a multi-dimensional infinite sum which approximates the corresponding Feynman integral. The difference between the exact result and this approximation is set by an adjustable parameter, and can be made arbitrarily small. We discuss the extraction of regularization independent quantities and demonstrate, both in theory and practice, that these sums can be evaluated quickly, even for third or fourth order diagrams. Lastly, we survey strategies for numerically evaluating the multi-dimensional sums. We illustrate the method with specific examples, including the the second order sunset diagram from quartic scalar field theory, and several higher-order diagrams. In this initial paper we focus upon scalar field theories in Euclidean spacetime, but expect that this approach can be generalized to fields with spin.
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over
loop momenta when possible. Currently it is being used in complicated three-loop calculations.
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, empl
oying multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
