Monte Carlo simulation for simultaneous particle coagulation and deposition

来源 :中国科学E辑(英文版) | 被引量 : 0次 | 上传用户:orc2008
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
The process of dynamic evolution in dispersed systems due to simultaneous particle coagulation and deposition is described mathematically by general dynamic equation (GDE). Monte Carlo (MC) method is an important approach of numerical solutions of GDE. However, constant-volume MC method exhibits the contradictory of low computation cost and high computation precision owing to the fluctuation of the number of simulation particles; constant-number MC method can hardly be applied to engineering application and general scientific quantitative analysis due to the continual contraction or expansion of computation domain. In addition, the two MC methods depend closely on the "subsystem" hypothesis, which constraints their expansibility and the scope of application. A new multi-Monte Carlo (MMC) method is promoted to take account of GDE for simultaneous particle coagulation and deposition. MMC method introduces the concept of "weighted fictitious particle" and is based on the "time-driven" technique. Furthermore MMC method maintains synchronously the computational domain and the total number of fictitious particles, which results in the latent expansibility of simulation for boundary condition, the space evolution of particle size distribution and even particle dynamics. The simulation results of MMC method for two special cases in which analytical solutions exist agree with analytical solutions well, which proves that MMC method has high and stable computational precision and low computation cost because of the constant and limited number of fictitious particles. Lastly the source of numerical error and the relative error of MMC method are analyzed, respectively.
其他文献
The fluid temperature statistics along particle trajectories is crucial to understand the mechanisms of turbulent non-isothermal or reactive fluid-particle flow
A 2-graph is a hypergraph with edge sizes of at most two. A regular 2-graph is said to be minimal if it does not contain a proper regular factor. Let f2(n) be t
A kind of alfalfa seeds was irradiated by 1, 2, 3, 4 and 5 kGy at a dose rate of 6.288 kGy. h-1 in a self-shielded irradiator of 137Cs gamma rays. The EPR spect
Patterned chemical template consisting of both amine- and methyl-terminated self-assembled monolayers has been fabricated. The deposition of carbon nanotubes is
A novel neural network model, termed the discrete-time delayed standard neural network model (DDSNNM), and similar to the nominal model in linear robust control
Based on the correlation between certain properties of liquid and the properties of the corresponding liquid drop formed under given conditions, a liquid drop m
Support vector machines (SVMs) have been introduced as effective methods for solving classification problems.However, due to some limitations in practical appli
This paper proposes a self-adaptive approach to converting irregular genus-0 meshes into those with subdivision connectivity. To assure a maximal utilization of
We consider the variants of Besicovitch-Eggleston sets in symbolic spaces, and determine their fractal dimensions.