Lattice simulations (Polymers): Difference between revisions

From SklogWiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 1: Line 1:
Polymers have many interesting mesoscopic properties that can adequately represented through [[Coarse graining | coarse-grained]] models. [[Models | Lattice models]] are particularly useful since they employ integer coordinates that can be quickly processed. Another advantage is the possibility of checking the occupancy of the discrete number of sites and store it in an array. Therefore, overlapping between beads can be easily avoided. </p>
Polymers have many interesting mesoscopic properties that can adequately represented through [[Coarse graining | coarse-grained]] models. [[Models | Lattice models]] are particularly useful since they employ integer coordinates that can be quickly processed. Another advantage is the possibility of checking the occupancy of the discrete number of sites and store it in an array. Therefore, overlapping between beads can be easily avoided. </p>
Earlier simulations were perfomed with the simple cubic or tetrahedrical lattices, employing different algorithms. Tetrahedrical lattice models are mainly used because of their closer similarity of their bond angles with those of the aliphatic chains. </p>
Earlier simulations were performed with the simple cubic or tetrahedrical lattices, employing different algorithms. Tetrahedrical lattice models are mainly used because of their closer similarity of their bond angles with those of the aliphatic chains. </p>
Algorithms useful for lattice models may have special difficulties to comply with the ergodicity and microscopic reversibility conditions. Elementary bead jumps are commomly used to try to mimic dynamics. A combinations of bents and crankshaft was shown to be nearly ergodic and reproduce adequately the Rouse dynamics of single chain systems in a cubic latice [1]. More efficient Pivot moves have been devised to explore the equlilibrium properties of very long single chains. [2] Although the lattice simulations can effectively represent melts, most algorithms employ a certain amount of voids to allow specific local motions. An exception is the cooperative motion algorithm that considers totally occupied systems [3]. </p> Also, specific algorithms to perform NPT simulations have been designed. [4]
Algorithms useful for lattice models may have special difficulties to comply with the ergodicity and microscopic reversibility conditions. Elementary bead jumps are commonly used to try to mimic dynamics. A combination of bents and crankshaft was shown to be nearly ergodic and reproduce adequately the Rouse dynamics of single chain systems in a cubic lattice [1]. More efficient Pivot moves have been devised to explore the equilibrium properties of very long single chains. [2] Although the lattice simulations can effectively represent melts, most algorithms employ a certain amount of voids to allow specific local motions. An exception is the cooperative motion algorithm that considers totally occupied systems [3]. </p> Also, specific algorithms to perform NPT simulations have been designed. [4]
The bond fluctation model has been proposed to combine the advantages of lattice and off-lattice models.
The bond fluctuation model has been proposed to combine the advantages of lattice and off-lattice models.
==References==
[1] P. H. Verdier, W. H. Stockmayer, J. Chem. Phys. 36, 227 (1962).
[2] N. Madras and A. D. Sokal, J. Stat. Phys. 50, 109 (1988).
[3] T. Pakula and S. Geyler, Macromolecules 20, 2909 (1987).
[4] A. D. Mackie, A. Z. Panagiotopoulos, S. K. Kumar, J. Chem. Phys. 102, 1014 (1995).

Revision as of 11:27, 31 May 2007

Polymers have many interesting mesoscopic properties that can adequately represented through coarse-grained models. Lattice models are particularly useful since they employ integer coordinates that can be quickly processed. Another advantage is the possibility of checking the occupancy of the discrete number of sites and store it in an array. Therefore, overlapping between beads can be easily avoided.

Earlier simulations were performed with the simple cubic or tetrahedrical lattices, employing different algorithms. Tetrahedrical lattice models are mainly used because of their closer similarity of their bond angles with those of the aliphatic chains.

Algorithms useful for lattice models may have special difficulties to comply with the ergodicity and microscopic reversibility conditions. Elementary bead jumps are commonly used to try to mimic dynamics. A combination of bents and crankshaft was shown to be nearly ergodic and reproduce adequately the Rouse dynamics of single chain systems in a cubic lattice [1]. More efficient Pivot moves have been devised to explore the equilibrium properties of very long single chains. [2] Although the lattice simulations can effectively represent melts, most algorithms employ a certain amount of voids to allow specific local motions. An exception is the cooperative motion algorithm that considers totally occupied systems [3].

Also, specific algorithms to perform NPT simulations have been designed. [4]

The bond fluctuation model has been proposed to combine the advantages of lattice and off-lattice models.

References

[1] P. H. Verdier, W. H. Stockmayer, J. Chem. Phys. 36, 227 (1962). [2] N. Madras and A. D. Sokal, J. Stat. Phys. 50, 109 (1988). [3] T. Pakula and S. Geyler, Macromolecules 20, 2909 (1987). [4] A. D. Mackie, A. Z. Panagiotopoulos, S. K. Kumar, J. Chem. Phys. 102, 1014 (1995).