de Kamps M
Section Cognitive Psychology, Faculty of Social Sciences, Leiden University, 2333 AK Leiden, The Netherlands.
Neural Comput. 2003 Sep;15(9):2129-46. doi: 10.1162/089976603322297322.
A population density description of large populations of neurons has generated considerable interest recently. The evolution in time of the population density is determined by a partial differential equation (PDE). Most of the algorithms proposed to solve this PDE have used finite difference schemes. Here, I use the method of characteristics to reduce the PDE to a set of ordinary differential equations, which are easy to solve. The method is applied to leaky-integrate-and-fire neurons and produces an algorithm that is efficient and yields a stable and manifestly nonnegative density. Contrary to algorithms based directly on finite difference schemes, this algorithm is insensitive to large density gradients, which may occur during evolution of the density.
最近,对大量神经元群体的种群密度描述引起了相当大的关注。种群密度随时间的演化由一个偏微分方程(PDE)决定。为求解这个偏微分方程而提出的大多数算法都使用了有限差分格式。在这里,我使用特征线法将偏微分方程简化为一组常微分方程,这些方程易于求解。该方法应用于泄漏积分发放神经元,并产生了一种高效的算法,该算法能产生稳定且明显非负的密度。与直接基于有限差分格式的算法不同,该算法对密度演化过程中可能出现的大密度梯度不敏感。