What is the most efficient algorithm evaluating Feynman diagrams on the lattice? We address the question, and suggest an answer that employs fast Fourier transforms where possible, while avoiding excessive memory requirements.
Symbolic evaluation of dimensionally regularized Feynman diagrams
β Scribed by R. Gastmans; A. Van Proeyen; P. Verbaeten
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 253 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Present and future high-precision tests of the Standard Model and beyond for the fundamental constituents and interactions in Nature are demanding complex perturbative calculations involving multi-leg and multi-loop Feynman diagrams. Currently, large e ort is devoted to the search for closed express
Two-loop nonrelativistic Feynman graphs from many-body physics at zero temperature in 2 + 1 dimensions are evaluated using a combination of symbolic and numerical methods, reducing error, and allowing a greater choice of which numerical methods are in fact applied. The functions to be integrated num