𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Introduction to “A Fast Algorithm for Particle Simulations”

✍ Scribed by John A. Board Jr.

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
113 KB
Volume
135
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

tions of all of these methods are certainly possible,

Department of Electrical and Computer Engineering

Greengard and Bill Gropp pointed out early on the suitabil-Duke University ity of the FMA for parallel processing [3].

📜 SIMILAR VOLUMES

A Fast Algorithm for Particle Simulation
A Fast Algorithm for Particle Simulations
✍ L. Greengard; V. Rokhlin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 407 KB

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potenti

Fast algorithm for one-dimensional quant
Fast algorithm for one-dimensional quantum Monte Carlo simulations
✍ Mihail Marcu; Jürgen Müller; Franz-Karl Schmatzer 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 654 KB

A fast algorithm for simulating one-dimensional quantum spin systems on CRAY 1 computers is presented. Various versions of the algorithm suitable for general spin xxz and xyz models with and without magnetic field are discussed.

Algorithms for Particle-Field Simulation
Algorithms for Particle-Field Simulations with Collisions
✍ Hersir Sigurgeirsson; Andrew Stuart; Wing-Lok Wan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 477 KB

We develop an efficient algorithm for detecting collisions among a large number of particles moving in a velocity field, when the field itself is possibly coupled to the particle motions. We build on ideas from molecular dynamics simulations and, as a byproduct, give a literature survey of methods f

A fast pairlist-construction algorithm f
A fast pairlist-construction algorithm for molecular simulations under periodic boundary conditions
✍ Tim N. Heinz; Philippe H. Hünenberger 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

## Abstract A new grid‐cell algorithm is presented that permits the fast construction of cutoff‐based nonbonded pairlists in molecular simulations under periodic boundary conditions based on an arbitrary box shape. The key features of the method are (1) the use of a one‐dimensional mask array (to d