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
An Evaluation of the Gauss-Radau Algorithm for the Simulation of Chemical Dynamics
β Scribed by Kim Bolton; Sture Nordholm
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 912 KB
- Volume
- 113
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
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 mode relaxation and conservation of the constants of the motion facilitated comparison of the integration techniques. It has been found that the Gauss-Radau algorithm, which is not widely used in the simulation of chemical dynamics, generally affords a higher accuracy at an improved efficiency. (c) 1994 Academic Press, Inc.
π SIMILAR VOLUMES
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
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
A hybrid conformational search algorithm (DMC) is described that combines a modified form of molecular dynamics with Metropolis Monte Carlo sampling, using the COSMIC(9O) force field. Trial configurations are generated by short bursts of high-temperature dynamics in which the initial kinetic energy
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
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.