<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://www.sklogwiki.org/SklogWiki/index.php?action=history&amp;feed=atom&amp;title=Neighbour_lists</id>
	<title>Neighbour lists - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://www.sklogwiki.org/SklogWiki/index.php?action=history&amp;feed=atom&amp;title=Neighbour_lists"/>
	<link rel="alternate" type="text/html" href="http://www.sklogwiki.org/SklogWiki/index.php?title=Neighbour_lists&amp;action=history"/>
	<updated>2026-04-07T13:31:57Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.0</generator>
	<entry>
		<id>http://www.sklogwiki.org/SklogWiki/index.php?title=Neighbour_lists&amp;diff=10454&amp;oldid=prev</id>
		<title>Carl McBride: Added a related reference</title>
		<link rel="alternate" type="text/html" href="http://www.sklogwiki.org/SklogWiki/index.php?title=Neighbour_lists&amp;diff=10454&amp;oldid=prev"/>
		<updated>2010-07-27T14:20:46Z</updated>

		<summary type="html">&lt;p&gt;Added a related reference&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 16:20, 27 July 2010&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l6&quot;&gt;Line 6:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;The Brode-Ahlrichs algorithm &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0010-4655(86)90230-4 Stefan Brode and Reinhart Ahlrichs &amp;quot;An optimized MD program for the vector computer cyber 205&amp;quot;, Computer Physics Communications &amp;#039;&amp;#039;&amp;#039;42&amp;#039;&amp;#039;&amp;#039; pp. 51-57 (1986)]&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;The Brode-Ahlrichs algorithm &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0010-4655(86)90230-4 Stefan Brode and Reinhart Ahlrichs &amp;quot;An optimized MD program for the vector computer cyber 205&amp;quot;, Computer Physics Communications &amp;#039;&amp;#039;&amp;#039;42&amp;#039;&amp;#039;&amp;#039; pp. 51-57 (1986)]&amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Linked cell lists==&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==Linked cell lists==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Linked cell lists &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0021-9991(73)90046-6 B. Quentrec and C. Brot &quot;New method for searching for neighbors in molecular dynamics computations&quot;, Journal of Computational Physics &#039;&#039;&#039;13&#039;&#039;&#039; pp. 430-432 (1973)]&amp;lt;/ref&amp;gt; &amp;lt;ref&amp;gt;R. W. Hockney&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;, &lt;/del&gt;J. W. Eastwood &quot;Computer Simulation Using Particles&quot;, Taylor &amp;amp; Francis (1987) &amp;amp;sect; 8-4-2  ISBN 978-0-85274-392-8 &amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Linked cell lists &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0021-9991(73)90046-6 B. Quentrec and C. Brot &quot;New method for searching for neighbors in molecular dynamics computations&quot;, Journal of Computational Physics &#039;&#039;&#039;13&#039;&#039;&#039; pp. 430-432 (1973)]&amp;lt;/ref&amp;gt; &amp;lt;ref&amp;gt;R. W. Hockney &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;and &lt;/ins&gt;J. W. Eastwood &quot;Computer Simulation Using Particles&quot;, Taylor &amp;amp; Francis (1987) &amp;amp;sect; 8-4-2  ISBN 978-0-85274-392-8 &amp;lt;/ref&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==References==&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==References==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;lt;references/&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;lt;references/&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Related reading&#039;&#039;&#039;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;*[http://www.ccp5.ac.uk/ftpfiles/ccp5.newsletters/8/pdf/thompson.pdf S. M. Thompson &quot;Use of Neighbour Lists In Molecular Dynamics&quot;, CCP5 Newsletter &#039;&#039;&#039;8&#039;&#039;&#039; pp. 20-28 (1983)]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==External resources==&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;==External resources==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;*[ftp://ftp.dl.ac.uk/ccp5/ALLEN_TILDESLEY/F.19  The Verlet neighbour list] sample FORTRAN computer code from the book [http://www.oup.com/uk/catalogue/?ci=9780198556459 M. P. Allen and D. J. Tildesley &amp;quot;Computer Simulation of Liquids&amp;quot;, Oxford University Press (1989)].&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;*[ftp://ftp.dl.ac.uk/ccp5/ALLEN_TILDESLEY/F.19  The Verlet neighbour list] sample FORTRAN computer code from the book [http://www.oup.com/uk/catalogue/?ci=9780198556459 M. P. Allen and D. J. Tildesley &amp;quot;Computer Simulation of Liquids&amp;quot;, Oxford University Press (1989)].&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[category: Computer simulation techniques]]&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[[category: Computer simulation techniques]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Carl McBride</name></author>
	</entry>
	<entry>
		<id>http://www.sklogwiki.org/SklogWiki/index.php?title=Neighbour_lists&amp;diff=10450&amp;oldid=prev</id>
		<title>Carl McBride: New page: {{Stub-general}} &#039;&#039;&#039;Neighbour lists&#039;&#039;&#039; are used to speed up both molecular dynamics and Monte Carlo simulations. ==Verlet neighbour list== The Verlet neighbour list &lt;ref&gt;[http://dx...</title>
		<link rel="alternate" type="text/html" href="http://www.sklogwiki.org/SklogWiki/index.php?title=Neighbour_lists&amp;diff=10450&amp;oldid=prev"/>
		<updated>2010-07-27T12:13:51Z</updated>

		<summary type="html">&lt;p&gt;New page: {{Stub-general}} &amp;#039;&amp;#039;&amp;#039;Neighbour lists&amp;#039;&amp;#039;&amp;#039; are used to speed up both &lt;a href=&quot;/SklogWiki/index.php/Molecular_dynamics&quot; title=&quot;Molecular dynamics&quot;&gt;molecular dynamics&lt;/a&gt; and &lt;a href=&quot;/SklogWiki/index.php/Monte_Carlo&quot; title=&quot;Monte Carlo&quot;&gt;Monte Carlo&lt;/a&gt; simulations. ==Verlet neighbour list== The Verlet neighbour list &amp;lt;ref&amp;gt;[http://dx...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Stub-general}}&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Neighbour lists&amp;#039;&amp;#039;&amp;#039; are used to speed up both [[molecular dynamics]] and [[Monte Carlo]] simulations.&lt;br /&gt;
