| We present a novel method for generating starting polymer structures for molecular simulations in the dense phase. The work describes the ingredients of an algorithm for the creation of large, dense or diluted amorphous polymeric systems close to equilibrium and provides measures for its quality. The model systems are made of semiflexible (wormlike) repulsive multibead chains. The key feature of the method is its efficiency, in particular for large systems, while approaching given local and global chain characteristics. Its output has been proven to serve as an excellent basis for subsequent off-lattice molecular dynamics computer simulation. By combining chain growing with an iterative relaxation technique we remove overlaps of monomers. The computing time is linear in the number of beads and independent of chain length. The method succeeds in generating large and dense (bulky and confined) systems of up to 100,000 beads in less than an hour on todays workstations.
for LaTeX users @article{MKroger2003-4,
author = {M. Kr\"oger and M. Müller and J. Nievergelt},
title = {A geometric embedding algorithm for efficiently generating semiflexible chains in the molten state},
journal = {CMES - Comput. Model. Eng. Sci.},
volume = {4},
pages = {559-570},
year = {2003}
}
\bibitem{MKroger2003-4} M. Kr\"oger, M. Müller, J. Nievergelt,
A geometric embedding algorithm for efficiently generating semiflexible chains in the molten state,
CMES - Comput. Model. Eng. Sci. {\bf 4} (2003) 559-570.MKroger2003-4
M. Kr\"oger, M. Müller, J. Nievergelt
A geometric embedding algorithm for efficiently generating semiflexible chains in the molten state
CMES - Comput. Model. Eng. Sci.,4,2003,559-570 |
mk@mat.ethz.ch
1 out of 810 entries requested
[H-factor to-date: > 0]
