Programs in Physics & Physical Chemistry
|[Licence| Download | New Version Template] aecp_v4_0.tar.gz(42000 Kbytes)|
|Manuscript Title: FIESTA 4: optimized Feynman integral calculations with GPU support|
|Authors: A.V. Smirnov|
|Program title: FIESTA4|
|Catalogue identifier: AECP_v4_0|
Distribution format: tar.gz
|Journal reference: Comput. Phys. Commun. 204(2016)189|
|Programming language: Wolfram Mathematica 7.0 or higher, c++.|
|Computer: From a desktop PC to a supercomputer.|
|Operating system: Unix, Linux, Mac OS X.|
|Has the code been vectorised or parallelized?: Yes|
|RAM: depends on the complexity of the problem|
|Keywords: Feynman diagrams, Multiloop Feynman integrals, Dimensional regularization, Computer algebra, Numerical Integration.|
|Classification: 4.4, 4.12, 5, 6.5.|
External routines: Wolfram Mathematica , KyotoCabinet , Cuba , QHull 
Does the new version supersede the previous version?: Yes
Nature of problem:
The sector decomposition approach to evaluating Feynman in- tegrals falls apart into the sector decomposition itself, where one has to minimize the number of sectors; the pole resolution and epsilon expansion; and the numerical integration of the resulting expression. Morover, in cases where the integrand is complex, one has to perform a contour deformation.
The program has a number of sector decomposition strategies. Everything except the integration is performed in Wolfram Mathematica  (required version is 7.0 or higher). This part of the calculation is parallelized with the use of shared memory. The database is stored on hard disk with the use of the KyotoCabinet  database engine.
The integration part of the algorithm can be performed on a cluster. It is written in c++ and does not need Wolfram Mathematica. For integration we use the Cuba library package .
The sampling point evaluation has been vectorized. It can also use graphical processor units for the parallelization of sampling point evaluation.
Reasons for new version:
The main reason for the new version is the possibility to use GPUs for faster calculations.
Summary of revisions:
The main improvements are performance-related. The integration in the new version works 2-4 times faster, and another 2-4 times faster if one uses a GPU. Also there are multiple stability improvements.
The complexity of the problem is mostly restricted by CPU time required to perform the integration and obtain a proper precision.
For additional information see, http://science.sander.su, https://bitbucket.org/fiestaIntegrator/fiesta/overview
Depends on the complexity of the problem.
|||http://www.wolfram.com/mathematica/, commercial algebraic software;|
|||http://fallabs.com/kyotocabinet/, open source;|
|||http://www.feynarts.de/cuba/, open source;|
|||http://www.qhull.org, open source.|
|Disclaimer | ScienceDirect | CPC Journal | CPC | QUB|