==Verlet neighbour list==&lt;br /&gt;
The Verlet neighbour list &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1103/PhysRev.159.98 Loup Verlet &amp;quot;Computer &amp;quot;Experiments&amp;quot; on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules&amp;quot;, Physical Review  &amp;#039;&amp;#039;&amp;#039;159&amp;#039;&amp;#039;&amp;#039; pp. 98-103 (1967)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
==Brode-Ahlrichs algorithm==&lt;br /&gt;
The Brode-Ahlrichs algorithm &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0010-4655(86)90230-4 Stefan Brode and Reinhart Ahlrichs &amp;quot;An optimized MD program for the vector computer cyber 205&amp;quot;, Computer Physics Communications &amp;#039;&amp;#039;&amp;#039;42&amp;#039;&amp;#039;&amp;#039; pp. 51-57 (1986)]&amp;lt;/ref&amp;gt;&lt;br /&gt;
==Linked cell lists==&lt;br /&gt;
Linked cell lists &amp;lt;ref&amp;gt;[http://dx.doi.org/10.1016/0021-9991(73)90046-6 B. Quentrec and C. Brot &amp;quot;New method for searching for neighbors in molecular dynamics computations&amp;quot;, Journal of Computational Physics &amp;#039;&amp;#039;&amp;#039;13&amp;#039;&amp;#039;&amp;#039; pp. 430-432 (1973)]&amp;lt;/ref&amp;gt; &amp;lt;ref&amp;gt;R. W. Hockney, J. W. Eastwood &amp;quot;Computer Simulation Using Particles&amp;quot;, Taylor &amp;amp; Francis (1987) &amp;amp;sect; 8-4-2  ISBN 978-0-85274-392-8 &amp;lt;/ref&amp;gt;&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
==External resources==&lt;br /&gt;
*[ftp://ftp.dl.ac.uk/ccp5/ALLEN_TILDESLEY/F.19  The Verlet neighbour list] sample FORTRAN computer code from the book [http://www.oup.com/uk/catalogue/?ci=9780198556459 M. P. Allen and D. J. Tildesley &amp;quot;Computer Simulation of Liquids&amp;quot;, Oxford University Press (1989)].&lt;br /&gt;
[[category: Computer simulation techniques]]&lt;/div&gt;</summary>
		<author><name>Carl McBride</name></author>
	</entry>
</feed>