A Near-neighbour Algorithm for Metropolis Monte Carlo Simulations
- 1 March 1988
- journal article
- research article
- Published by Taylor & Francis in Molecular Simulation
- Vol. 1 (3) , 169-171
- https://doi.org/10.1080/08927028808080940
Abstract
A bit map based implementation of a near-neighbour algorithm to speed up Metropolis Monte Carlo simulations is described. Tests of the algorithm on dilute aqueous solutions showed 8%–22% overall reduction of computer time, depending on the system size.Keywords
This publication has 8 references indexed in Scilit:
- A vectorized “near neighbors” algorithm of order N using a monotonic logical gridJournal of Computational Physics, 1986
- On searching neighbors in computer simulations of macromolecular systemsJournal of Computational Chemistry, 1984
- On the force bias Monte Carlo simulation of water: methodology, optimization and comparison with molecular dynamicsMolecular Physics, 1979
- Monte carlo simulation of water solvent with biomolecules. Glycine and the corresponding zwitterionInternational Journal of Quantum Chemistry, 1978
- Analytical potentials from "ab initio" computations for the interaction between biomolecules. 1. Water with amino acidsJournal of the American Chemical Society, 1977
- Preferential sampling near solutes in monte carlo calculations on dilute solutionsChemical Physics Letters, 1977
- CI study of the water dimer potential surfaceThe Journal of Chemical Physics, 1976
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953