A Simple and Stable Numerical Solution for the Population Density Equation

Abstract

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.

Cite

Text

de Kamps. "A Simple and Stable Numerical Solution for the Population Density Equation." Neural Computation, 2003. doi:10.1162/089976603322297322

Markdown

[de Kamps. "A Simple and Stable Numerical Solution for the Population Density Equation." Neural Computation, 2003.](https://mlanthology.org/neco/2003/dekamps2003neco-simple/) doi:10.1162/089976603322297322

BibTeX

@article{dekamps2003neco-simple,
  title     = {{A Simple and Stable Numerical Solution for the Population Density Equation}},
  author    = {de Kamps, Marc},
  journal   = {Neural Computation},
  year      = {2003},
  pages     = {2129-2146},
  doi       = {10.1162/089976603322297322},
  volume    = {15},
  url       = {https://mlanthology.org/neco/2003/dekamps2003neco-simple/}
}