Improved Algorithms for Simulating Crystalline Membranes
G. Thorleifsson, M. Falcioni
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.
Create a lesson
Related papers
Identifying the Shear Piezoelectric Coefficient using Physics-Informed Neural Networks under Exact Boundary and Initial Constraints
Suhas Suresh Bharadwaj
Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics
Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha et al.
Noise-resilient collective order through temporal memory in self-propelled particles
Mihir Durve, Sauro Succi, Antonio Celani
Site-orbit masked twin-branch Transformer for symmetry-constrained crystal generation
Junchi Liu, Haoran Si, Luo Yan et al.
Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Kayo Kinjo, Jun Ohkubo
Quantum simulation of dissipative acoustic and elastic waves by Schrödingerisation: absorbing boundaries and explicit polynomial-size circuits
Hoang Anh Nguyen, Ali Tura