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.Comment: 14 pages, 1 eps-figur
