Simulation of polymer systems
- 38 Downloads
The present paper describes an algorithm which can generate, even on a small computer, arbitrarily long polymer chains, making sure that the configurations generated do not suffer from boundary effects. This has been achieved by employing the concept of a window, which is an analogue of virtual memory scheme. The algorithm has been tested for the case of dilute polymer solution.
KeywordsPolymer chains self avoiding random walks Monte-Carlo methods
Unable to display preview. Download preview PDF.
- De Gennes P G 1979Scaling concepts in polymer physics (Ithaca, New York: Cornell University press)Google Scholar
- Flory P J 1953Principles of polymer chemistry (Ithaca, New York: Cornell University press)Google Scholar
- Joanny J H, Grant P, Turkevich L A and Pincus P 1981J. Phys. 42 1045Google Scholar
- Wall F T, Windwer S and Gans P J 1963Methods in computational physics (New York: Academic Press) vol. 1 pp. 217Google Scholar