arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0910.4072math.PR
收藏

Smoluchowski凝并方程参数灵敏度的随机算法

A Stochastic Algorithm for Parametric Sensitivity in Smoluchowski's Coagulation Equation

I. Bailleul, P. L. W. Man, M. Kraft

摘要:

本文介绍了一种随机粒子系统对Smoluchowski凝聚方程参数敏感性的近似。参数敏感性是方程的解相对于某个参数的导数,其中凝结核取决于该参数。证明了随着粒子数N的增加,粒子系统弱收敛于灵敏度。蒙特卡罗算法的开发和方差减少技术的应用。数值实验进行了两个内核:添加剂内核和一个已被用于研究烟灰形成在一个自由的分子政权。经验表明,方差减少的技术确实是非常有效的,收敛的顺序是O(1/N)。然后,该算法进行比较的算法的基础上的有限差分近似的灵敏度,它被发现的灵敏度估计的方差是大大低于有限差分方法。此外,建立“效率”的两种方法被认为是新的算法被发现是显着更有效。

英文摘要:

In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivity is the derivative of the solution to the equation with respect to some parameter, where the coagulation kernel depends on this parameter. It is proved that the particle system converges weakly to the sensitivity as the number of particles N increases. A Monte Carlo algorithm is developed and variance reduction techniques are applied. Numerical experiments are conducted for two kernels: the additive kernel and one which has been used for studying soot formation in a free molecular regime. It is shown empirically that the techniques for variance reduction are indeed very effective and that the order of convergence is O(1/N). The algorithm is then compared to an algorithm based on a finite difference approximation to the sensitivity and it is found that the variance of the sensitivity estimators are considerably lower than that for the finite difference approach. Furthermore, two methods of establishing `efficiency' are considered and the new algorithm is found to be significantly more efficient.

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

↑