arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0709.3221cond-mat.stat-mech
收藏

直接模拟蒙特卡罗方法的理论

Theory of direct simulation Monte Carlo method

Hasan Karabulut, Huriye Ariman Karabulut

摘要:

本文将直接模拟蒙特卡罗方法(DSMC)处理为一个带有主方程的马尔可夫过程,并导出了相应的主方程。从主方程推导出一个减少的概率分布方程的层次。利用分子混沌假设,导出了一个类似于玻尔兹曼方程的单粒子几率分布方程。它表明,从一个不相关的状态,系统始终保持不相关的限制$N\to \infty ,$其中$N$是粒子数。简单的应用程序的形式主义直接模拟金钱游戏的形式主义的例子。的形式主义适用于直接模拟均匀气体。结果表明,适当归一化的单粒子几率分布对简单气体满足玻尔兹曼方程,对混合分子气体满足WangChang-Uhlenbeck方程。由于这一发展,我们得出鸟没有时间计数器算法。我们扩展到非均匀气体的分析,并定义了一个新的直接模拟算法,这种情况下。我们证明了在极限$% N\to \infty ,$ $V_{k}\to 0,$ $Δt\to 0$下,单粒子概率分布满足Boltzmann方程,其中$% V_{k}$是体积$k^{th}$胞.我们还表明,我们的算法和鸟的算法相互接近的限制$N_{k}\to \infty$其中$N_{k}$是粒子的数量在体积$V_{k}$。

英文摘要:

A treatment of direct simulation Monte Carlo method (DSMC) as a Markov process with a master equation is given and the corresponding master equation is derived. A hierarchy of equations for the reduced probability distributions is derived from the master equation. An equation similar to the Boltzmann equation for single particle probability distribution is derived using assumption of molecular chaos. It is shown that starting from an uncorrelated state, the system remains uncorrelated always in the limit $N\to \infty ,$ where $N$ is the number of particles. Simple applications of the formalism to direct simulation money games are given as examples to the formalism. The formalism is applied to the direct simulation of homogenous gases. It is shown that appropriately normalized single particle probability distribution satisfies the Boltzmann equation for simple gases and Wang Chang-Uhlenbeck equation for a mixture of molecular gases. As a consequence of this development we derive Birds no time counter algorithm. We extend the analysis to the inhomogenous gases and define a new direct simulation algorithm for this case. We show that single particle probability distribution satisfies the Boltzmann equation in our algorithm in the limit $% N\to \infty ,$ $V_{k}\to 0,$ $Δt\to 0$ where $% V_{k}$ is the volume $k^{th}$ cell. We also show that that our algorithm and Bird's algorithm approach each other in the limit $N_{k}\to \infty$ where $N_{k}$ is the number of particles in the volume $V_{k}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