1996
DOI: 10.1063/1.471941
|View full text |Cite
|
Sign up to set email alerts
|

Brownian dynamics simulation of needle chains

Abstract: Polymers consisting of rigid segments connected by flexible joints ͑needle chains͒ constitute an important class of biopolymers. Using kinetic theory as a starting point, we first derive the generalized coordinate-space diffusion ͑Fokker-Planck͒ equation for the needle chain polymer model. Next, the equivalent generalized coordinate Itô stochastic differential equation is established. Nonlinear transformations of variables finally yield a stochastic differential equation for the needle chain spatial coordinate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
25
0

Year Published

1999
1999
2009
2009

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 27 publications
(26 citation statements)
references
References 7 publications
1
25
0
Order By: Relevance
“…Use of Eq. (15) yields that the determinant of the generalized mass tensor equals jm ) j ¼ I 2 k ðma 2 =2Þ 2 A 2 ðA 2 À 1Þsin 2 h 1 sin 2 h 2 ½1 À ðcos 2 nÞ=A 2 ;…”
Section: Equilibrium Probability Density For Two-needle Chainsmentioning
confidence: 99%
“…Use of Eq. (15) yields that the determinant of the generalized mass tensor equals jm ) j ¼ I 2 k ðma 2 =2Þ 2 A 2 ðA 2 À 1Þsin 2 h 1 sin 2 h 2 ½1 À ðcos 2 nÞ=A 2 ;…”
Section: Equilibrium Probability Density For Two-needle Chainsmentioning
confidence: 99%
“…This is essential to ensure that the divergence of the constrained mobility is included in the numerical scheme. 9,25 The integration scheme presented in Eqs. ͑59͒ and ͑60͒ is identical to the one presented earlier, 9,12 with one important exception, namely the metric force term F* (m,s) .…”
Section: ͑58͒mentioning
confidence: 99%
“…Algorithms for Brownian dynamics ͑BD͒ simulations of the motion of nugget chains were first introduced by Nyland et al 9 and Mikkelsen et al, 10 who connected the segments using rigid constraint conditions and springlike potentials, respectively. A generalized algorithm was presented by Klaveness and Elgsaeter.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations