Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A Sparse Reformulation of the Green's Function Formalism Allows Efficient Simulations of Morphological Neuron Models. |
| Συγγραφείς: |
Wybo, Willem A. M., Boccalini, Daniele, Benjamin Torben-Nielsen, Gewaltig, Marc-Oliver |
| Πηγή: |
Neural Computation; 2015, Vol. 27 Issue 12, p2587-2622, 36p, 1 Diagram, 3 Graphs |
| Θεματικοί όροι: |
Mathematical reformulation, Green's functions, Partial differential equations, Generalization, Graph theory |
| Περίληψη: |
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 asO(n) with the number n of inputs locations, contrary to the previously reported O(n2) 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Neural Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Complementary Index |