Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Dynamic Monte Carlo Simulation of Polymers: Cooperative Move Algorithm

Dynamic Monte Carlo Simulation of Polymers: Cooperative Move Algorithm If the elementary move is carefully chosen, the Monte Carlo process can be used to simulate the dynamics of the polymers in a coarse-grained sense. It is generally believed that only local move algorithms, for example, generalized Verdier–Stockmayer algorithm and bond fluctuation method, are suitable for dynamic Monte Carlo simulation of polymer. In this work, we use a cooperative move algorithm, in which several connected segments of the polymer can move collectively, to simulate the self-avoiding walk (SAW) and random walk (RW) chains on the 2-dimensional triangle lattice. We find this cooperative move algorithm can reproduce the result of Rouse theory well, so it can be used as a dynamic Monte Carlo simulation algorithm. The cooperative move algorithm is more realistic than the conventional local move ones in that it can mimic the tensile forces in the polymer chains. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Molecular Simulation Taylor & Francis

Dynamic Monte Carlo Simulation of Polymers: Cooperative Move Algorithm

Molecular Simulation , Volume 29 (10-11): 6 – Oct 1, 2003
6 pages

Loading next page...
 
/lp/taylor-francis/dynamic-monte-carlo-simulation-of-polymers-cooperative-move-algorithm-7oh0WZ01A8

References (18)

Publisher
Taylor & Francis
Copyright
Copyright Taylor & Francis Group, LLC
ISSN
1029-0435
eISSN
0892-7022
DOI
10.1080/0892702031000103185
Publisher site
See Article on Publisher Site

Abstract

If the elementary move is carefully chosen, the Monte Carlo process can be used to simulate the dynamics of the polymers in a coarse-grained sense. It is generally believed that only local move algorithms, for example, generalized Verdier–Stockmayer algorithm and bond fluctuation method, are suitable for dynamic Monte Carlo simulation of polymer. In this work, we use a cooperative move algorithm, in which several connected segments of the polymer can move collectively, to simulate the self-avoiding walk (SAW) and random walk (RW) chains on the 2-dimensional triangle lattice. We find this cooperative move algorithm can reproduce the result of Rouse theory well, so it can be used as a dynamic Monte Carlo simulation algorithm. The cooperative move algorithm is more realistic than the conventional local move ones in that it can mimic the tensile forces in the polymer chains.

Journal

Molecular SimulationTaylor & Francis

Published: Oct 1, 2003

Keywords: Monte Carlo simulation; Polymer; Dynamics

There are no references for this article.