A fast Monte Carlo algorithm for studying bottle-brush polymers

Physics – Condensed Matter – Soft Condensed Matter

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 10 figures

Scientific paper

Obtaining reliable estimates of the statistical properties of complex macromolecules by computer simulation is a task that requires high computational effort as well as the development of highly efficient simulation algorithms. We present here an algorithm combining local moves, the pivot algorithm, and an adjustable simulation lattice box for simulating dilute systems of bottle-brush polymers with a flexible backbone and flexible side chains under good solvent conditions. Applying this algorithm to the bond fluctuation model, very precise estimates of the mean square end-to-end distances and gyration radii of the backbone and side chains are obtained, and the conformational properties of such a complex macromolecule are studied. Varying the backbone length (from $N_b=67$ to $N_b=1027$), side chain length (from N=0 to N=24 or 48), the scaling predictions for the backbone behavior as well as the side chain behavior are checked. We are also able to give a direct comparison of the structure factor between experimental data and the simulation results.

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

A fast Monte Carlo algorithm for studying bottle-brush polymers 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 A fast Monte Carlo algorithm for studying bottle-brush polymers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast Monte Carlo algorithm for studying bottle-brush polymers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-417010

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