Related papers: FIESTA 2: parallelizeable multiloop numerical calc…
Mathematica is a powerful application package for doing mathematics and is used almost in all branches of science. It has widespread applications ranging from quantum computation, statistical analysis, number theory, zoology, astronomy, and…
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…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, our algorithm allows splitting a loop into multiple loops that…
A systematic study of the scalar one-loop two-, three-, and four-point Feynman integrals is performed. We consider all cases of mass assignment and external invariants and derive closed expressions in arbitrary space-time dimension in terms…
Fast Iterative Shrinking-Threshold Algorithm (FISTA) is a popular fast gradient descent method (FGM) in the field of large scale convex optimization problems. However, it can exhibit undesirable periodic oscillatory behaviour in some…
This is a user manual for the software package FASTA.
We calculate all three-loop, five-point, massless planar Feynman integral families in the dimensional regularization scheme. This is a new milestone in Feynman integral computations. The analysis covers four distinct families of Feynman…
We present a novel approach to optimizing the reduction of Feynman integrals using integration-by-parts identities. By developing a priority function through the FunSearch algorithm, which combines large language models and genetic…
Researchers working on the automatic parallelization of programs have long known that too much parallelism can be even worse for performance than too little, because spawning a task to be run on another CPU incurs overheads.…
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…
In earlier work, we developed an approach for automatic complexity analysis of integer programs, based on an alternating modular inference of upper runtime and size bounds for program parts. In this paper, we show how recent techniques to…
We present FeynCalc 9.3, a new stable version of a powerful and versatile Mathematica package for symbolic quantum field theory (QFT) calculations. Some interesting new features such as highly improved interoperability with other packages,…
In this talk, we use several examples to elaborate on how a recently proposed algorithm can turn non-trivial Feynman integrals into an $\varepsilon $-factorised manner, regardless of their hidden geometric essence. In particular, some extra…
The increasing complexity and diversity of hardware accelerators in modern computing systems demand flexible, low-overhead program analysis tools. We present PASTA, a low-overhead and modular Program AnalysiS Tool Framework for…
The standard procedure when evaluating integrals of a given family of Feynman integrals, corresponding to some Feynman graph, is to construct an algorithm which provides the possibility to write any particular integral as a linear…
We present the computation of a full set of planar five-point two-loop master integrals with one external mass. These integrals are an important ingredient for two-loop scattering amplitudes for two-jet-associated W-boson production at…
Co-operation of the Feynman DIagram ANAlyzer (DIANA) with the underlying operational system (UNIX) is presented. We discuss operators to run external commands and a recent development of parallel processing facilities and an extension in…
We present the 2-point function from Fast and Accurate Spherical Bessel Transformation (2-FAST) algorithm for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when…
In the advent of new large galaxy surveys, which will produce enormous datasets with hundreds of millions of objects, new computational techniques are necessary in order to extract from them any two-point statistic, the computational time…