A locally adaptive time stepping algorithm for the solution to reaction diffusion equations on branched structures

Richard A. Kublik, David L. Chopp*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we present a numerical method for solving reaction-diffusion equations on one dimensional branched structures. Through the use of a simple domain decomposition scheme, the many branches are decoupled so that the equations can be solved as a system of smaller problems that are tri-diagonal. This technique allows for locally adaptive time stepping, in which the time step used in each branch is determined by local activity. Though the method is presented in the specific context of electrical activity in neural systems, it is sufficiently general that it can be applied to other classes of reaction-diffusion problems and higher dimensions. Information in neurons, which can be effectively modeled as one-dimensional branched structures, is carried in the form of electrical impulses called action potentials. The model equations, based on the Hodgkin-Huxley cable equations, are a set of reaction equations coupled to a single diffusion process. Locally adaptive time stepping schemes are well suited to neural simulations due to the spatial localization of activity. The algorithm significantly reduces the computational cost compared to existing methods, especially for large scale simulations.

Original languageEnglish (US)
Pages (from-to)621-649
Number of pages29
JournalAdvances in Computational Mathematics
Volume42
Issue number3
DOIs
StatePublished - Jun 1 2016

Keywords

  • Adaptive time-stepping
  • Hodgkin-Huxley equation
  • Reaction-diffusion equations

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A locally adaptive time stepping algorithm for the solution to reaction diffusion equations on branched structures'. Together they form a unique fingerprint.

Cite this