A sparse reformulation of the Green's function formalism allows efficient simulations of morphological neuron models

DOI10.1162/NECO_A_00788zbMATH Open1414.92129WikidataQ50208103 ScholiaQ50208103MaRDI QIDQ5380356FDOQ5380356

Authors Willem A. M. Wybo, Daniele Boccalini, Benjamin Torben-Nielsen, Marc-Oliver Gewaltig

Publication date 4 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.03746

zbMATH Keywords

Green's function reformulationmorphological neuron models

Mathematics Subject Classification ID

Neural biology (92C20)

Abstract: We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs, and when the inputs are restricted to a spatially discrete, well chosen set of points, the Green's function (GF) formalism can be rewritten to scale as $O(n)$ with the number $n$ of input locations, contrary to the previously reported $O(n^2)$ scaling. We show that the linear scaling can be combined with an expansion of the remaining kernels as sums of exponentials, to allow efficient simulations of equations from the aforementioned class. We furthermore validate this simulation paradigm on models of nerve cells and explore its relation with more traditional finite difference approaches. Situations in which a gain in computational performance is expected, are discussed.

Recommendations

• The Green's function formalism as a bridge between single- and multi-compartmental modeling
• Computational convergence of the path integral for real dendritic morphologies
• Fast algorithms for simulation of neuronal dynamics based on the bilinear dendritic integration rule
• Techniques for obtaining analytical solutions for the somatic shunt cable model
• Fast and exact simulation methods applied on a broad range of neuron models

Cites work

• scientific article; zbMATH DE number 3254092 (Why is no real title available?)
• Branching dendrites with resonant membrane: a ``sum-over-trips approach
• Computational convergence of the path integral for real dendritic morphologies
• Exact digital simulation of time-invariant linear systems with applications to neuronal modeling
• Fast Convolution for Nonreflecting Boundary Conditions
• Introduction to Theoretical Neurobiology
• The Green's function formalism as a bridge between single- and multi-compartmental modeling
• The path integral for dendritic trees

Cited in

(2)

• Computational convergence of the path integral for real dendritic morphologies
• The Green's function formalism as a bridge between single- and multi-compartmental modeling

Describes a project that uses

Uses Software

• NEURON

This page was built for publication: A sparse reformulation of the Green's function formalism allows efficient simulations of morphological neuron models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380356)