Related papers: SIRENA -- Sum-Integral REductioN Algorithm
Sector decomposition in its practical aspect is a constructive method used to evaluate Feynman integrals numerically. We present a new program performing the sector decomposition and integrating the expression afterwards. The program can be…
We present a subtraction scheme for ultraviolet (UV) divergent, infrared (IR) safe scalar Feynman integrals in dimensional regularization with any number of scales. This is done by the introduction of $u$-variables, which are a suitable…
We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the…
Perturbative calculations in field theory at finite temperature involve sums over the Matsubara frequencies. Besides the usual difficulties that appear in perturbative computations, these sums give rise to some new obstacles that are…
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…
This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a…
We derive useful reduction formulae which express one-loop Feynman integrals with a large number of external momenta in terms of lower-point integrals carrying easily derivable kinematic coefficients which are symmetric in the external…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
SaLinA is a simple library that makes implementing complex sequential learning models easy, including reinforcement learning algorithms. It is built as an extension of PyTorch: algorithms coded with \SALINA{} can be understood in few…
The celebrated minimum residual method (MINRES), proposed in the seminal paper of Paige and Saunders, has seen great success and widespread use in solving Hermitian (and complex-symmetric) linear systems. Unless the system is consistent,…
Integration-by-parts reductions of Feynman integrals pose a frequent bottle-neck in state-of-the-art calculations in theoretical particle and gravitational-wave physics, and rely on heuristic approaches for selecting integration-by-parts…
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…
We present an efficient and accurate method for simulating massive neutrinos in cosmological structure formation simulations, together with an easy to use public implementation. Our method builds on our earlier implementation of the linear…
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…
This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of dependency such as radar and sensor networks. In this paper, we…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…
Efficient and lightweight single-image super-resolution (SISR) has achieved remarkable performance in recent years. One effective approach is the use of large kernel designs, which have been shown to improve the performance of SISR models…
A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…
Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of…