Professional Documents
Culture Documents
Multi-Resolution Polymer Brownian Dynamics With Hydrodynamic Interactions
Multi-Resolution Polymer Brownian Dynamics With Hydrodynamic Interactions
where η is the dynamic viscosity and I ∈ R3×3 is the where σm (resp. σn ) is the radius of of bead m (resp. n)
identity matrix. One of the purposes of this paper is to and rmn is the distance between beads. We also denote
extend model (8) to include hydrodynamic interactions. by b
rmn the unit vector between beads, i.e.
Many models which include hydrodynamic interactions
where beads are of equal sizes use the Rotne-Prager-
Yamakawa17,18 tensor. This has been extended by Zuk rn − rm
et al.19 to allow for beads of different sizes. To formulate b
rmn = .
rmn
it, we denote for beads m and n:
σmn =|σn − σm |,
Then the Rotne-Prager-Yamakawa-type mobility tensor
rmn =|rn − rm |, is given by19
1
6πησn I, if m = n;
h i
2
σn +σm2
σn2
+σm 2
8πηr1 mn 1 + 3r 2 I + 1 − 2
rmn
b
r mn ⊗ b
r mn , if σn + σm < rmn ;
Hmn = h 3 mn 2 2 2 2 2
i (9)
1 16rmn (σn +σm )−(σmn +3rmn ) 3(σmn −rmn )2
6πησ σ 32r 3 I + 32r 3 b
r mn ⊗ b
r mn , if σmn < rmn ≤ σn + σm ;
n m mn mn
1
6πη max{σn ,σm } I, if rmn ≤ σmn ;
which is positive-definite, symmetric and continuous for Zimm14 . Considering near-equilibrium dynamics, we re-
sufficiently small σn for all n. It is also incompressible, place the mobility tensor Hmn with its equilibrium aver-
so that ∇m · Hnm = 0, which simplifies the Langevin age hHmn ieq , using Ψ from equation (4):
equation (6) to Z
! Hmn → hHmn ieq = Hmn Ψ({rn }) d{rn }.
N
X N
X
drn = Hnm Fm dt + Bnm dWm , (10)
If we assume that σn + σn+1 < bn for all n ≤ N − 1, then
m=1 m=1
our equilibrium distribution hHmn ieq for off-diagonal en-
where Bmn ∈ R3×3 are given by (7) which exists by the tries m 6= n becomes
positive-definite symmetric property of Hmn and inter- "
bead force Fm is found by differentiating the potential (5) 1 1
hHmn ieq = hI + brmn ⊗ b
rmn ieq
to get 8πη rmn eq
#
3kB T 3kB T 2 2 1 I
Fm = (rm−1 − rm ) + 2 (rm+1 − rm ) . (11) + (σn + σm ) 3
−b
rmn ⊗ brmn ,
b2m−1 bm rmn eq 3 eq
by pre-averaging equation (10), we find In this section, we simplify equation (15) in the long chain
! limit, N → ∞, which is taken in such a way that the
XN XN
b nm Fm dt + bnm dWm , fraction of springs in each region, Nα /(N − 1), remains
drn = H B (13)
a constant, i.e. if (N − 1) doubles in size then each indi-
m=1 m=1
vidual region also doubles in size.
where Equation (12) defines a function of two integer vari-
N ables m and n. We will map the discrete function H b mn
b mn = 1 Xb b into a continuous function H(x, y) by generalizing the
H Bmk Bnk . (14)
2kB T approach of Öttinger25 and Fixman16 . Assuming that
k=1
bead m lies in region α, its continuous approximation in
Following Öttinger25 , we define the hydrodynamic center interval [−1, 1] will be defined by
of resistance rh by
α−1
XN PN b −1 2b2α 2 X
H m − 1 + Nγ (b2γ − b2α ) −→ x, (16)
rh = ln r n , where ln = PNm=1 nm . µ2 µ2 γ=1
b −1
n=1 m,k=1 Hkm
PM
Multiplying equation (13) through by ln and summing where µ2 = γ=1 Nγ b2γ . The continuous analogue of a
over all n, we get summation of arbitrary function fn over all beads will
! ! then be a weighted integral
XN XN XN
drh = b
ln Hnm Fm dt + b
ln Bnm dWm . N
X Z 1
m,n=1 m=1 n=1 fn −→ f (x) b(x) dx, (17)
n=1 −1
Using (11), the first term on the right hand side is zero
and the second term is a linear combination of Wiener where we define b(x) as a piecewise constant function
processes, which is itself a Wiener process with transla- given by b(x) = µ2 b−2
α /2 in interval
tional diffusion coefficient #
α−1 α
!2 2 X 2 X
N
1 X X b
N x∈ Nγ b2γ − 1, 2 Nγ b2γ − 1 .
Dh = ln Bnm . µ2 γ=1 µ γ=1
2 m=1 n=1
In addition to (16), we also write for bead n in region β
Using (14) and the definition of ln , we obtain
β−1
N
!−1 2b2β 2 X
X n − 1 + Nγ (b2γ − b2β ) −→ y.
D h = kB T b
H −1
. (15) µ2 µ2 γ=1
mn
m,n=1
This leeds to a transformation (m, n) → (x, y), which
This forms a matrix equation to provide the pre-averaged
b mn in [−1, 1] ×
gives the continuous approximation of H
approximation for the translational diffusion coefficient.
[−1, 1] as
r
B. Behaviour in the Long Chain Limit 2 1
H(x, y) = 2
p . (18)
µ ηπ 6π|x − y|
Our analysis in the previous section has used a general
The definition of the inverse of the matrix H b mn (given
multi-resolution model consisting of N beads with sizes PN b b −1
σn , n = 1, 2, . . . , N , connected by N − 1 springs with as k=1 Hmk Hkn = δmn ), is rewritten in continous vari-
statistical segment lengths bn , n = 1, 2, . . . , N − 1. In ables as
applications to multiscale computations, we are mostly Z 1
δ(x − y)
interested in chains which are split into M regions (where H(x, z) H −1 (z, y) b(z) dz = .
M ≪ N ) of constant statistical segment length. In what −1 b(x)
follows, we will use lower case greek subscripts α (resp.
Multiplying both sides by b(y), integrating over y and
β and γ) to denote regions, while n (resp. m and k)
using (18), we obtain
are indices refering to numbers of individual beads and
springs along the polymer chain. We assume that the Z 1 √
φ(z)
α-th region contains Nα springs, with statistical segment p dz = η µ π 3π, (19)
length bα , α = 1, 2, . . . , M . Summing over all regions, we −1 |x − z|
have where
M
X Z 1
Nα = N − 1. φ(z) = b(y) b(z) H −1 (z, y) dy.
α=1 −1
5
Using the the method of Auer and Gardner16,26 , we solve by modelling on multiple scales, we instead get to se-
equation (19) for φ(z) to obtain lect the resolution of different regions of the polymer,
√ so that only regions of particular interest need to be in
η µ 3π the highest level of detail. To parameterize the ‘ground-
φ(z) = √ .
2 (1 − z 2 )1/4 truth’ model, we select b to give the desired value for
P P b −1 the rms end-to-end distance µ, from equation (3), i.e.
To return to the quantity of interest, Hnm , we apply b = µ(N −1)−1/2 . Selecting a value for σ is a bit more sub-
the mapping from equation (17) to give tle than for models without hydrodynamic interactions12 ,
as the inclusion of the hydrodynamic interactions mean
X N
N X Z 1 Z 1 the leading order long chain diffusion approximation in
b nm
H −1
= b(x)b(y)H −1 (x, y) dy dx equation (20) is independent of σ, i.e. we cannot use Dh .
−1 −1
n=1 m=1
Z √ We use the strength of hydrodynamic interaction h∗ to
1
η µ 4π 2 3 select an appropriate value of σ. For all simulations in
= φ(x) dx = , this paper, we use σ = b/4.
−1 Γ2 (1/4)
Once we have defined the ‘ground-truth’ model, with
where Γ is the gamma function. Substituting in (15), we statistical segment length b, bead radius σ and total
obtain diffusion constant in the long chain limit beads N , we can seek to define the scalings for the multi-
resolution model, where different regions coarse-grain the
Γ2 (1/4) kB T kB T original model to differing extents. We divide the poly-
Dh = √ ≈ 0.1922 . (20)
4π 2 3 η µ ηµ mer into M regions and assume that the ‘ground-truth’
chain contains N eα consecutive springs in the αth region,
for α = 1, 2, . . . , M . Each region of the multi-resolution
C. Scaling of Parameters
model has an associated (integer-valued) resolution sα
such that s2α |N eα . Larger values of sα represent coarser
As the use of a bead-spring model is to give a coarse- regions, and sα = 1 gives the ‘ground-truth’ model. In
grained representation of a filament, statistical segment the αth region of the multi-resolution model, we have Nα
length and bead radius are not physical qualities so we springs with statistical segment length bα given by
allow these parameters of the model to vary in order to
achieve desired statistics of interest for the polymer. In eα
N
our previous work12 , the whole-system statistics of inter- Nα = , bα = sα b, σα = sα σ, (21)
s2α
est have been the rms end-to-end distance µ and trans-
lational diffusion coefficient Dh of a polymer chain. In where the definition of the bead radius, σα , is slightly
this paper, we will consider three quantities which multi- modified for the boundary beads; scalings (21) apply to
resolutions simulations should preserve: the rms end-to- beads where both adjacent springs have the same sta-
end distance µ, diffusion coefficient Dh and the strength tistical segment length bα . On the boundaries between
of hydrodynamic interactions27 , defined in terms of the regions α and α + 1, for α = 1, 2, . . . , M − 1, we take the
parameter h∗ by bead radius to be ((σα2 + σα+1
2
)/2)1/2 , and for end beads
r √
at the√ start and end of the polymer we take σ1 / 2 and
∗ 3σ
h = , σM / 2, respectively. By applying scalings (21), equa-
πb tion (3) gives the expected rms end-to-end distance for
where b is the statistical segment length and σ is the the filament at equilibrium to be µ = b(N −1)1/2 , i.e. it is
bead radius. From a theoretical standpoint, a value for equal to the ‘ground-truth’ model. The translational dif-
h∗ ≈ 0.25 minimises the effect of chain length28 . Sim- fusion coefficient for the polymer in the long chain limit,
ilar values can also match experimental results for vis- equation (20), is also invariant to the number of regions,
coelastic properties, for example the Flory-Fox parameter as well as the size and resolution of each region, and the
can match experimental values27 for h∗ ≈ 0.267. In the strength of hydrodynamic interactions is constant along
multi-resolution model, in order to maintain a consistent the filament.
value for the strength of hydrodynamic interactions, we
therefore scale parameters in order to keep h∗ constant
throughout simulations. IV. SIMULATION METHOD
The multi-resolution polymer simulations will be com-
pared to the ‘ground-truth’ model, which will be the We solve the Langevin equation for the polymer in equa-
single-scale model of the polymer in the maximum de- tion (10) by using a modified version of the Ermak-
tail required. In single-scale models, we can modify the McCammon algorithm24 , for which different regions have
whole-system statistics by varying the statistical segment different timestep sizes. The key idea for the modified al-
length b, the bead radius σ and the total number of beads gorithm is to keep track of the behavior of beads modelled
N . In single-scale models, we need to select a level of de- with a higher resolution (and with smaller timesteps) to
tail for the entire chain as an additional constraint, but give an average of the hydrodynamic forces exerted on the
6
coarsely modelled beads between the larger timesteps on 0 ∆t1 2∆t1 3∆t1 4∆t1 5∆t1 6∆t1 7∆t1 8∆t1
which they are modelled. s1 • • • • • • • • •
s2 ◦ ◦
If the ‘ground-truth’ model uses timestep ∆t, then
with the notation of Section III C we define the timestep TABLE I. An explanation of the model running on multiple
associated with the αth region as timesteps with region s1 in twice finer resolution than s2 , giv-
ing timesteps 8-times smaller. We run a timestep using equa-
∆tα = s3α ∆t, tion (22) for each bead, so that for every timestep we simulate
the beads in s1 and every 8 timesteps for s2 . The force terms
where sα is the (integer-valued) resolution of the αth re- F m (i∆t) where bead m is in s1 is summed over the small
gion, α = 1, 2, . . . , M . A requirement for the resolution timesteps to give Femn (i∆t) on the larger timesteps. We use
value is that for any two regions α1 and α2 that either the same concept to find noise terms X emn (i∆t).
s3α1 |s3α2 or s3α2 |s3α1 , to ensure the timesteps of the coarser
regions match up to those for the finer regions. We choose
this scaling to ensure numerical stability of simulations explained in Table I:
so that the size of the tension term for a bead is much
F (i∆t), if sαn < sαm ,
smaller than the statistical segment length with adjacent m 3
beads. In the case of a bead lying between two regions, e mn (i∆t) = (sαn /s
F X αm ) −1
The ‘ground-truth’ model updates time at integer mul- The random displacement term ρen has a multivariate
tiples of ∆t, i.e. we compute the polymer state at times Gaussian distribution defined by the moments
t = i∆t, where i = 0, 1, 2, 3, . . . . Considering the multi-
resolution model, we can formally write the update rule hρen i = 0
(from time i∆t to time (i + 1)∆t) for the nth bead, for hρem ⊗ ρen i = 2kB T Hmn max(∆tαm , ∆tαn ),
n = 1, 2, . . . , N , in region αn as
where we use the maximum as this term is only expressed
on the larger of the two timesteps associated with the
rn ((i + 1)∆t) = rn (i∆t) + Q(s3αn , i + 1) ρen (i∆t) beads, as laid out below. To calculate the ρen terms, we
N use an adapted version of the Ermak-McCammon algo-
X rithm24 , so that when we flatten the tensor Hmn into a
+ Q(s3αm , i e
+ 1) Hnm Fmn (i∆t) , (22)
matrix H, we do so by re-ordering the beads so that beads
m=1
with smaller timesteps have a smaller index than beads
where Hnm is the mobility tensor given in equation (9), with larger timesteps. Having made this adjustment, we
e mn and ρen are discretized force and noise terms given can reduce the computational load of the Cholesky de-
F
composition done by the Ermak-McCammon algorithm
below, and the function Q is defined for integers i and j
(an O(N 3 ) calculation29 ), by only calculating the sub-
by
matrix made up of the rows and columns of the ma-
( trix corresponding to beads which are being calculated
1, if j | i, on that particular timestep. Therefore, if there are N0
Q(j, i) =
0, if j ∤ i. beads which move on a given timestep, then this gives a
3N0 × 3N0 submatrix.
To define discretized force and noise terms, we denote We use the Cholesky decomposition outlined by Ermak
by αn (resp. βn ) the resolution region for the nth bead and McCammon24 to get the lower triagonal matrix B,
(resp. spring). Note that for beads with both adjacent such that H = BBT with elements given by, for n =
springs in the same region we will see αn = βn , however 1, 2, · · · , 3N0 ,
between regions a bead takes the smaller timestep of the !1/2
n−1
X
adjacent regions, so we may see αn 6= βn . In the update 2
rule (22), the timestep is incorporated in the force term. Bnn = Hnn − Bnk ,
We define the force multiplied by the time step for the k=1
Pn
m-th bead by (Hmn − k=1 Bmk Bnk )
Bmn = ,
Bmm
3kB T
Fm (i∆t) = (rm−1 (i∆t) − rm (i∆t)) ∆tβm−1 to give noise terms ρen with the calculation
b2m−1
n
X
3kB T emn (i∆t),
+ 2 (rm+1 (i∆t) − rm (i∆t)) ∆tβm . ρen (i∆t) = νnm X
bm
m=1
This force term is used as a part of a tension term which which are then reordered and formatted to give ρen in a
includes a memory component for larger timesteps, as N0 × 3 matrix. The random terms X̃mn now include a
7
V. SIMULATIONS 0.182
0.18
We compare the full BD modelling with the dynamics us- 10 1 10 2 10 3
ing the pre-averaged tensor hHmn ieq from equation (12)
in place of Hmn in the Ermack-McCammon algorithm
given above. Similar to previous papers simulating bead- FIG. 1. The difference between the matrix formulation for the
spring models30 , we choose to simulate with unit param- diffusion coefficient (15) and the long chain limit (20) as N
eters, which in our case has kB T = 1 and η = 1. We gets large, for both the single scale-system (red dotted line)
shall also hold the rms end-to-end distance constant with and the multiscale simulation, which has the middle 25% of
the polymer in high resolution (blue dashed line). Parameters
µ = 1, which we shall maintain by varying the statistical
are given in Section V. Note that the multi-scale system needs
segment length b as a function of the bead number N as N ≥ 32 by construction for the coarse grained particles to be
appropriate given the scalings explained in Section III C. placed.
To ensure numerical stability of simulations, we found
∆t = 10−2 b3 η/kB T to be a good value to use.
In order to study the translational diffusion coefficient which has expected value 1 in all simulations by design.
in simulations, we need to extend its definition for the We run the BD simulations using both a pre-averaged
simulations of the multi-resolution model. We define the and a non-pre-averaged mobility tensor for a total of 104
mass of the polymer Ω as timesteps (in the case of multi-resolution simulations,
N
this refers to timesteps associated with the higher res-
X olution beads), where each result is given as an average
Ω= σn2 ,
over 500 runs, and contrast this to the diffusion approx-
n=1
imations.
where σn is the radius of the nth bead, n = 1, 2, . . . , N . In the results tables we include 95% confidence inter-
Using scalings (21), we observe that Ω is invariant to our vals for the translational diffusion coefficient and the rms
choice of resolutions in the multi-resolution scheme. This end-to-end distances. For the end-to-end distance we cal-
allows us to define the centre of mass of a polymer rG at culate the 95% confidence interval for hR2 i and take the
time t as square root for both lower and upper bounds to give a
PN range (note that this is not symmetric about the rms
rn (t)σn2 value).
rG (t) = n=1 , We consider three illustrative examples. The first one
Ω
is a single-scale system, so that M = 1 and s1 = 1.
where rn (t) is the position of the nth bead at time t. With We use it as a control to compare the other simulations
this we retain the definition of the translational diffusion to. Our results are presented in Figure 1 and Table II.
coefficient as As we can see in the table, the matrix formulation DMF
1 is covered within the 95% confidence interval all except
DG = lim h(rG (t) − rG (0))2 i. (23) one of the pre-averaged and non-pre-averaged values of
t→∞ 6t
N . The analytic value of µ = 1 fits in the confidence
Note that for the single scale simulation this reduces to interval for all simulations.
the standard definition for the translational diffusion co- The next system to consider is one in which the mid-
efficient. dle 25% of the polymer is in high resolution, while the
In this section we compare the translational diffusion remainder is coarse-grained by a factor of 2. Therefore
coefficient approximations given in the form of an inverse we define M = 3 with s1 = 2, s2 = 1, s3 = 2, and
matrix in equation (15) as well as the long chain limit Ne1 = 3N/8, N e2 = N/4, N e3 = 3N/8. The diffusion and
approximation in equation (20) to BD simulations for the rms end-to-end distance of this polymer is given in
both the full mobility matrix as well as the pre-averaged Table III. The matrix formulation for the diffusion DMF
approximation, as well as the rms end-to-end distance, is contained in the confidence intervals for all values of
8
TABLE II. Results for diffusion and the rms end-to-end distance in single-scale simulations. The subscript MF represents the
matrix formulation, PA is for pre-averaged and NPA is non-pre-averaged. The 95% confidence intervals for µPA and µNPA are
given by CIµPA and CIµNPA , respectively.
TABLE III. Results for diffusion and the rms end-to-end distance in multi-resolution simulations, which have the middle 25%
of the polymer in high resolution. Subscripts are the same as in Table II. Simulations run for 104 timesteps for beads at the
highest resolution.
dynamic interactions20–23 , which could improve the com- 12 E. Rolls, Y. Togashi, and R. Erban, Multiscale Modelling and
putational efficiency of the multi-resolution modelling Simulation 15, 1672 (2017).
13 J. G. Kirkwood and J. Riseman, Journal of Chemical Physics
even further than the Ermack-McCammon algorithm24 ,
16, 565 (1948).
which has been used here as a demonstration of the scal- 14 B. H. Zimm, Journal of Chemical Physics 24, 269 (1956).
ings. 15 H. C. Öttinger, Journal of Chemical Physics 87, 3156 (1987).
16 M. Fixman, Macromolecules 14, 1710 (1981).
17 J. Rotne and S. Prager, Journal of Chemical Physics 50, 4831
(1969).
ACKNOWLEDGMENTS 18 H. Yamakawa, Journal of Chemical Physics 53, 436 (1970).
19 P. Zuk, E. Wajnryb, K. Mizerski, and P. Szymczak, Journal of
This work was supported by funding from the Engineer- Fluid Mechanics 741, R5 (2014).
20 L. Miao, C. D. Young, and C. E. Sing, Journal of Chemical
ing and Physical Sciences Research Council (EPSRC) Physics 147, 024904 (2017).
[grant number EP/G03706X/1]. Radek Erban would also 21 M. Fixman, Macromolecules 19, 1204 (1986).
like to thank the Royal Society for a University Research 22 T. Ando, E. Chow, Y. Saad, and J. Skolnick, Journal of Chemical
114905 (2009).
24 D. L. Ermak and J. A. McCammon, Journal of Chemical Physics
REFERENCES 69, 1352 (1978).
25 H. C. Öttinger, Stochastic processes in polymeric fluids: tools