S L Narasimhan
Articles written in Bulletin of Materials Science
Volume 7 Issue 1 March 1985 pp 35-41
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.
Volume 42 | Issue 6
Click here for Editorial Note on CAP Mode