Accelerated algorithms. I: Lattice models
From MaRDI portal
Publication:5482652
Recommendations
Cited in
(23)- An accelerated exhaustive enumeration algorithm in the Ising model
- Computing the partition function, ensemble averages, and density of states for lattice spin systems by sampling the mean
- Dynamics of the Wang–Landau algorithm and complexity of rare events for the three-dimensional bimodal Ising spin glass
- Intrinsic convergence properties of entropic sampling algorithms
- scientific article; zbMATH DE number 5050108 (Why is no real title available?)
- Joint density of states calculation employing Wang-Landau algorithm
- THE STUDY OF QUENCHED BOND RANDOMNESS BY WANG–LANDAU ALGORITHM
- Binary tree summation Monte Carlo simulation for Potts models
- Novel Monte Carlo algorithms and their applications
- Monte Carlo without chains
- Computer simulation of two continuous spin models using Wang-Landau-transition-matrix Monte Carlo algorithm
- Wang-Landau sampling: saving CPU time
- ON THE WANG–LANDAU METHOD USING THE N-FOLD WAY
- Density of states of the Ising model in the field
- Application of new Monte Carlo algorithms to random spin systems
- Critical behavior of hard-core lattice gases: Wang-Landau sampling with adaptive windows
- An introduction to Monte Carlo methods in statistical physics
- A performance comparison of density-of-states methods
- THE STUDY OF PHASE TRANSITION BY PERIODIC DISTRIBUTION OF BIMODAL BONDS IN 2D POTTS MODEL
- MCAMC: an advanced algorithm for kinetic Monte Carlo simulations from magnetization switching to protein folding
- Improved algorithms for simulating crystalline membranes
- Simulations of glasses: multiscale modeling and density of states Monte-Carlo simulations
- Two-dimensional Wang-Landau sampling of an asymmetric Ising model
This page was built for publication: Accelerated algorithms. I: Lattice models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482652)
