Computer Science – Symbolic Computation
Scientific paper
2010-11-11
Computer Science
Symbolic Computation
Scientific paper
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a first step, the integrals are expressed by hypergeometric multi-sums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the first coefficients of its series expansion whenever they are expressible in terms of indefinite nested product-sum expressions. In particular, we enhance the known multi-sum algorithms to derive recurrences for sums with complicated boundary conditions, and we present new algorithms to find formal Laurent series solutions of a given recurrence relation.
Bluemlein Johannes
Klein Sebastian
Schneider Carsten
Stan Flavia
No associations
LandOfFree
A Symbolic Summation Approach to Feynman Integral Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Symbolic Summation Approach to Feynman Integral Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Symbolic Summation Approach to Feynman Integral Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-431027