dorsal/arxiv
View SchemaImproved Algorithms for Simulating Crystalline Membranes
| Authors | G. Thorleifsson, M. Falcioni |
|---|---|
| Categories | |
| ArXiv ID | physics/9709026 |
| URL | https://arxiv.org/abs/physics/9709026 |
| DOI | 10.1016/S0010-4655(98)00014-9 |
| Journal | Computer Phys. Comm. 109 (1998) 161-170 |
Abstract
The physics of crystalline membranes, i.e. fixed-connectivity surfaces embedded in three dimensions and with an extrinsic curvature term, is very rich and of great theoretical interest. To understand their behavior, numerical simulations are commonly used. Unfortunately, traditional Monte Carlo algorithms suffer from very long auto-correlations and critical slowing down in the more interesting phases of the model. In this paper we study the performance of improved Monte Carlo algorithms for simulating crystalline membrane, such as hybrid overrelaxation and unigrid methods, and compare their performance to the more traditional Metropolis algorithm. We find that although the overrelaxation algorithm does not reduce the critical slowing down, it gives an overall gain of a factor 15 over the Metropolis algorithm. The unigrid algorithm does, on the other hand, reduce the critical slowing down exponent to z apprx. 1.7.
{
"annotation_id": "90d0e4eb-df0b-4d69-bbfb-656101f8385f",
"date_created": "2026-03-02T18:01:21.427000Z",
"date_modified": "2026-03-02T18:01:21.427000Z",
"file_hash": "9061f0c2282adadc258ed82be13b5553e7025105a8834ff33a8a47d199193307",
"private": false,
"record": {
"abstract": "The physics of crystalline membranes, i.e. fixed-connectivity surfaces\nembedded in three dimensions and with an extrinsic curvature term, is very rich\nand of great theoretical interest. To understand their behavior, numerical\nsimulations are commonly used. Unfortunately, traditional Monte Carlo\nalgorithms suffer from very long auto-correlations and critical slowing down in\nthe more interesting phases of the model. In this paper we study the\nperformance of improved Monte Carlo algorithms for simulating crystalline\nmembrane, such as hybrid overrelaxation and unigrid methods, and compare their\nperformance to the more traditional Metropolis algorithm. We find that although\nthe overrelaxation algorithm does not reduce the critical slowing down, it\ngives an overall gain of a factor 15 over the Metropolis algorithm. The unigrid\nalgorithm does, on the other hand, reduce the critical slowing down exponent to\nz apprx. 1.7.",
"arxiv_id": "physics/9709026",
"authors": [
"G. Thorleifsson",
"M. Falcioni"
],
"categories": [
"physics.comp-ph",
"cond-mat.stat-mech",
"hep-lat"
],
"doi": "10.1016/S0010-4655(98)00014-9",
"journal_ref": "Computer Phys. Comm. 109 (1998) 161-170",
"title": "Improved Algorithms for Simulating Crystalline Membranes",
"url": "https://arxiv.org/abs/physics/9709026"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "136f76ce-d93c-4e17-be7a-e4e94c3890fd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}