Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
暂无分享,去创建一个
[1] A. Sokal,et al. The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk , 1988 .
[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[3] J. J. Freire,et al. Conformational properties of polymer chains in the theta region , 1999 .
[4] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[5] Michael Bachmann,et al. Advanced multicanonical Monte Carlo methods for efficient simulations of nucleation processes of polymers , 2011, J. Comput. Phys..
[6] N. Clisby. Efficient Implementation of the Pivot Algorithm for Self-avoiding Walks , 2010, 1005.1444.
[7] N. Clisby. Accurate estimate of the critical exponent nu for self-avoiding walks via a fast implementation of the pivot algorithm. , 2010, Physical review letters.
[8] N. Clisby,et al. High-precision estimate of the hydrodynamic radius for self-avoiding walks. , 2016, Physical review. E.
[9] Wolfhard Janke,et al. Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] K. Hukushima,et al. Exchange Monte Carlo Method and Application to Spin Glass Simulations , 1995, cond-mat/9512035.
[11] Wolfhard Janke,et al. Freezing and collapse of flexible polymers on regular lattices in three dimensions. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[12] Peter Grassberger,et al. Simulations of three‐dimensional θ polymers , 1995 .
[13] Piet Hut,et al. A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.