Data structure for on-lattice clustercluster aggregation model performance optimization
A compounded data structure is developed to optimize the simulation of colloidal aggregation using the on-lattice ClusterCluster Aggregation (CCA) model. Brownian motion, collision detection and aggregation as the basic operations in the CCA simulation are illustrated and evaluated based on the compounded data structure, respectively. The critical improvement of our algorithm is in distinguishing any selected clusters consisting particles and ascertaining their neighboring positions efficiently in simulation, which was traditionally performed by the exhaustive search in the whole system. Analytical results show that the new algorithm achieves linear computational complexity in each of the main operations, which is very appealing in performance optimization in using on-lattice CCA simulations.
data structure clustercluster aggregation computational complexity on-lattice simulation metropolis sampling