Balancing act: multivariate rational reconstruction for IBP
From MaRDI portal
Publication:6173579
Packaged methods for numerical algorithms (65Y15) Applications of Lie groups to the sciences; explicit representations (22E70) Integration on analytic sets and spaces, currents (32C30) Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30) Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30)
Abstract: We address the problem of unambiguous reconstruction of rational functions of many variables. This is particularly relevant for recovery of exact expansion coefficients in integration-by-parts identites (IBPs) based on modular arithmetic. These IBPs are indispensable in modern approaches to evaluation of multiloop Feynman integrals by means of differential equations. Modular arithmetic is far more superior to algebraic implementations when one deals with high-multiplicity situations involving a large number of Lorentz invariants. We introduce a new method based on balanced relations which allows one to achieve the goal of a robust functional restoration with minimal data input. The technique is implemented as a Mathematica package Reconstruction.m in the FIRE6 environment and thus successfully demonstrates a proof of concept.
Recommendations
- Reconstructing rational functions with \texttt{FireFly}
- Publication:4731612
- Scattering amplitudes over finite fields and multivariate functional reconstruction
- Fault-tolerant modular reconstruction of rational numbers
- \textsc{NeatIBP} 1.0, a package generating small-size integration-by-parts relations for Feynman integrals
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3765126 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- A novel approach to integration by parts reduction
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- Analytic tools for Feynman integrals
- Barycentric rational interpolation with no poles and high rates of approximation
- Computational Complexity of Sparse Rational Interpolation
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
- FIRE6: Feynman integral reduction with modular arithmetic
- High-precision calculation of multiloop Feynman integrals by difference equations
- Integral reduction with Kira 2.0 and finite field methods
- Interpolating polynomials from their values
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}
- Kira -- a Feynman integral reduction program
- Maximal quotient rational reconstruction
- Modern computer algebra
- Scattering amplitudes over finite fields and multivariate functional reconstruction
- Sparse interpolation of multivariate rational functions
- Sparse rational function interpolation with finitely many values for the coefficients
- The number of master integrals is finite
- \texttt{Reduze} -- Feynman integral reduction in \texttt{C++}
Cited in
(7)- FIRE 6.5: Feynman integral reduction with new simplification library
- Two-loop QCD corrections for three-photon production at hadron colliders
- Near mass-shell double boxes
- Simplifying the large-mass expansion of Feynman integrals
- An explicit expression of generating function for one-loop tensor reduction
- Amplitudes, supersymmetric black hole scattering at \(\mathcal{O}(G^5)\), and loop integration
- Efficient reduction of Feynman integrals on supercomputers
This page was built for publication: Balancing act: multivariate rational reconstruction for IBP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173579)
