2011
DOI: 10.1063/1.3583643
|View full text |Cite
|
Sign up to set email alerts
|

A fast algorithm for simulating flow-induced nucleation in polymers

Abstract: We present a fast computer simulation algorithm for high dimensional barrier crossing simulations. The algorithm is described with reference to the Graham and Olmsted (GO) model of flow-induced nucleation in polymers [R. S. Graham and P. D. Olmsted, Phys. Rev Lett. 103, 115702 (2009)]. Inspired by Chandler's barrier crossing algorithm [D. Chandler, J. Chem. Phys 68, 2959 (1978)], our algorithm simulates only the region around the top of the nucleation barrier, where the system deviates most strongly from equil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
7

Relationship

4
3

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 25 publications
0
15
0
Order By: Relevance
“…Due to its relative simplicity the GO model strongly suggests that the total number monomers in a nucleus is an appropriate projection choice. Indeed, this projection has been shown to accurately predict the model's nucleation kinetics [85,86,88], at least for moderate flow rates and blend compositions.…”
Section: Coarse-graining From the Go Model To Continuum Modelsmentioning
confidence: 87%
See 3 more Smart Citations
“…Due to its relative simplicity the GO model strongly suggests that the total number monomers in a nucleus is an appropriate projection choice. Indeed, this projection has been shown to accurately predict the model's nucleation kinetics [85,86,88], at least for moderate flow rates and blend compositions.…”
Section: Coarse-graining From the Go Model To Continuum Modelsmentioning
confidence: 87%
“…This approach was used to capture quiescent crystal growth [82,83] A fast nucleation algorithm [85] has allowed the simulation of high nucleation barriers, which has enabled successful comparison with FIC experiments [86]. All kMC algorithms require a priori choices for which moves are simulated and their rates.…”
Section: Kinetic Monte Carlo Simulationsmentioning
confidence: 99%
See 2 more Smart Citations
“…In morphological research, there have been many simulation approaches available, which include molecular dynamics methods [10,11,12,13], coarse-grained Monte Carlo methods [14,15,16,17,18,19], mesoscopic methods [20,21,22,23,24,25] and phenomenological methods [26,27,28,29]. Among these methods, the molecular dynamics methods are at the highest level of detail.…”
Section: Introductionmentioning
confidence: 99%