Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
TocHeadingTitle
Date
Availability
1-1 of 1
Benjamin Torben-Nielsen
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: Journals Gateway
Neural Computation (2015) 27 (12): 2587–2622.
Published: 01 December 2015
FIGURES
| View all 15
Abstract
View articletitled, A Sparse Reformulation of the Green’s Function Formalism Allows Efficient Simulations of Morphological Neuron Models
View
PDF
for article titled, A Sparse Reformulation of the Green’s Function Formalism Allows Efficient Simulations of Morphological Neuron Models
We prove that when a class of partial differential equations, generalized from the cable equation, is defined on tree graphs and 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 with the number n of inputs locations, contrary to the previously reported 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.