An efficient algorithm for the Brownian dynamics simulation of aggregation (Q1115084)

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.