✦ LIBER ✦

An efficient algorithm for the brownian dynamics simulation of aggregation

✍ Scribed by Francis Sullivan; Raymond D. Mountain

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 531 KB
Volume: 42
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(86)90229-8

No coin nor oath required. For personal study only.

✦ Synopsis

Computer simulation techniques have proven to be quite useful for studying the structure of particulates produced by the process of growth through the aggregation of smaller particles. In this paper we introduce an efficient algorithm for use in the computer simulation of the kinetics of the growth of particulates. The new algorithm is based on sorting and data structures for set manipulations. Computer tests indicate that running time is reduced by a factor of four as compared to "conventional" methods.

📜 SIMILAR VOLUMES

An Efficient Stochastic Algorithm for Si

An Efficient Stochastic Algorithm for Simulating Nano-particle Dynamics

✍ Michael Goodson; Markus Kraft 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Nano-particles produced at high temperatures often undergo rapid coalescence with complex associated rate laws. In this paper we develop and study the numerical properties of a stochastic algorithm for the modelling of nano-particle dynamics in the free molecular regime. Following the work in A. Eib

An Evaluation of the Gauss-Radau Algorit

An Evaluation of the Gauss-Radau Algorithm for the Simulation of Chemical Dynamics

✍ Kim Bolton; Sture Nordholm 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 912 KB

The Verlet, Verlet leap frog, Gear fixed time step. Gear variable time step, Runge-Kutta, and Gauss-Radau algorithms have been compared using trajectory data obtained from the integration of a one-dimensional diatomic chain under constant pressure. Investigation into the times of local and normal mo

An algorithm for the computer simulation

An algorithm for the computer simulation of very large dynamic systems

✍ E.J. Davison 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 835 KB

A fast efficient algorithm may be used for integrating very large (n >> 10) stiffdifferential equations of the type R = Ax + Bu + f(x, t), x(t0) = x0, wh ere f(x, t) has a small Lipschitz constant. Summary--An algorithm for integrating high dimensional stiff nonlinear differential equations of the

An Optimized Algorithm for Molecular Dyn

An Optimized Algorithm for Molecular Dynamics Simulation of Large-Scale Systems

✍ E. Glikman; I. Kelson; N.V. Doan; H. Tietze 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 272 KB

tasks, which results in considerable CPU time savings. This method is based on selectively limiting the calculation of A method of optimizing molecular dynamics calculations is presented. The method employs multiple time steps across the computhe forces and the neighbor list updating, according to t

Simulations of dynamically triangulated

Simulations of dynamically triangulated gravity — an algorithm for arbitrary dimension

✍ S. Catterall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Recent models for discrete Euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in arbitrary dimension. As illustration we show results from simulations in four dimensions.

FAMUSAMM: An algorithm for rapid evaluat

FAMUSAMM: An algorithm for rapid evaluation of electrostatic interactions in molecular dynamics simulations

✍ Eichinger, M.; Grubm�ller, H.; Heller, H.; Tavan, P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 2 views

Within molecular dynamics simulations of protein᎐solvent systems the exact evaluation of long-range Coulomb interactions is computationally demanding and becomes prohibitive for large systems. Conventional truncation methods circumvent that computational problem, but are hampered by serious artifact