EFFICIENT COMPUTATION OF BRANCHED NERVE EQUATIONS
EFFICIENT COMPUTATION OF BRANCHED NERVE EQUATIONS
复制标题
DOI：
10.1016/0020-7101(84)90008-4
复制
发表时间：
1984-01-01
期刊：
影响因子：
--
通讯作者：
HINES, M
中科院分区：
文献类型：
--
作者：
HINES, M
提出了三个简单的改进，对于给定的精度，使用 Hodgkin Huxley (HH) 动力学模拟任意分支的有源电缆时，计算时间减少了 10 到 20 倍。第一个改进利用了树形网络每个分支的矩阵方程本质上的三对角特征，并像解决无分支电缆一样有效地求解方程。第二个改进评估时间步长 Δt 中点的 HH 膜电导，以保持完整的二阶精度 0(Δt2)，而不增加计算步骤数。第三个改进是利用预乘的 HH 速率函数表来非常有效地对 HH 膜电导进行二阶正确积分。
Three simple improvements are presented which, for a given accuracy, result in a 10- to 20-fold decrease in computation time for simulation of arbitrarily branched active cables with Hodgkin Huxley (HH) kinetics. The 1st improvement takes advantage of the essentially tridiagonal character of the matrix equation for each branch of a tree network and solves the equations as efficiently as for an unbranched cable. The 2nd improvement evaluates the HH membrane conductances at the midpoint of a time step, .DELTA.t, to maintain full 2nd order accuracy, 0(.DELTA.t2), with no increase in the number of computational steps. The 3rd improvement makes use of premultiplied HH rate function tables for very efficient 2nd order correct integration of HH membrane conductance.