In many types of computer simulation, a ring polymer of length l in a particular solvent is represented as a polygon of N sides of length lp, where N≊l/lp, and lp is the persistence length. There are many established methods to make such polygons, including kink‐jump, bead‐spring, and dimerization. This paper introduces a very efficient and easy‐to‐program method, called vector shuffling, which is useful for generating such polygons in the important special case where the quality of the solvent is good, and the polymer is said to be under θ conditions.
REFERENCES
1.
P. J. Flory, Principles of Polymer Chemistry (Cornell University Press, Ithaca, 1953).
2.
A. Baumg̈artner, in Monte Carlo Methods in Statistical Physics, edited by K. Binder (Springer, Berlin, 1984).
3.
H. Yamakawa, Modern Theory of Polymer Solutions (Harper and Row, New York, 1971).
4.
D.
Ceperley
, M. H.
Kalos
, and J. L.
Lebowitz
, Phys. Rev. Lett.
41
, 313
(1978
).5.
6.
7.
8.
9.
10.
11.
D. E. Knuth, The Art of Computer Programming (AddisonWesley, Menlo Park, 1985).
This content is only available via PDF.
© 1994 American Institute of Physics.
1994
American Institute of Physics
You do not currently have access to this content.
