Efficient hybrid algorithm for the dynamic creation of wormlike chains in solutions, brushes, melts and glasses

Published: 23-04-2019| Version 1 | DOI: 10.17632/5kgz4bmt2h.1
Martin Kröger


We present an updated version of a program that had been published earlier in this journal. The program executes an algorithm for the creation and relaxation of large, dense or diluted homogeneous many particle systems made of wormlike, finite extendable, semiflexible multibead chains and – optionally – solvent particles, which repulse each other. The key feature is its efficiency, its output has been proven to serve as an excellent basis for any subsequent off-lattice computer simulation. The application allows to choose (i) the bead number density or packing fraction, temperature, chain length, system size, concentration, (ii) the interaction potentials, hence the local features such as bond length and bending rigidity of the chains, and (iii) the degree of pre-relaxation, parametrized and expressed through a minimum intermolecular distance. The monodisperse polymers are represented by chains of monomer coordinates in 3D space. During the dynamical two-step process of sample creation the initially (Monte Carlo step 1) predicted global characteristics of the molecular conformations remain as unaffected as possible (during molecular dynamics step 2) and the potential energy and the entropy production are relaxing towards their minima. The potentials, the distribution of bond lengths, the integration time step and temperature are smoothly controlled during the creation/relaxation process until they finally approach their prescribed or physical values. The quality of the algorithm is by its nature independent of concentration, system size or degree of polymerization; the CPU speed is quite independent of the latter quantity and linear in the system size. Chains tethered to a surface (dry polymer brushes) can be generated as well. The previous version of this program (ADJU_v1_0) may be found at http://dx.doi.org/10.1016/S0010-4655(98)00160-X.