Department of Computer Science, University of California, Santa Barbara, Santa Barbara, California 93106-5070, USA.
Phys Rev E. 2016 Jan;93(1):013307. doi: 10.1103/PhysRevE.93.013307. Epub 2016 Jan 19.
It has been established that there is an inherent limit to the accuracy of the reaction-diffusion master equation. Specifically, there exists a fundamental lower bound on the mesh size, below which the accuracy deteriorates as the mesh is refined further. In this paper we extend the standard reaction-diffusion master equation to allow molecules occupying neighboring voxels to react, in contrast to the traditional approach, in which molecules react only when occupying the same voxel. We derive reaction rates, in two dimensions as well as three dimensions, to obtain an optimal match to the more fine-grained Smoluchowski model and show in two numerical examples that the extended algorithm is accurate for a wide range of mesh sizes, allowing us to simulate systems that are intractable with the standard reaction-diffusion master equation. In addition, we show that for mesh sizes above the fundamental lower limit of the standard algorithm, the generalized algorithm reduces to the standard algorithm. We derive a lower limit for the generalized algorithm which, in both two dimensions and three dimensions, is of the order of the reaction radius of a reacting pair of molecules.
已经确定,反应-扩散主方程的准确性存在固有限制。具体来说,存在一个基本的网格尺寸下限,低于该下限,随着网格进一步细化,准确性会恶化。在本文中,我们将标准的反应-扩散主方程扩展到允许占据相邻体素的分子进行反应,与传统方法不同,传统方法仅当分子占据相同体素时才会反应。我们推导出二维和三维的反应速率,以获得与更精细的 Smoluchowski 模型的最佳匹配,并通过两个数值示例表明,扩展算法对于广泛的网格尺寸都是准确的,允许我们模拟使用标准反应-扩散主方程难以处理的系统。此外,我们还表明,对于高于标准算法基本下限的网格尺寸,广义算法会简化为标准算法。我们推导出广义算法的下限,在二维和三维中,该下限的量级与一对反应分子的反应半径相当。