Foam: A general purpose Monte Carlo cellular algorithm. A general-purpose, self-adapting Monte Carlo (MC) algorithm implemented in the program Foam is described. The high efficiency of the MC, that is small maximum weight or variance of the MC weight is achieved by means of dividing the integration domain into small cells. The cells can be $n$-dimensional simplices, hyperrectangles cells. The next cell to be divided and the position/direction of the division hyperplane is chosen by the algorithm which optimizes the ratio of the maximum weight to the average weight or (optionally) the total variance. The algorithm is able to deal, in principle, with an arbitrary pattern of the singularities in the distribution.
Keywords for this software
References in zbMATH (referenced in 8 articles , 2 standard articles )
Showing results 1 to 8 of 8.
- Aghasyan, M.; Avakian, H.; De Sanctis, E.; Gamberg, L.; Mirazita, M.; Musch, B.; Prokudin, A.; Rossi, P.: Studies of transverse momentum dependent parton distributions and Bessel weighting (2015)
- Kersevan, Borut Paul; Richter-Wąs, Elzbieta: The Monte Carlo event generator AcerMC versions 2.0 to 3.8 with interfaces to PYTHIA 6.4, HERWIG 6.5 and ARIADNE 4.1 (2013)
- Jadach, S.; Kusina, A.; Skrzypek, M.; Slawinska, M.: Two real parton contributions to non-singlet kernels for exclusive QCD DGLAP evolution (2011)
- Slawinska, M.; Jadach, S.: MCdevelop - the universal framework for Stochastic Simulations (2010) arXiv
- Jadach, S.; Skrzypek, M.: Solving constrained Markovian evolution in QCD with the help of the non-Markovian Monte Carlo (2006)
- Jadach, S.: Foam: A general purpose Monte Carlo cellular algorithm (2003)
- Binoth, T.; Heinrich, G.: An automatized algorithm to compute infrared divergent multi-loop integrals. (2000)
- Jadach, S.: Foam: Multi-dimensional general purpose Monte Carlo generator with self-adapting simplical grid (2000)