稀疏的重新制定的格林函数形式主义允许有效的模拟偏微分方程的树图
A sparse reformulation of the Green's function formalism allows efficient simulations of partial differential equations on tree graphs
摘要:
我们证明,当一类偏微分方程,广义电缆方程,树图上定义的,当输入被限制到一个空间离散的,精心挑选的一组点,格林函数(GF)的形式主义可以重写为$O(n)$与$n$的输入位置的数量,相反,以前报道的$O(n^2)$缩放。我们表明,线性缩放可以与扩展的剩余内核的指数的总和相结合,以允许有效的模拟上述类的方程。我们进一步验证了这种模拟范例的神经细胞模型,并探讨其与更传统的有限差分方法的关系。预计在计算性能的增益的情况下,进行了讨论。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。