Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
Authors:
- Stefan SchnabelSSStefan Schnabel
- Wolfhard JankeWJWolfhard Janke
- 1 November 2020
- journal article
- research article
- Published by Elsevier in Computer Physics Communications
- Vol. 256
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 13 references indexed in Scilit:
- Advanced multicanonical Monte Carlo methods for efficient simulations of nucleation processes of polymersJournal of Computational Physics, 2011
- Efficient Implementation of the Pivot Algorithm for Self-avoiding WalksJournal of Statistical Physics, 2010
- Accurate Estimate of the Critical Exponentfor Self-Avoiding Walks via a Fast Implementation of the Pivot AlgorithmPhysical Review Letters, 2010
- Freezing and collapse of flexible polymers on regular lattices in three dimensionsPhysical Review E, 2007
- The phase diagram of a single polymer chain: New insights from a new simulation methodJournal of Polymer Science Part B: Polymer Physics, 2006
- Multicanonical study of coarse-grained off-lattice models for folding heteropolymersPhysical Review E, 2005
- Conformational properties of polymer chains in the theta regionThe Journal of Chemical Physics, 1999
- Exchange Monte Carlo Method and Application to Spin Glass SimulationsJournal of the Physical Society of Japan, 1996
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- A hierarchical O(N log N) force-calculation algorithmNature, 1986