Reaching large lengths and long times in polymer dynamics simulations

Physics – Condensed Matter – Soft Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 4 eps figures

Scientific paper

10.1063/1.1609196

A lattice model is presented for the simulation of dynamics in polymeric systems. Each polymer is represented as a chain of monomers, residing on a sequence of nearest-neighbor sites of a face-centered-cubic lattice. The polymers are self- and mutually avoiding walks: no lattice site is visited by more than one polymer, nor revisited by the same polymer after leaving it. The dynamics occurs through single-monomer displacements over one lattice spacing. To demonstrate the high computational efficiency of the model, we simulate a dense binary polymer mixture with repelling nearest-neighbor interactions between the two types of polymers, and observe the phase separation over a long period of time. The simulations consist of a total of 46,080 polymers, 100 monomers each, on a lattice with 13,824,000 sites, and an interaction strength of 0.1 kT. In the final two decades of time, the domain-growth is found to be d(t) ~ t^1/3, as expected for a so-called "Model B" system.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Reaching large lengths and long times in polymer dynamics simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reaching large lengths and long times in polymer dynamics simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reaching large lengths and long times in polymer dynamics simulations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-458131

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.