三维马尔可夫二元混合数据的Poisson-Box抽样算法
Poisson-Box Sampling algorithms for three-dimensional Markov binary mixtures
摘要:
马尔可夫混合物中的粒子输运可以通过所谓的弦长采样(CLS)方法来解决,这是一种蒙特卡罗算法,通过在随机行走者的轨迹期间生成随机行走者穿过的材料界面来考虑随机介质对粒子传播的影响。这样的方法能够显着减少计算资源,而不是通过求解玻尔兹曼方程获得的参考解决方案的随机介质的大量实现。CLS的解决方案,忽略了空间无序引起的相关性,是更快的,虽然近似,因此可能会显示相对于参考解决方案的差异。在这项工作中,我们提出了一个新的家庭的算法(称为“泊松箱采样”,PBS),旨在提高运输$d$维二进制马尔可夫混合的CLS方法的准确性。为了探索PBS方法的特点,我们将专注于三维马尔可夫介质和重新审视的基准问题最初提出的亚当斯,拉森和Pomraning和Brantley扩展:对于这些配置,我们将比较参考解决方案,标准CLS解决方案和新的PBS解决方案的标量粒子通量,透射和反射系数。PBS将被证明比CLS更好地执行在一个合理的增加计算时间的代价。
英文摘要:
Particle transport in Markov mixtures can be addressed by the so-called Chord Length Sampling (CLS) methods, a family of Monte Carlo algorithms taking into account the effects of stochastic media on particle propagation by generating on-the-fly the material interfaces crossed by the random walkers during their trajectories. Such methods enable a significant reduction of computational resources as opposed to reference solutions obtained by solving the Boltzmann equation for a large number of realizations of random media. CLS solutions, which neglect correlations induced by the spatial disorder, are faster albeit approximate, and might thus show discrepancies with respect to reference solutions. In this work we propose a new family of algorithms (called 'Poisson Box Sampling', PBS) aimed at improving the accuracy of the CLS approach for transport in $d$-dimensional binary Markov mixtures. In order to probe the features of PBS methods, we will focus on three-dimensional Markov media and revisit the benchmark problem originally proposed by Adams, Larsen and Pomraning and extended by Brantley: for these configurations we will compare reference solutions, standard CLS solutions and the new PBS solutions for scalar particle flux, transmission and reflection coefficients. PBS will be shown to perform better than CLS at the expense of a reasonable increase in computational time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。