اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCristal and Azurite: new tools for integration-by-parts reductions
67
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Scattering amplitudes computed at a fixed loop order, along with any other object computed in perturbative quantum field theory, can be expressed as a linear combination of a finite basis of loop integrals. To compute loop amplitudes in practice, such a basis of integrals must be determined. We discuss Azurite (A ZURich-bred method for finding master InTEgrals), a publicly available package for finding bases of loop integrals. We also discuss Cristal (Complete Reduction of IntegralS Through All Loops), a future package that produces the complete integration-by-parts reductions.
قيم البحث
اقرأ أيضاً
New features of the Mathematica code FIRE are presented. In particular, it can be applied together with the recently developed code LiteRed by Lee in order to provide an integration by parts reduction to master integrals for quite complicated familie
s of Feynman integrals. As as an example, we consider four-loop massless propagator integrals for which LiteRed provides reduction rules and FIRE assists to apply these rules. So, as a by-product one obtains a four-loop variant of the well-known three-loop computer code MINCER. We also describe various ways to find additional relations between master integrals for several families of Feynman integrals.
We introduce an algebro-geometrically motived integration-by-parts (IBP) reduction method for multi-loop and multi-scale Feynman integrals, using a framework for massively parallel computations in computer algebra. This framework combines the compute
r algebra system Singular with the workflow management system GPI-Space, which is being developed at the Fraunhofer Institute for Industrial Mathematics (ITWM). In our approach, the IBP relations are first trimmed by modern algebraic geometry tools and then solved by sparse linear algebra and our new interpolation methods. These steps are efficiently automatized and automatically parallelized by modeling the algorithm in GPI-Space using the language of Petri-nets. We demonstrate the potential of our method at the nontrivial example of reducing two-loop five-point nonplanar double-pentagon integrals. We also use GPI-Space to convert the basis of IBP reductions, and discuss the possible simplification of IBP coefficients in a uniformly transcendental basis.
We present the powerful module-intersection integration-by-parts (IBP) method, suitable for multi-loop and multi-scale Feynman integral reduction. Utilizing modern computational algebraic geometry techniques, this new method successfully trims tradit
ional IBP systems dramatically to much simpler integral-relation systems on unitarity cuts. We demonstrate the power of this method by explicitly carrying out the complete analytic reduction of two-loop five-point non-planar hexagon-box integrals, with degree-four numerators, to a basis of $73$ master integrals.
In this paper, we show that with the state-of-art module intersection IBP reduction method and our improved Leinartas algorithm, IBP relations for very complicated Feynman integrals can be solved and the analytic reduction coefficients can be dramati
cally simplified. We develop a large scale parallel implementation of our improved Leinartas algorithm, based on the textsc{Singular}/textsc{GPI-Space} framework. We demonstrate our method by the reduction of two-loop five-point Feynman integrals with degree-five numerators, with a simple and sparse IBP system. The analytic reduction result is then greatly simplified by our improved Leinartas algorithm to a usable form, with a compression ratio of two order of magnitudes. We further discover that the compression ratio increases with the complexity of the Feynman integrals.
In this manuscript, which is to appear in the proceedings of the conference MathemAmplitude 2019 in Padova, Italy, we provide an overview of the module intersection method for the the integration-by-parts (IBP) reduction of multi-loop Feynman integra
ls. The module intersection method, based on computational algebraic geometry, is a highly efficient way of getting IBP relations without double propagator or with a bound on the highest propagator degree. In this manner, trimmed IBP systems which are much shorter than the traditional ones can be obtained. We apply the modern, Petri net based, workflow management system GPI-Space in combination with the computer algebra system Singular to solve the trimmed IBP system via interpolation and efficient parallelization. We show, in particular, how to use the new plugin feature of GPI-Space to manage a global state of the computation and to efficiently handle mutable data. Moreover, a Mathematica interface to generate IBPs with restricted propagator degree, which is based on module intersection, is presented in this review.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
