REVIEW 2 cited by
Efficient Computation of One-Loop Feynman Integrals and Fixed-Branch Integrals to High Orders in ε
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Efficient Computation of One-Loop Feynman Integrals and Fixed-Branch Integrals to High Orders in ε
read the original abstract
We propose a novel method, called the dimension-changing transformation (DCT), to compute one-loop Feynman integrals and recently introduced fixed-branch integrals to arbitrary orders in $\epsilon$. The DCT relates one-loop Feynman integrals or fixed-branch integrals in one spacetime dimension to their corresponding quantities with auxiliary mass in any other dimension, making the expansion to high orders in $\epsilon$ highly efficient. We applied this method to several examples to demonstrate its validity and efficiency. The approach introduced in this work has been implemented in an open-source C++ package, available at \href{https://gitlab.com/multiloop-pku/dct}{https://gitlab.com/multiloop-pku/dct}.
Forward citations
Cited by 2 Pith papers
-
Tensor decomposition of $e^+e^-\to\pi^+\pi^-\gamma$ to higher orders in the dimensional regulator
First beyond-NLO tensor decomposition and higher-order analytic one-loop amplitudes for e+e- to pi+pi-gamma, paired with a fast numerical five-point integral evaluator.
-
AMFlow 2.0: significant algorithmic and software improvements for Feynman integral evaluation
AMFlow 2.0 cuts symbolic and numerical cost of multi-loop Feynman integral evaluation via an FT recursion mode, a C++ DE solver, and modern IBP reducers, demonstrated on a three-loop five-point family.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.