dorsal/arxiv
View SchemaFoam: Multi-Dimensional General Purpose Monte Carlo Generator With Self-Adapting Simplical Grid
| Authors | S. Jadach |
|---|---|
| Categories | |
| ArXiv ID | physics/9910004 |
| URL | https://arxiv.org/abs/physics/9910004 |
| DOI | 10.1016/S0010-4655(00)00047-3 |
| Journal | Comput.Phys.Commun. 130 (2000) 244-259 |
Abstract
A new general purpose Monte Carlo event generator with self-adapting grid consisting of simplices is described. In the process of initialization, the simplex-shaped cells divide into daughter subcells in such a way that: (a) cell density is biggest in areas where integrand is peaked, (b) cells elongate themselves along hyperspaces where integrand is enhanced/singular. The grid is anisotropic, i.e. memory of the axes directions of the primary reference frame is lost. In particular, the algorithm is capable of dealing with distributions featuring strong correlation among variables (like ridge along diagonal). The presented algorithm is complementary to others known and commonly used in the Monte Carlo event generators. It is, in principle, more effective then any other one for distributions with very complicated patterns of singularities - the price to pay is that it is memory-hungry. It is therefore aimed at a small number of integration dimensions (<10). It should be combined with other methods for higher dimension. The source code in Fortran77 is available from http://home.cern.ch/~jadach
{
"annotation_id": "efe6d866-1d14-497e-8f90-d81a92787224",
"date_created": "2026-03-02T18:01:24.832000Z",
"date_modified": "2026-03-02T18:01:24.832000Z",
"file_hash": "c692bcdc02fd55b4ae0ca7ccbf8bd49e9ec87119e5557006ab011ee30f0442a9",
"private": false,
"record": {
"abstract": "A new general purpose Monte Carlo event generator with self-adapting grid\nconsisting of simplices is described. In the process of initialization, the\nsimplex-shaped cells divide into daughter subcells in such a way that: (a) cell\ndensity is biggest in areas where integrand is peaked, (b) cells elongate\nthemselves along hyperspaces where integrand is enhanced/singular. The grid is\nanisotropic, i.e. memory of the axes directions of the primary reference frame\nis lost. In particular, the algorithm is capable of dealing with distributions\nfeaturing strong correlation among variables (like ridge along diagonal). The\npresented algorithm is complementary to others known and commonly used in the\nMonte Carlo event generators. It is, in principle, more effective then any\nother one for distributions with very complicated patterns of singularities -\nthe price to pay is that it is memory-hungry. It is therefore aimed at a small\nnumber of integration dimensions (\u003c10). It should be combined with other\nmethods for higher dimension. The source code in Fortran77 is available from\nhttp://home.cern.ch/~jadach",
"arxiv_id": "physics/9910004",
"authors": [
"S. Jadach"
],
"categories": [
"physics.comp-ph",
"hep-ph"
],
"doi": "10.1016/S0010-4655(00)00047-3",
"journal_ref": "Comput.Phys.Commun. 130 (2000) 244-259",
"title": "Foam: Multi-Dimensional General Purpose Monte Carlo Generator With Self-Adapting Simplical Grid",
"url": "https://arxiv.org/abs/physics/9910004"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8f4c30c3-c1c8-4039-ba80-98fc0ef564b0",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}