Preprint
Case Report

This version is not peer-reviewed.

Analytical Solution of System of FitzHugh-Nagumo Model: A Case Study

Submitted:

28 December 2025

Posted:

29 December 2025

You are already at the latest version

Abstract
This study explores the FitzHugh-Nagumo model, a mathematical system used to simulate the activity of neurons. We apply the Adomian Decomposition Method (ADM) to generate approximate solutions using polynomial series. While these formula-based approximations are highly accurate for capturing short-term changes, the analysis reveals a critical limitation: they eventually fail over longer timeframes. This is because the neuron model is designed to produce stable, repeating cycles (oscillations), whereas polynomial approximations naturally grow to infinity rather than looping back. Consequently, this analytical method cannot accurately reproduce the neuron's long-term, rhythmic behavior. To accurately capture the long-term dynamics and spiking behavior of the neuron, numerical integration approaches are the necessary and most reliable option.
Keywords: 
;  ;  ;  

System of FitzHugh-Nagumo Model (Xia et al. 2025):

The FitzHugh-Nagumo (FHN) model is proposed by Richard FitzHugh in 1961 which is further refined by Jin-ichi Nagumo. It is a mathematical model that describes the interaction between a membrane potential and a recovery variable.
d u d t = u u 3 3 v + I
d v d t = ϵ u + a b v
where
u :   The membrane potential
v : The recovery variable
I : External stimulus current applied to the neuron.
ϵ : A small constant that separates the timescale where   0 < ϵ 1 .
a ,   b : System parameters governing the dynamical behavior.
Let the initial conditions be
u 0 = c 1 ,   v 0 = c 2 .
Let us introduce Adomian Decomposition Method (ADM) to solve the system (1a, b). Let’s define the linear operator and inverse linear operator such that
L = d d t ,   L 1 = 0 t d τ
Now, applying linear operator in Eqs. (1a, b), we have
L u = u u 3 3 v + I
L v = ϵ u + ϵ a b ϵ v
Then applying inverse linear operator of both sides of (2a, b), we get
u t u 0 = L 1 u 1 3 L 1 u 3 L 1 v + I L 1 1
v t v 0 = ϵ L 1 u + ϵ a L 1 1 b ϵ L 1 v
This implies
u t = c 1 + I t + L 1 u L 1 v 1 3 L 1 u 3
v t = c 2 + ϵ a t + ϵ L 1 u b ϵ L 1 v
Let the solution of u t and v t are
u t = n = 0 u n   ,   v t = n = 0 v n    
Also, assume that
u 3 = n = 0 A n = n = 0 1 n ! d n d λ n f i = 0 λ i u i λ = 0   w h e r e   f u = u 3
Substitute all these values in Eqs. (3a, b), we get
n = 0 u n   = c 1 + I t + L 1 n = 0 u n   L 1 n = 0 v n   1 3 L 1 n = 0 A n
n = 0 v n   = c 2 + ϵ a t + ϵ L 1 n = 0 u n   b ϵ L 1 n = 0 v n  
Let us match terms from both sides, we get
Zeroth Term (n = 0):
u 0 = c 1 + I t
v 0 = c 2 + ϵ a t
For n 0 :
u n + 1 = L 1 u n L 1 v n 1 3 L 1 A n
v n + 1 = ϵ L 1 u n b ϵ L 1 v n
Also, from Eq. (4b), we have (Dehghan et al. 2010):
A n = n = 0 1 n ! d n d λ n f i = 0 λ i u i λ = 0   w h e r e   f u = u 3 ,   n = 1 ,   2 ,   3 ,  
It gives
A 0 = u 0 3 A 1 = 3 u 0 2 u 1 A 2 = 3 u 0 2 u 2 + 3 u 0 u 1 2 A 3 = 3 u 0 2 u 3 + 6 u 0 u 1 u 2 + u 1 3 A 4 = 3 u 0 2 u 4 + 6 u 0 u 1 u 3 + 3 u 0 u 2 2 + 3 u 1 2 u 2 and so on.
Now, we will calculate the components: u i ,   v i ,   i = 1 ,   2 ,  
Set n = 0 in (7a, b), we get
u 1 = L 1 u 0 L 1 v 0 1 3 L 1 A 0
v 1 = ϵ L 1 u 0 b ϵ L 1 v 0
Applying the definition of inverse operator, we get
u 1 = 0 t u 0 τ v 0 τ 1 3 A 0 τ d τ
v 1 = 0 t ϵ u 0 τ b ϵ v 0 τ d τ  
Substituting the values of   u 0 ,   v 0 ,   A 0 , we get
u 1 = c 1 c 2 1 3 c 1 3 t + 1 2 I ϵ a c 1 2 I t 2 c 1 I 2 t 3 1 12 I 3 t 4
v 1 = ϵ c 1 ϵ b c 2 t + 1 2 ϵ I ϵ 2 a b t 2
Again, set n = 1 in (7a, b), we get
u 2 = L 1 u 1 L 1 v 1 1 3 L 1 A 1
v 2 = ϵ L 1 u 1 b ϵ L 1 v 1
Applying the definition of inverse operator, we get
u 2 = 0 t u 1 τ v 1 τ 1 3 A 1 τ d τ
v 2 = 0 t ϵ u 1 τ b ϵ v 1 τ d τ  
Now, from Eqs. (10a, b), we get
u 1 = U 1 t + U 1 t 2 + U 3 t 3 + U 4 t 4
v 1 = V 1 t + V 2 t 2
where
U 1 = c 1 c 2 1 3 c 1 3 ,   U 2 = 1 2 I ϵ a c 1 2 I ,   U 3 = c 1 I 2 ,   U 4 = 1 12 I 3   V 1 = ϵ c 1 ϵ b c 2 ,   V 2 = 1 2 ϵ I ϵ 2 a b
Substituting the values of   u 1 ,   v 1 ,   A 1 , we get
u 2 = 1 2 U 1 V 1 c 1 2 U 1 t 2 + 1 3 U 2 V 2 c 1 2 U 2 2 c 1 I U 1 t 3   + 1 4 U 3 c 1 2 U 3 2 c 1 I U 2 I 2 U 1 t 4   + 1 5 U 4 c 1 2 U 4 2 c 1 I U 3 I 2 U 2 t 5 1 6 2 c 1 I U 4 + I 2 U 3 t 6   1 7 I 2 U 4 t 7
v 2 = 1 2 ϵ U 1 ϵ b V 1 t 2 + 1 3 ϵ U 2 ϵ b V 2 t 3 + ϵ 4 U 3 t 4 + ϵ 5 U 4 t 5
Hence the approximate analytical solutions are
u t c 1 + I t + U 1 t + U 1 t 2 + U 3 t 3 + U 4 t 4 + ( 1 2 U 1 V 1 c 1 2 U 1 t 2 + 1 3 U 2 V 2 c 1 2 U 2 2 c 1 I U 1 t 3 + 1 4 U 3 c 1 2 U 3 2 c 1 I U 2 I 2 U 1 t 4 + 1 5 U 4 c 1 2 U 4 2 c 1 I U 3 I 2 U 2 t 5 1 6 2 c 1 I U 4 + I 2 U 3 t 6 1 7 I 2 U 4 t 7 ) +
v t c 2 + ϵ a t + V 1 t + V 2 t 2 + 1 2 ϵ U 1 ϵ b V 1 t 2 + 1 3 ϵ U 2 ϵ b V 2 t 3 + ϵ 4 U 3 t 4 + ϵ 5 U 4 t 5 +
Although the Adomian Decomposition Method (ADM) yields explicit approximate analytical expressions for the FitzHugh-Nagumo system, its utility is fundamentally constrained by the mathematical nature of polynomial approximations. While ADM exhibits high accuracy in the short-term regime—effectively capturing the initial transient dynamics and local curvature similar to a Taylor expansion—it suffers from inevitable divergence over longer time horizons. This limitation arises because the FitzHugh-Nagumo model is a dissipative system characterized by a stable limit cycle (sustained oscillations), a behavior that cannot be faithfully represented by a finite polynomial which tends toward infinity.
Let us consider the system (1a, b),   I = 0.5 ,   a = 0.7 ,   b = 0.8 . Also, u 0 = 0 ,   v 0 = 0 . Also, consider the method “odeint” from the scipy.integrate library. Note, “odeint” is a Python wrapper for the LSODA solver. LSODA stands for Livermore Solver for Ordinary Differential equations with Automatic method switching. Using this, we get the following solutions:
Figure 1. Variation of u, v for ϵ   =   0.08 .
Figure 1. Variation of u, v for ϵ   =   0.08 .
Preprints 191842 g001aPreprints 191842 g001b
Figure 2. Variation of u, v for ϵ   =   0.5 .
Figure 2. Variation of u, v for ϵ   =   0.5 .
Preprints 191842 g002aPreprints 191842 g002b
In conclusion, the FitzHugh-Nagumo equations in this study exhibit a stable limit cycle characterized by sustained periodic oscillations. Semi-analytical series methods (such as ADM, HPM, or VIM) rely on polynomial approximations, which inevitably diverge over long time horizons and cannot faithfully reproduce this periodic behavior. Consequently, it is infeasible to obtain a global exact analytical solution for this problem. To accurately capture the long-term dynamics and spiking behavior of the neuron, numerical integration approaches are the necessary and most reliable option.

References

  1. Dehghan, M.; Heris, J. M.; Saadatmandi, A. Application of semi-analytic methods for the Fitzhugh-Nagumo equation, which models the transmission of nerve impulses. Mathematical Methods in the Applied Sciences 2010, 33(11), 1384–1398. [Google Scholar] [CrossRef]
  2. Xia, Z.; Huang, X.; Gu, Y.; Saha, S. NeuroPhysNet: A FitzHugh-Nagumo-based physics-informed neural network framework for electroencephalograph (EEG) analysis and motor imagery classification. arXiv. 2025. Available online: https://arxiv.org/abs/2506.13222.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated