Recent Symbolic Summation Methods to Solve Coupled Systems of Differential and Difference Equations
arXiv:1407.2537
Abstract
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable (resp. coupled difference equations in one discrete variable ) depending on a small parameter : given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the -expansion of a ladder graph with 6 massive fermion lines.
References in corpus (9)
- A Refined Difference Field Theory for Symbolic Summation
- The 3-Loop Non-Singlet Heavy Flavor Contributions and Anomalous Dimensions for the Structure Function and Transversity
- Two--Loop Massive Operator Matrix Elements for Unpolarized Heavy Flavor Production to $O(ε)
- Calculating Massive 3-loop Graphs for Operator Matrix Elements by the Method of Hyperlogarithms
- Modern Summation Methods and the Computation of 2- and 3-loop Feynman Diagrams
- The O(α_s^3 T_F^2) Contributions to the Gluonic Operator Matrix Element
- A Symbolic Summation Approach to Find Optimal Nested Sum Representations
- Evaluation of Multi-Sums for Large Scale Problems
- Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals