# How equations are integrated

This document describes how xolotl solves the Ordinary Differential Equations (ODEs) in its models.

`xolotl`

is designed to solve for state variables of
conductance-based neuronal and network models.
The voltage across the membrane is given by

where is the specific membrane capacitance and is a specific transmembrane current. Each current takes the form

where is the instantaneous conductance and the ionic reversal potential. In many models, the conductance is given by

where is the maximal conductance in Siemens per unit area and and are gating variables . The gating variables themselves are defined by differential equations which depend on the membrane potential. These equations are nonlinear and usually quite stiff. For these reasons, bespoke integration schemes are typically used to solve them.

## The Exponential Euler method¶

The exponential Euler method is a time-discrete solution to differential equations of the form:

where is the state variable and and are functions of . This equation can be solved as follows:

Rearrange equation

Divide by , multiply by

Integrate, using the relation

Given a constant term , the equation can be written

For a time step , the voltage at time can be approximated from the voltage at time , where and

This approximation is more accurate than a first order Euler method approximation, and is significantly faster than higher order (*viz.* Runge-Kutta) methods.

For more information

See Ch. 5, Dayan, P. and Abbott, LF (2001) Theoretical Neuroscience, MIT Press. You can read the full book here

### Where this method is used¶

The exponential Euler method is used (when `solver_order`

= 0)

- to integrate the gating variables (
`m`

and`h`

in every conductance). This method is defined in the conductance class. - to integrate the voltage in compartments (for compartments that are not part of multi-compartment models)
- to integrate the Calcium levels in compartments (defined in some mechanisms)

## The Runge-Kutta fourth-order method¶

The Runge-Kutta methods are extensions of forward Euler to higher derivative orders. Given a differential equation in the form

with some initial condition . The first order (Euler) approximation for given is

Euler's method is accurate per step. The Runge-Kutta fourth-order method uses four coefficients to extend this method to accuracy of per step at the cost of speed. The coefficients are, for ,

The time-evolution formula for the Runge-Kutta fourth order method is

The method is more accurate because slope approximations at fractions of are being taken and averaged. The method is slower because the four coefficients must be computed during each integration step.

### Where this method is used¶

The Runge-Kutta 4th order method is used when (when `solver_order`

= 4) for components that support this method. If any component does not support it, an error will be thrown.

## The Euler method¶

Euler's method is the most basic explicit method for solving numerical integration problems of ordinary differential equations, and is the simplest Runge-Kutta method (i.e. it's 1st order). It is fast but inaccurate and unstable. Given a differential equation

with a known initial condition , the next step is determined by the evolution equation

This process can be iterated to determine the trajectory of with accuracy on the order of .

### Where this method is used¶

Some mechanisms may implement this method.

## The Crank-Nicolson method¶

The Crank-Nicolson method (Crank & Nicolson 1947) is based on the trapezoidal rule. It gives second-order convergence in time by using a combination of the forward Euler method at time and a backward Euler method at .

For a compartment with upstream compartment and downstream compartment (it is part of a multi-compartment cable), the equation of state is

where

Here, is the membrane capacitance of compartment , is the axial conductance from compartment to compartment , is the conductance of conductance in compartment and is the reversal potential of conductance . Additionally, is the injected current, which here is scaled by the surface area of compartment .

By defining,

the equation of state above can be rewritten in the implicit form

where for the Crank-Nicolson method. This equation must be solved to determine . For multi-compartment models, this involves writing an algebraic expression that sequentially solves starting at one end of the cable and proceeding to the other end(s). Then, a second sweep from the tips back to the soma allows for explicit solving at the next time point.

For branching morphologies that do not branch back into itself (that is, there is only one path with backtracking from soma to tip for each tip), tridiagonal matrix solvers (viz. Thomas algorithm, Hines matrix solvers), can be used to dramatically speed up the calculations. Currently, xolotl does not support solving branching morphologies.

### Where this method is used¶

The Crank-Nicolson method is the default for multi-compartment models. The Runge-Kutta method, while sufficient to integrate multi-compartment models accurately is orders of magnitude slower than the Crank-Nicolson method.

## Euler-Maruyama method¶

The Euler-Maruyama method approximates the numerical solution of a stochastic differential equation. It is a generalization of the first-order Euler method for ordinary differential equations.

The equation of state for conductance-based models is

This equation is deterministic, and is an approximation of the more realistic case, which is a stochastic system with independent ion channels. When is very large, this is a good approximation, since the law of large numbers implies that the standard error in the proportion of channels open is very small. When is small, stochasticity arising from finite numbers of channels can be modeled by an approximate Langevin formulation proposed by Fox & Lu 1994.

The fluctuation term is understood to be an uncorrelated Gaussian random variable with zero mean and unit variance. Since is understood to be some product of gating variables, the noise is included in the gating variable equation of state (subunit noise).

For a generic gating variable for some (temporarily) fixed , the equation of state without noise is an ordinary differential equation (ODE)

and with noise, it is a stochastic differential equation (SDE)

The solution to the SDE can be approximated using the Euler-Maruyama method, which is a modified version of Euler's method for ODEs.

For a time step and V = V(t), the Euler approximation to the solution of the ODE is

The Euler-Maruyama approximation to the solution of the SDE is

Since we are solving these equations numerically with a fixed time step, we fetch a new independent and identically distributed Gaussian random number at each time step, such that is some function of . Intuitively, will incorporate the time step, the number of channels, and the dynamics of .

Since the noise is per-channel, we calculate the number of channels using an approximation.

Here, is the estimated number of channels (rounded to a natural number), is the maximal conductance of the th channel, is the surface area of the compartment, and microsiemens, the conductance of a single channel.

Then, the Euler-Maruyama approximation for the stochastic gating variable as a function of time is

### Where this method is used¶

This method is automatically used when a model includes "conductance" noise, that is, noise caused by fluctuations in the opening and closing of ion channels. For "current" noise, use current clamp with a pseudorandom injected current constructed prior to simulation.

This method is consistent with Goldwyn & Shea-Brown 2011 and Sengupta, Laughlin, and Niven 2010.

## Bibliography¶

- Theoretical Neuroscience. Dayan and Abbott. You can read the full book here
- Crank-Nicolson Method. Crank & Nicolson 1947.
- Langevin formulation of subunit noise. Fox & Lu 1994.
- Discussion of noise in Hodgkin-Huxley models. Goldwyn & Shea-Brown 2011 & Sengupta, Laughlin, and Niven 2010.