Addressing the Folding of Intermolecular Springs in Particle Simulations: Fixed Image Convention

Mesoscopic simulations of long polymer chains and soft matter systems are conducted routinely in the literature in order to assess the long-lived relaxation processes manifested in these systems. Coarse-grained chains are, however, prone to unphysical intercrossing due to their inherent softness. Th...

Full description

Saved in:
Bibliographic Details
Published inComputation Vol. 11; no. 6; p. 106
Main Authors Sgouros, Aristotelis P., Theodorou, Doros N.
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.06.2023
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Mesoscopic simulations of long polymer chains and soft matter systems are conducted routinely in the literature in order to assess the long-lived relaxation processes manifested in these systems. Coarse-grained chains are, however, prone to unphysical intercrossing due to their inherent softness. This issue can be resolved by introducing long intermolecular bonds (the so-called slip-springs) which restore these topological constraints. The separation vector of intermolecular bonds can be determined by enforcing the commonly adopted minimum image convention (MIC). Because these bonds are soft and long (ca 3–20 nm), subjecting the samples to extreme deformations can lead to topology violations when enforcing the MIC. We propose the fixed image convention (FIC) for determining the separation vectors of overextended bonds, which is more stable than the MIC and applicable to extreme deformations. The FIC is simple to implement and, in general, more efficient than the MIC. Side-by-side comparisons between the MIC and FIC demonstrate that, when using the FIC, the topology remains intact even in situations with extreme particle displacement and nonaffine deformation. The accuracy of these conventions is the same when applying affine deformation. The article is accompanied by the corresponding code for implementing the FIC.
ISSN:2079-3197
2079-3197
DOI:10.3390/computation11060106