اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDREAM, a program for arbitrary-precision computation of dimensional recurrence relations solutions, and its applications
163
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present the Mathematica package DREAM for arbitrarily high precision computation of multiloop integrals within the DRA (Dimensional Recurrence & Analyticity) method as solutions of dimensional recurrence relations. Starting from these relations, the package automatically constructs the inhomogeneous solutions and reduces the manual efforts to setting proper homogeneous solutions. DREAM also provides means to define the homogeneous solutions of the higher-order recurrence relations (and can construct those of the first-order recurrence relations automatically). Therefore, this package can be used to apply the DRA method to the topologies with sectors having more than one master integral. Two nontrivial examples are presented: four-loop fully massive tadpole diagrams of cat-eye topology and three-loop cut diagrams which are necessary for computation of the width of the para-positronium decay into four photons. The analytical form of this width is obtained here for the first time to the best of our knowledge.
قيم البحث
اقرأ أيضاً
We formulate a method to find the meromorphic solutions of higher-order recurrence relations in the form of the sum over poles with coefficients defined recursively. Several explicit examples of the application of this technique are given. The main a
dvantage of the described approach is that the analytical properties of the solutions are very clear (the position of poles is explicit, the behavior at infinity can be easily determined). These are exactly the properties that are required for the application of the multiloop calculation method based on dimensional recurrence relations and analyticity (the DRA method).
General 1-point toric blocks in all sectors of N=1 superconformal field theories are analyzed. The recurrence relations for blocks coefficients are derived by calculating their residues and large $Delta$ asymptotics.
Numerical Relativity is a mature field with many applications in Astrophysics, Cosmology and even in Fundamental Physics. As such, we are entering a stage in which new sophisticated methods adapted to open problems are being developed. In this paper,
we advocate the use of Pseudo-Spectral Collocation (PSC) methods in combination with high-order precision arithmetic for Numerical Relativity problems with high accuracy and performance requirements. The PSC method provides exponential convergence (for smooth problems, as is the case in many problems in Numerical Relativity) and we can use different bit precision without the need of changing the structure of the numerical algorithms. Moreover, the PSC method provides high-compression storage of the information. We introduce a series of techniques for combining these tools and show their potential in two problems in relativistic gravitational collapse: (i) The classical Choptuik collapse, estimating with arbitrary precision the location of the apparent horizon. (ii) Collapse in asympotically anti-de Sitter spacetimes, showing that the total energy is preserved by the numerical evolution to a very high degree of precision.
The current status of CARLOMAT, a program for automatic computation of the lowest order cross sections of multiparticle reactions is described, the results of comparisons with other multipurpose Monte Carlo programs are shown and some new results on
e+e- -> b anti-b b anti-b u anti-d d anti-u are presented.
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a wide range
of realistic parameters, corresponding to the requirements of numerical integration to an accuracy of about 100 to 100 000 bits. Our algorithm combines the summation by rectangular splitting of several types of expansions in terms of hypergeometric series with a fixed-point implementation of Bonnets three-term recurrence relation. We then compute rigorous enclosures of the Gauss-Legendre nodes and weights using the interval Newton method. We provide rigorous error bounds for all steps of the algorithm. The approach is validated by an implementation in the Arb library, which achieves order-of-magnitude speedups over previous code for computing Gauss-Legendre rules with simultaneous high degree and precision.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
