اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamic coarse-graining of polymer systems using mobility functions
101
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a dynamic coarse-graining (CG) scheme for mapping heterogeneous polymer fluids onto extremely CG models in a dynamically consistent manner. The idea is to use as target function for the mapping a wave-vector dependent mobility function derived from the single-chain dynamic structure factor, which is calculated in the microscopic reference system. In previous work, we have shown that dynamic density functional calculations based on this mobility function can accurately reproduce the order/disorder kinetics in polymer melts, thus it is a suitable starting point for dynamic mapping. To enable the mapping over a range of relevant wave vectors, we propose to modify the CG dynamics by introducing internal friction parameters that slow down the CG monomer dynamics on local scales, without affecting the static equilibrium structure of the system. We illustrate and discuss the method using the example of infinitely long linear Rouse polymers mapped onto ultrashort CG chains. We show that our method can be used to construct dynamically consistent CG models for homopolymers with CG chain length N=4, whereas for copolymers, longer CG chain lengths are necessary
قيم البحث
اقرأ أيضاً
For optimal processing and design of entangled polymeric materials it is important to establish a rigorous link between the detailed molecular composition of the polymer and the viscoelastic properties of the macroscopic melt. We review current and p
ast computer simulation techniques and critically assess their ability to provide such a link between chemistry and rheology. We distinguish between two classes of coarse-graining levels, which we term coarse-grained molecular dynamics (CGMD) and coarse-grained stochastic dynamics (CGSD). In CGMD the coarse-grained beads are still relatively hard, thus automatically preventing bond crossing. This also implies an upper limit on the number of atoms that can be lumped together and therefore on the longest chain lengths that can be studied. To reach a higher degree of coarse-graining, in CGSD many more atoms are lumped together, leading to relatively soft beads. In that case friction and stochastic forces dominate the interactions, and actions must be undertaken to prevent bond crossing. We also review alternative methods that make use of the tube model of polymer dynamics, by obtaining the entanglement characteristics through a primitive path analysis and by simulation of a primitive chain network. We finally review super-coarse-grained methods in which an entire polymer is represented by a single particle, and comment on ways to include memory effects and transient forces.
The dynamical cluster approximation (DCA) and its DCA$^+$ extension use coarse-graining of the momentum space to reduce the complexity of quantum many-body problems, thereby mapping the bulk lattice to a cluster embedded in a dynamical mean-field hos
t. Here, we introduce a new form of an interlaced coarse-graining and compare it with the traditional coarse-graining. While it gives a more localized self-energy for a given cluster size, we show that it leads to more controlled results with weaker cluster shape and smoother cluster size dependence, which converge to the results obtained from the standard coarse-graining with increasing cluster size. Most importantly, the new coarse-graining reduces the severity of the fermionic sign problem of the underlying quantum Monte Carlo cluster solver and thus allows for calculations on larger clusters. This enables the treatment of longer-ranged correlations than those accessible with the standard coarse-graining and thus can allow for the evaluation of the exact infinite cluster size result via finite size scaling. As a demonstration, we study the hole-doped two-dimensional Hubbard model and show that the interlaced coarse-graining in combination with the extended DCA$^+$ algorithm permits the determination of the superconducting $T_c$ on cluster sizes for which the results can be fit with a Kosterlitz-Thouless scaling law.
Soft nanocomposites represent both a theoretical and an experimental challenge due to the high number of the microscopic constituents that strongly influence the behaviour of the systems. An effective theoretical description of such systems invokes a
reduction of the degrees of freedom to be analysed, hence requiring the introduction of an efficient, quantitative, coarse-grained description. We here report on a novel coarse graining approach based on a set of transferable potentials that quantitatively reproduces properties of mixtures of linear and star-shaped homopolymeric nanocomposites. By renormalizing groups of monomers into a single effective potential between a $f$-functional star polymer and an homopolymer of length $N_0$, and through a scaling argument, it will be shown how a substantial reduction of the to degrees of freedom allows for a full quantitative description of the system. Our methodology is tested upon full monomer simulations for systems of different molecular weight, proving its full predictive potential.
We analyze Lindblad-Gorini-Kossakowski-Sudarshan-type generators for selected periodically driven open quantum systems. All these generators can be obtained by temporal coarse-graining procedures, and we compare different coarse-graining schemes. Sim
ilar as for undriven systems, we find that a dynamically adapted coarse-graining time, effectively yielding non-Markovian dynamics by interpolating through a series of different but invididually Markovian solutions, gives the best results among the different coarse-graining schemes, albeit at highest computational cost.
We consider the application of fluctuation relations to the dynamics of coarse-grained systems, as might arise in a hypothetical experiment in which a system is monitored with a low-resolution measuring apparatus. We analyze a stochastic, Markovian j
ump process with a specific structure that lends itself naturally to coarse-graining. A perturbative analysis yields a reduced stochastic jump process that approximates the coarse-grained dynamics of the original system. This leads to a non-trivial fluctuation relation that is approximately satisfied by the coarse-grained dynamics. We illustrate our results by computing the large deviations of a particular stochastic jump process. Our results highlight the possibility that observed deviations from fluctuation relations might be due to the presence of unobserved degrees of freedom.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
