Related papers: SIRENA -- Sum-Integral REductioN Algorithm

In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…

Using a new analysis approach, we establish a general convergence theory of the Shift-Invert Residual Arnoldi (SIRA) method for computing a simple eigenvalue nearest to a given target $\sigma$ and the associated eigenvector. In SIRA, a…

We present FUEL (Fractional Universal Evaluation Library), a C++ library for performing rational function arithmetic with a flexible choice of third-party computer algebra systems as simplifiers. FUEL is an outgrowth of a C++ interface to…

The increasing size of language models raises great research interests in parameter-efficient fine-tuning such as LoRA that freezes the pre-trained model, and injects small-scale trainable parameters for multiple downstream tasks (e.g.,…

We present a new systematic method for evaluating generalized log-sine integrals in terms of polylogarithms. Our approach is based on an identity connecting ordinary generating functions of polylogarithms to integrals involving the sine…

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…

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…

Structured pruning of large language models (LLMs) offers substantial efficiency improvements by removing entire hidden units, yet current approaches often suffer from significant performance degradation, particularly in zero-shot settings,…

The Semi-Implicit Root solver (SIR) is an iterative method for globally convergent solution of systems of nonlinear equations. Since publication, SIR has proven robustness for a great variety of problems. We here present MATLAB and MAPLE…

We present libami, a lightweight implementation of algorithmic Matsubara integration (AMI) written in C++. AMI is a tool for analytically resolving the sequence of nested Matsubara integrals that arise in virtually all Feynman perturbative…

We propose a novel input refinement methodology incorporating sensitivity analysis and memory-aware weighting for jointly refining numerous diverse inputs. Field trials show ~2.5 dB and ~2.3 dB improvements in Q-factor and power estimation,…

We present OPITeR, a FORM program for the reduction of multi-loop tensor Feynman integrals. The program can handle tensors, including spinor indices, with rank of up to 20 and can deal with up to 8 independent external momenta. The…

A big class of Feynman integrals, in particular, the coefficients of their Laurent series expansion w.r.t.\ the dimension parameter $\ep$ can be transformed to multi-sums over hypergeometric terms and harmonic sums. In this article, we…

We report on the calculation of multi-loop Feynman integrals for single-scale problems by means of difference equations in Mellin space. The solution to these difference equations in terms of harmonic sums can be constructed algorithmically…

We present the first public version of SImMER, an open-source Python reduction pipeline for astronomical images of point sources. Current capabilities include dark-subtraction, flat-fielding, sky-subtraction, image registration, FWHM…

A formalism for the numerical integration of one- and two-loop integrals is presented. It is based on subtraction terms which remove the soft, collinear and some of the ultraviolet divergences from the integrand. The numerical integral is…

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…

We present an efficient graphical approach to construct projectors for the tensor reduction of multi-loop Feynman integrals with both Lorentz and spinor indices in $D$ dimensions. An ansatz for the projectors is constructed making use of…

Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this paper, motivated by the limited precision of quantum…

We present a new method for the numerical evaluation of loop integrals which is based on the Feynman Tree Theorem. The loop integrals are replaced by phase-space integration over fictitious extra on-shell particles. This integration can be…