md2011-03-note_Part_3

md2011-03-note_Part_3 - V N L I For generating the neighbor...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: V N L I For generating the neighbor list, we need to define a new distance r m > r cut , and include in the list of each atom i all those atoms j for which r ij 6 r m . I The list hast to be updated every N m steps so that the skin distance r m- r cut > N m h v max i t , (8) where h v max i is the time average for that atom which has the highest velocity. I A more efficient way is to monitor the total displacement of each atom d M after each update of the neighbor list, and update when d M becomes too large. Notes I Practical implementation of the Verlet list is to use a row-vector of integers: N nbr i is the number of neighbors for atom i , and j 1 . . . j N nbr i are the indices of those neighbors. N is the total number of atoms. I This is probably the easiest efficient way of constructing a neighbor list. I However, its not the most efficient one for a large number of particles....
View Full Document

This note was uploaded on 02/14/2012 for the course CSE 6590 taught by Professor Kotakoski during the Winter '12 term at York University.

Page1 / 5

md2011-03-note_Part_3 - V N L I For generating the neighbor...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online