Complexity estimates for two uncoupling algorithms

DOI10.1145/2465506.2465941zbMath1360.68919arXiv1301.5414OpenAlexW2105816623MaRDI QIDQ2963220

Alin Bostan, Elie de Panafieu, Frédéric Chyzak

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5414

zbMATH Keywords

complexitygauge equivalenceuncouplingcyclic-vector methodDanilevski-Barkatou-Zürcher algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Abstract differential equations (12H20)

Related Items (8)

Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order ⋮ Analytic computing methods for precision calculations in quantum field theory ⋮ Hypergeometric structures in Feynman integrals ⋮ The first-order factorizable contributions to the three-loop massive operator matrix elements \(A_{Qg}^{(3)}\) and \(\Delta A_{Qg}^{(3)}\) ⋮ The inverse Mellin transform via analytic continuation ⋮ Large Scale Analytic Calculations in Quantum Field Theories ⋮ Analytic Integration Methods in Quantum Field Theory: An Introduction ⋮ The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals

This page was built for publication: Complexity estimates for two uncoupling algorithms