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 43, 2020
Continuous Article Publishing mode
Prof. Subi Jacob George — Jawaharlal Nehru Centre for Advanced Scientific Research, Jakkur, Bengaluru
Chemical Sciences 2020
Prof. Surajit Dhara — School of Physics, University of Hyderabad, Hyderabad
Physical Sciences 2020
Click here for Editorial Note on CAP Mode