
Citation: Paul G. Nestor, Toshiyuki Ohtani, James J. Levitt, Dominick T. Newell, Martha E. Shenton, Margaret Niznikiewicz, Robert W. McCarley. Prefrontal Lobe Gray Matter, Cognitive Control and Episodic Memory in Healthy Cognition[J]. AIMS Neuroscience, 2016, 3(3): 338-355. doi: 10.3934/Neuroscience.2016.3.338
[1] | Sumati Kumari Panda, Abdon Atangana, Juan J. Nieto . Correction: New insights on novel coronavirus 2019-nCoV/SARS-CoV-2 modelling in the aspect of fractional derivatives and fixed points. Mathematical Biosciences and Engineering, 2022, 19(2): 1588-1590. doi: 10.3934/mbe.2022073 |
[2] | Tahir Khan, Roman Ullah, Gul Zaman, Jehad Alzabut . A mathematical model for the dynamics of SARS-CoV-2 virus using the Caputo-Fabrizio operator. Mathematical Biosciences and Engineering, 2021, 18(5): 6095-6116. doi: 10.3934/mbe.2021305 |
[3] | A. D. Al Agha, A. M. Elaiw . Global dynamics of SARS-CoV-2/malaria model with antibody immune response. Mathematical Biosciences and Engineering, 2022, 19(8): 8380-8410. doi: 10.3934/mbe.2022390 |
[4] | Somayeh Fouladi, Mohammad Kohandel, Brydon Eastman . A comparison and calibration of integer and fractional-order models of COVID-19 with stratified public response. Mathematical Biosciences and Engineering, 2022, 19(12): 12792-12813. doi: 10.3934/mbe.2022597 |
[5] | Rahat Zarin, Usa Wannasingha Humphries, Amir Khan, Aeshah A. Raezah . Computational modeling of fractional COVID-19 model by Haar wavelet collocation Methods with real data. Mathematical Biosciences and Engineering, 2023, 20(6): 11281-11312. doi: 10.3934/mbe.2023500 |
[6] | A. M. Elaiw, Raghad S. Alsulami, A. D. Hobiny . Global dynamics of IAV/SARS-CoV-2 coinfection model with eclipse phase and antibody immunity. Mathematical Biosciences and Engineering, 2023, 20(2): 3873-3917. doi: 10.3934/mbe.2023182 |
[7] | Biplab Dhar, Praveen Kumar Gupta, Mohammad Sajid . Solution of a dynamical memory effect COVID-19 infection system with leaky vaccination efficacy by non-singular kernel fractional derivatives. Mathematical Biosciences and Engineering, 2022, 19(5): 4341-4367. doi: 10.3934/mbe.2022201 |
[8] | Adnan Sami, Amir Ali, Ramsha Shafqat, Nuttapol Pakkaranang, Mati ur Rahmamn . Analysis of food chain mathematical model under fractal fractional Caputo derivative. Mathematical Biosciences and Engineering, 2023, 20(2): 2094-2109. doi: 10.3934/mbe.2023097 |
[9] | M. Botros, E. A. A. Ziada, I. L. EL-Kalla . Semi-analytic solutions of nonlinear multidimensional fractional differential equations. Mathematical Biosciences and Engineering, 2022, 19(12): 13306-13320. doi: 10.3934/mbe.2022623 |
[10] | Noura Laksaci, Ahmed Boudaoui, Seham Mahyoub Al-Mekhlafi, Abdon Atangana . Mathematical analysis and numerical simulation for fractal-fractional cancer model. Mathematical Biosciences and Engineering, 2023, 20(10): 18083-18103. doi: 10.3934/mbe.2023803 |
Differential equations, especially those possessing non-negative solutions, play an important role in many areas of sciences such as biology [1,2,3,4,5], chemistry [6,7,8], epidemiology [9,10,11] or population dynamics [12,13,14] to name a few of these fields. Since we focus on examining a time-discrete, mathematical model of epidemiology in our work, we limit ourselves to a concise review of literature in this area.
In this article, we want to consider the time-continuous non-autonomous susceptible-infected-recovered (SIR) model
{S′(t)=−α(t)⋅S(t)⋅I(t)N,I′(t)=α(t)⋅S(t)⋅I(t)N−β(t)⋅I(t),R′(t)=β(t)⋅I(t),S(0)=S0,I(0)=I0,R(0)=R0 | (1.1) |
in epidemiology thoroughly investigated by Wacker and Schlüter in 2020 [15]. We provide further assumptions regarding this time-continuous model in Section 2. In 1927, one of the most famous papers in mathematical epidemiology, written by Kermack and McKendrick, was published [16]. Previously, Ross and Hudson proposed important foundations for epidemiological models [17,18]. Additional well-written books and review articles on mathematical epidemiology are authored by Hethcote [19] and Brauer and Castillo-Chávez [20]. Since the establishment of the classical SIR model, many modifications have been suggested and, due to the on-going COVID-19 pandemic, many articles have been published with respect to this topic and we can only summarize a brief selection of these works.
To this day, there are works which provide closed solution formulas for simple models in epidemiology [21,22,23]. However, more articles consider numerical approximations due to appearing nonlinearities. Especially during the COVID-19 pandemic, different approaches have been published [15,24]. In 2022, Chen and co-authors suggested a susceptible-exposed-infected-unreported-recovered (SEIUR) model for the spread of COVID-19 with piecewise constant dynamical parameters [25] as one possible extension of classical SIR models. Taking age- and sex-structure of a population into account, Wacker and Schlüter proposed an extension of classical SIR models by multiple groups which can be considered as, for example, age groups or locally related groups [26]. Using fractional differential operators, Xu and co-authors analyzed the spread of COVID-19 in 2020 with respect to the United States by means of a fractional-order susceptible-exposed-infected-recovered (SEIR) model [27]. Regarding parameter identification problems in epidemiological models, Marinov and Marinova designed adaptive SIR models to solve these inverse problems [28,29]. In context of inverse problems, Comunian, Gaburro and Giudici concluded that high-quality data are needed to calibrate constant parameters of epidemiological models [30]. Other interesting lines of research concern the consideration of epidemics on networks [31,32,33,34,35] or application of deep-learning approaches to, for example, forecast time-series data of epidemics by these methods [36,37,38].
One important aspect in epidemiological models is preservation of positivity. It plays a huge role in different scientific problems such as wave equations [39], simulations of chemical reactions [7], population dynamics [12,13,14] or other biological systems [3]. However, many classical time discretization schemes suffer from conserving non-negativity for arbitraty time step sizes [40]. Hence, designing non-negativity preserving numerical solution schemes for such problems can be regarded as an art as stated by Mickens [41]. For these reasons, Wacker and Schlüter examined a numerical solution scheme
{Sh,j+1−Sh,jhj+1=−αj+1⋅Sh,j+1⋅Ih,j+1N,Ih,j+1−Ih,jhj+1=αj+1⋅Sh,j+1⋅Ih,j+1N−βj+1⋅Ih,j+1,Rh,j+1−Rh,jhj+1=βj+1⋅Ih,j+1,Sh,1=S0,Ih,1=I0,Rh,1=R0 | (1.2) |
for (1.1) based on implicit Eulerian time discretization in [15] whose algorithm is presented in Algorithm 1.
Algorithm 1 Algorithmic summary for implicit Eulerian finite-difference-method (1.2) for (1.1) |
1: Inputs
2: Time vector (t1,…,tM)T∈RM 3: Time-varying transmission rates (α1,…,αM)T∈RM 4: Time-varying recovery rates (β1,…,βM)T∈RM 5: Initialize S:=0,I:=0,R:=0∈RM 6: Initial conditions S1:=S1, I1:=I1 and R1:=R1 7: Total population size N:=S1+I1+R1 8: Implicit Eulerian Finite-Difference-Method 9: for j∈{1,…,M−1} do 10: Define hj+1:=tj+1−tj as current time step size 11: Define Aj+1:=(1+βj+1⋅hj+1)⋅(αj+1⋅hj+1) 12: Define Bj+1:=(1+βj+1⋅hj+1)⋅N−αj+1⋅hj+1⋅(Sj+Ij)2 13: Compute Ij+1:=−Bj+1Aj+1+√B2j+1A2j+1+N⋅IjAj+1 14: Compute Sj+1:=Sj1+αj+1⋅hj+1⋅Ij+1N 15: Compute Rj+1:=Rj+βj+1⋅hj+1⋅Ij+1 16: end for 17: Outputs 18: Calculated vectors S,I,R∈RM |
Such non-standard finite-difference-methods for time discretization are also important in other application areas such as magnetohydrodynamics [42]. Here, we use f(tj):=fj as an abbreviation for time-continuous functions at time points tj and fh(tj):=fh,j as an abbreviation for time-discrete functions at time time points tj on possibly non-equidistant meshes t1<t2<…<tM−1<tM. Although Algorithm 1 preserves all desired properties of the time-continuous model (1.1) as shown in [15], there are still some disadvantages:
1) From its formulation (1.1), there is to solve a quadratic equation
Aj+1⋅I2j+1+Bj+1⋅Ij+1−N⋅Ij=0 |
where the a-priori knowledge of non-negative solutions from the time-continuous model is used to rule out one of both possible solutions for Algorithm 1 to obtain unique solvability;
2) In each time step, we must recalculate the auxiliary quantities Aj+1 and Bj+1;
3) By both aforementioned arguments, we conclude that Algorithm 1 does not intrinsically calculate biologically correct solutions and, from an algorithm point of view, recalculation of these auxiliary quantities is undesirable.
We want to propose a different discretization by non-standard finite-difference-methods based on non-local approximations. To explain the idea of non-standard finite-difference-methods based on non-local approximations, we consider a time-continuous dynamical system
y′(t)=f(t,y(t)). |
Standard time-discretizations normally approximate the right-hand-side function by function values of y(t) at one previous or the current time point. Non-standard finite-difference-methods based on non-local approximations, on the contrary, approximate f(t,y(t)) by function values from more then solely one previous or the current time point. For further details, we refer to the book [41] by Mickens. For the aforementioned three reasons, we suggest a non-standard finite-difference-method (NSFDM) given by
{Sh,j+1−Sh,jhj+1=−αj+1⋅Sh,j+1⋅Ih,jN,Ih,j+1−Ih,jhj+1=αj+1⋅Sh,j+1⋅Ih,jN−βj+1⋅Ih,j+1,Rh,j+1−Rh,jhj+1=βj+1⋅Ih,j+1,Sh,1=S0,Ih,1=I0,Rh,1=R0 | (1.3) |
in Section 3 as our first main contribution, after summarizing analytical properties of the time-continuous problem formulation (1.1) in Section 2. In Section 3, we additionally prove unconditional preservation of non-negativity and linear convergence of (1.3) towards the time-continuous solution of (1.1). Additionally, (1.3) transfers to a uniquely solvable algorithm which preserves non-negativity intrinsically. Based on (1.3), we design a numerical algorithm to solve the inverse problem of finding the time-varying parameter functions in Section 4 as our next main contribution. Finally, we strengthen our theoretical findings in Section 5 by providing some numerical examples, especially one numerical example where linear convergence is stressed, in contrast to [15], where linear convergence was not shown numerically.
Following [15], we take the following assumptions into consideration with regard to our time-continuous model (1.1):
(1). The total population size N is fixed for all time t≥0, i.e., it holds
N(t)=N=S0+I0+R0 | (2.1) |
for all t≥0 and we assume I0>0 to really get an evolution in time of the infected subgroup of the population;
(2). We divide the total population into three homogeneous subgroups, namely susceptible people (S), infected people (I) and recovered people (R). The equation
N(t)=S(t)+I(t)+R(t) | (2.2) |
is valid for all t≥0;
(3). The time-varying transmission rate α:[0,∞)⟶[0,∞) is at least continuously differentiable once and there exist positive constants αmin>0 and αmax>0 such that
αmin≤α(t)≤αmax | (2.3) |
holds for all t≥0;
(4). The time-varying recovery rate β:[0,∞)⟶[0,∞) is at least continuously differentiable once and there exist positive constants βmin>0 and βmax>0 such that
βmin≤β(t)≤βmax | (2.4) |
holds for all t≥0.
We summarize the following analytical properties of the time-continuous problem formulation (1.1) from article [15]:
Theorem 1. Let all assumptions from (2.1)–(2.4) for our time-continuous model (1.1) be fulfilled. The following statements hold true:
(1). Possible solutions of (1.1) remain non-negative and bounded above, i.e.,
{0≤S(t)≤N;0≤I(t)≤N;0≤R(t)≤N | (2.5) |
hold for all t≥0;
(2). The time-continuous problem formulation (1.1) possesses exactly one globally unique solution for all t≥0;
(3). First, S is monotonically decreasing and there exists S⋆>0 such that limt→∞S(t)=S⋆. Secondly, R is monotonically increasing and there exists R⋆>0 such that limt→∞R(t)=R⋆. Finally, it holds limt→∞I(t)=0.
Proof. (1). This statement's proof can be found in [15, Theorem 4].
(2). Globally unique existence in time is proven in [15, Theorem 6].
(3). Proof of the solution components' monotonicity and its long-time behavior is given in [15, Theorem 8].
We want to note that S⋆ and R⋆ depend on the initial conditions.
Let 0=t1<t2<…<tM=T be an arbitrary and possibly non-equidistant partition of the simulation interval [0,T] with final simulation time T. As abbreviations, we write f(tj):=fj for time-continuous functions and fh(tj):=fh,j for time-discrete functions at time points tj for all j∈{1,2,…,M}. The time-discrete problem formulation of our time-continuous model (1.1) is given by (1.3) for all j∈{1,2,…,M−1}. Here, hj+1:=tj+1−tj denote non-equidistant time step sizes for all j∈{1,2,…,M−1}. Additionally, the supremum norm on [0,T] for time-continuous functions is denoted by
‖f(t)‖∞:=supt∈[0,T]|f(t)| |
while the same supremum norm on [tp,tp+1] reads
‖f(t)‖∞,p+1:=supt∈[tp,tp+1]|f(t)|. |
As our first result, our time-discrete problem formulation (1.3) conserves total population size N for all time points tj∈[0,T] with j∈{1,2,…,M}.
Theorem 2. Possible solutions of (1.3) fulfill
N=Sh,j+Ih,j+Rh,j | (3.1) |
for all j∈{1,2,…,M}.
Proof. This statement can be proven by induction. For j=1, it is clear by our initial conditions that
N=Sh,1+Ih,1+Rh,1 |
holds. Let us assume that
N=Sh,j+Ih,j+Rh,j |
is valid for an arbitrary j∈{1,2,…,M−1}. Adding all three equations of (1.3), we obtain
(Sh,j+1−Sh,j)+(Ih,j+1−Ih,j)+(Rh,j+1−Rh,j)hj+1=0 |
and this implies
Sh,j+1+Ih,j+1+Rh,j+1=Sh,j+Ih,j+Rh,j |
which proves our assertion (3.1).
As our next result, we show that approximate solutions of our time-continuous model (1.1) from our discretization model (1.3) remain non-negative and bounded.
Theorem 3. Possible solutions of (1.3) remain non-negative and bounded for all tj∈[0,T] with arbitrary j∈{1,2,…,M}, i.e., these solultions fulfill
{0≤Sh,j≤N;0≤Ih,j≤N;0≤Rh,j≤N | (3.2) |
for all j∈{1,2,…,M}.
Proof. (1). By the first three equations of (1.3), we obtain
Sh,j+1=Sh,j1+hj+1⋅αj+1⋅Ih,jN | (3.3) |
for all j∈{1,2,…,M−1},
Ih,j+1=Ih,j⋅1+hj+1⋅αj+1Sh,j+1⋅Ih,jN1+hj+1⋅βj+1 | (3.4) |
for all j∈{1,2,…,M−1} and
Rh,j+1=Rh,j+hj+1⋅βj+1⋅Ih,j+1 | (3.5) |
for all j∈{1,2,…,M−1}.
(2). By our assumption of non-negative initial values Sh,1,Ih,1,Rh,1 and by the three equations (3.3)–(3.5), we conclude that
Sh,j≥0;Ih,j≥0;Rh,j≥0 |
hold for all j∈{1,2,…,M}.
(3). By non-negativity and conservation of total population size (3.1) from Theorem 2, it follows that
Sh,j≤N;Ih,j≤N;Rh,j≤N |
hold for all j∈{1,2,…,M}.
(4). Hence, all possible solutions of (1.3) remain non-negative and bounded.
It directly follows that our numerical solution scheme (1.3) is uniquely solvable for all j∈{1,2,…,M}.
Theorem 4. The discretization scheme (1.3), based on the explicit solutions (3.3)–(3.5), is well-defined and uniquely solvable for all j∈{1,2,…,M}.
Proof. (3.3)–(3.5) prove that our numerical solution scheme (1.3) is well-defined. Unique solvability is a direct consequence of these equations as well. Hence, our assertion is proven.
Remark 1. We briefly want to note why we call solutions (3.3)–(3.5) explicit. It obviously holds
Sh,j+1=Sh,j1+hj+1⋅αj+1⋅Ih,jN=N⋅Sh,jN+hj+1⋅αj+1⋅Ih,j | (3.6) |
for all j∈{1,2,…,M} explicitly. Plugging (3.6) into (3.4) yields
Ih,j+1=Ih,j⋅(1+hj+1⋅αj+1⋅Sh,j+1⋅Ih,jN)1+hj+1⋅βj+1=Ih,j⋅(1+hj+1⋅αj+1⋅Sh,j⋅Ih,jN+hj+1⋅αj+1⋅Ih,j)1+hj+1⋅βj+1 | (3.7) |
for all j∈{1,2,…,M} as an explicit formula. Finally, by using (3.7), we get
Rh,j+1=Rh,j+hj+1⋅βj+1⋅Ih,j+1=Rh,j+hj+1⋅βj+1⋅Ih,j⋅(1+hj+1⋅αj+1⋅Sh,j⋅Ih,jN+hj+1⋅αj+1⋅Ih,j)1+hj+1⋅βj+1 | (3.8) |
for all j∈{1,2,…,M}. For these reasons, we talk about an explicit numerical solution scheme.
We show that monotonicity properties and long-time behavior of the time-continuous problem formulation (1.1) translates to our time discretization (1.3).
Theorem 5. 1). The sequence {Sh,j}Mj=1 is monotonically decreasing and there exists a non-negative constant S⋆h such that limj→∞Sh,j=S⋆h holds.
2). The sequence {Rh,j}Mj=1 is monotonically increasing and there exists a non-negative constant R⋆h such that limj→∞Rh,j=R⋆h holds.
3). It holds limj→∞Ih,j=0 if also T→∞ and hj+1≠0 are assumed.
Proof. (1). Since {Sh,j}Mj=1 is non-negative and bounded above by the total population size N, the inequality
Sh,j+1=Sh,j1+hj+1⋅αj+1⋅Ih,jN≤Sh,j |
from (3.6) implies that this sequence is also monotonically decreasing which proves our first claim.
(2). Since {Rh,j}Mj=1 is non-negative and bounded above by the total population size N, the inequality
Rh,j+1=Rh,j+hj+1⋅βj+1⋅Ij+1≥Rh,j |
from (3.5) yields that this sequence is monotonically increasing which shows our second assertion.
(3). We conclude
0≤Ij+1=Rh,j+1−Rh,jhj+1⋅βj+1≤Rh,j+1−Rh,jhj+1⋅βmin |
from (3.5) and this shows that our third claim is also true.
Remark 2. Both Theorems 1 and 5 imply that our time-continuous problem formulation (1.1) and our time-discrete problem formulation (1.3) converge towards the disease-free equilibrium state in the long run.
We start this subsection by listing all our assumptions for our main result regarding linear convergence of the time-discrete solution towards the time-continuous one:
(A11) We consider the time interval [0,T] where
t1=0<t2<…<tM−1<tM:=T |
holds;
(A12) The initial conditions of the time-continuous and of the time-discrete problems coincide;
(A13) The time-continuous solution functions S,I,R:[0,T]⟶R should be twice continuously differentiable;
(A14) The time-varying transmission rate α:[0,T]⟶[0,∞) and the time-varying recovery rate β:[0,T]⟶[0,∞) should be once continuously differentiable;
(A15) The time-varying transmission rate and the time-varying recovery rate should be bounded, i.e., there are non-negative constants αmin,αmax,βmin,βmax such that
0≤αmin≤α(t)≤αmax |
and
0≤βmin≤β(t)≤βmax |
hold for all t∈[0,T];
(A16) Set h:=maxp∈Nhp.
Theorem 6. Let all assumptions (A11)–(A16) be fulfilled. Then the time-discrete solution convergences linearly towards the time-continuous solution if h→0.
Proof. We shortly explain our proof's strategy because it is relatively technical. If we first assume that our time-discrete solution coincides with the time-continuous solution at a certain time point tp∈[0,T] for an arbitrary p∈{1,2,…,M−1}, then we investigate the local error propagation to the next time point tp+1. Secondly, we consider error propagation in time and finally, we examine accumulation of these errors. We denote time-discrete solutions, for example, by Sh,p and time-continuous solutions by S(tp) at the same time point tp.
1) For investigation of local errors, we assume that
(tp,Sh,p)=(tp,S(tp));(tp,Ih,p)=(tp,I(tp))and(tp,Rh,p)=(tp,R(tp)) |
hold for an arbitrary p∈{1,2,…,M−1} on the time-interval [tp,tp+1]. Since we only take one time step into account, we denote corresponding time-discrete solutions by ~Sh,p+1, ~Ih,p+1 and ~Rh,p+1.
1.1) We have by (3.6) from Remark 1 that
~Sh,p+1=S(tp)(1+αp+1⋅hp+1⋅I(tp)N)=S(tp)−S(tp)⋅αp+1⋅hp+1⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N) | (3.9) |
holds. This implies
|S(tp+1)−~Sh,p+1|(3.9)=|S(tp+1)−S(tp)+S(tp)⋅αp+1⋅hp+1⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N)|≤|tp+1∫tpS′(τ)dτ−hp+1⋅S′(tp)|⏟=:IS,1+|hp+1⋅S′(tp)+S(tp)⋅αp+1⋅hp+1⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N)|⏟=:IIS,1. | (3.10) |
By the mean value Theorem, there exists ξS,1∈(tp,tp+1) such that we obtain
|S′′(ξS,1)|=|S′(τ)−S′(tp)τ−tp|≤‖S′′(t)‖∞. | (3.11) |
This yields
IS,1=|tp+1∫tp{S′(τ)−S′(tp)}dτ|=|tp+1∫tp(S′(τ)−S′(tp))(τ−tp)⋅(τ−tp)dτ|(3.11)≤12⋅h2p+1⋅‖S′′(t)‖∞. | (3.12) |
For IIS,1, we notice that
IIS,1=|hp+1⋅S′(tp)+S(tp)⋅αp+1⋅hp+1⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N)|(1.1)=|−αp⋅hp+1⋅S(tp)⋅I(tp)N+S(tp)⋅αp+1⋅hp+1⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N)|=|hp+1⋅S(tp)N|⋅|−αp⋅I(tp)+αp+1⋅I(tp)(1+αp+1⋅hp+1⋅I(tp)N)|≤hp+1⋅|−αp⋅I(tp)⋅(1+αp+1⋅hp+1⋅I(tp)N)+αp+1⋅I(tp)(1+αp+1⋅hp+1⋅I(tp)N)|≤hp+1⋅|(αp+1−αp)⋅I(tp)(1+αp+1⋅hp+1⋅I(tp)N)|+hp+1⋅|αp⋅αp+1⋅hp+1⋅I(tp)⋅I(tp)N(1+αp+1⋅hp+1⋅I(tp)N)|≤hp+1⋅N⋅|αp+1−αp|⏟=:IIIS,1+h2p+1⋅α2max⋅N |
and hence,
IIS,I≤hp+1⋅N⋅|αp+1−αp|⏟=:IIIS,1+h2p+1⋅α2max⋅N | (3.13) |
holds due to boundedness of time-continuous solutions. Using again the mean value theorem for IIIS,1, we see that there is ξα,1∈(tp,tp+1) such that we obtain
|α′(ξα,1)|=|αp+1−αptp+1−tp|⋅hp+1≤hp+1⋅‖α′(t)‖∞. | (3.14) |
Hence, we conclude
IIIS,1=|(αp+1−αp)|(3.14)≤hp+1⋅‖α′(t)‖∞ | (3.15) |
for IIIS,1. Plugging (3.15) into (3.13) yields
IIS,1≤hp+1⋅N⋅IIIS,1+h2p+1⋅α2max⋅N(3.15)≤h2p+1⋅N⋅‖α′(t)‖∞+h2p+1⋅α2max⋅N=h2p+1⋅(‖α′(t)‖∞⋅N+α2max⋅N). | (3.16) |
Thus, we finally obtain
|S(tp+1)−~Sh,p+1|(3.10)=IS,1+IIS,1≤12⋅h2p+1⋅‖S′′(t)‖∞+h2p+1⋅(‖α′(t)‖∞⋅N+α2max⋅N)=(12⋅‖S′′(t)‖∞+‖α′(t)‖∞⋅N+α2max⋅N)⏟=:Cloc,S⋅h2p+1. | (3.17) |
1.2) By (3.7) from Remark 1, we get
~Ih,p+1=I(tp)⋅(1+αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1). | (3.18) |
Hence, it follows
|I(tp+1)−~Ih,p+1|(3.18)=|I(tp+1)−I(tp)⋅(1+αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)|=|{I(tp+1)−I(tp)}+{I(tp)−I(tp)⋅(1+αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)}|=|tp+1∫tpI′(τ)dτ+I(tp)⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)|≤|tp+1∫tpI′(τ)dτ−hp+1⋅I′(tp+1)|⏟=:II,1+|hp+1⋅I′(tp+1)+I(tp)⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)|⏟=:III,1. | (3.19) |
By the mean value theorem, there exists ξI,1∈(tp,tp+1) such that
I′′(ξI,1)=I′(τ)−I′(tp+1)τ−tp+1 | (3.20) |
is valid. This implies
II,1=|tp+1∫tp(I′(τ)−I′(tp+1))(τ−tp+1)⋅(τ−tp+1)dτ|(3.20)=|tp+1∫tpI′′(ξI,1)⋅(τ−tp+1)dτ|≤12⋅‖I′′(t)‖∞⋅h2p+1. | (3.21) |
For III,1, we observe
III,1=|hp+1⋅I′(tp+1)+I(tp)⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)|=hp+1⋅|αp+1⋅I(tp+1)⋅S(tp+1)N−βp+1⋅I(tp+1)+I(tp)⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅~Sh,p+1N)(1+βp+1⋅hp+1)|=hp+11+βp+1⋅hp+1⋅|αp+1I(tp+1)⋅S(tp+1)N⋅(1+βp+1⋅hp+1)−βp+1⋅I(tp+1)⋅(1+βp+1⋅hp+1)+βp+1⋅I(tp)−αp+1⋅I(tp)⋅~Sh,p+1N| | (3.22) |
and can conclude
III,1(3.22)≤hp+1⋅|αp+1N⋅(I(tp+1)⋅S(tp+1)−I(tp)⋅~Sh,p+1)|⏟=:IIII,1+hp+1⋅|αp+1⋅βp+1⋅hp+1⋅I(tp+1)⋅S(tp+1)N|⏟=:IVI,1+hp+1⋅|βp+1⋅(I(tp)−I(tp+1))|⏟=:VI,1+hp+1⋅|β2p+1⋅I(tp+1)⋅hp+1|⏟=:VII,1. | (3.23) |
By boundedness and the mean value theorem, we receive the following estimates
VII,1≤hp+1⋅N⋅β2max,VI,1≤hp+1⋅βmax⋅‖I′(t)‖∞,IVI,1≤hp+1⋅N⋅αmax⋅βmax | (3.24) |
for VII,1, VI,1 and IVI,1. By boundedness, the triangle inequality and the mean value theorem, we can deduce
IIII,1=|αp+1N|⋅|{I(tp+1)⋅S(tp+1)−I(tp)⋅S(tp+1)}+{I(tp)⋅S(tp+1)−I(tp)⋅~Sh,p+1}|≤αmaxN⋅|I(tp+1)−I(tp)|⋅|S(tp+1)|+αmaxN⋅|S(tp+1)−~Sh,p+1|⋅|I(tp)|(3.17)≤αmax⋅hp+1⋅‖I′(t)‖∞+αmax⋅h2p+1⋅Cloc,S | (3.25) |
and consequently, this implies
III,1≤hp+1⋅{IIII,1+IVI,1+VI,1+VII,1}≤hp+1⋅{αmax⋅hp+1⋅‖I′(t)‖∞+αmax⋅h2p+1⋅Cloc,S+αmax⋅βmax⋅hp+1⋅N+βmax⋅hp+1⋅‖I′(t)‖∞+β2max⋅hp+1⋅N}. | (3.26) |
Hence, we conclude that
|I(tp+1)−~Ih,p+1|(3.19)≤II,1+III,1(3.26)≤12⋅h2p+1⋅‖I′′(t)‖∞+h2p+1⋅{αmax⋅‖I′(t)‖∞+αmax⋅hp+1⋅Cloc,S+αmax⋅βmax⋅N+βmax⋅‖I′(t)‖∞+β2max⋅N} | (3.27) |
holds. By defining
Cloc,I:={12⋅‖I′′(t)‖∞+αmax⋅‖I′(t)‖∞+αmax⋅hp+1⋅Cloc,S+αmax⋅βmax⋅N+βmax⋅‖I′(t)‖∞+β2max⋅N}, | (3.28) |
we finally deduce
|I(tp+1)−~Ih,p+1|(3.28)≤h2p+1⋅Cloc,I | (3.29) |
from (3.27).
1.3) By (3.8) from Remark 1, we get
~Rh,p+1=R(tp)+hp+1⋅βp+1⋅~Ih,p+1. | (3.30) |
Hence, it follows
|R(tp+1)−~Rh,p+1|(3.30)=|R(tp+1)−R(tp)−hp+1⋅βp+1⋅~Ih,p+1|≤|tp+1∫tpR′(τ)dτ−hp+1⋅βp+1⋅I(tp+1)|+hp+1⋅βmax⋅|I(tp+1)−~Ih,p+1|. | (3.31) |
By using similar argument as in previous steps with the help of the mean value theorem and (3.29), we can deduce
|R(tp+1)−~Rh,p+1|≤12⋅h2p+1⋅‖R′′(t)‖∞+h3p+1⋅βmax⋅Cloc,I=h2p+1⋅{12⋅‖R′′(t)‖∞+βmax⋅Cloc,I⋅hp+1}⏟=:Cloc,R. | (3.32) |
1.4) By setting
Cloc:=max{Cloc,S,Cloc,I,Cloc,R}, | (3.33) |
we conclude
Ap+1:=max{|S(tp+1)−~Sh,p+1|,|I(tp+1)−~Ih,p+1|,|R(tp+1)−~Rh,p+1|}≤Cloc⋅h2p+1. | (3.34) |
2) Normally, the points (tp,Sp), (tp,Ip) and (tp,Rp) do not exactly lie on the graph of the time-continuous solution. We then must investigate how procedural errors such as |Sh,p−S(tp)|, |Ih,p−I(tp)| or |Rh,p−R(tp)| propagate to the (p+1)-th time step.
2.1) We observe that
|Sh,p+1−~Sh,p+1|=|(Sh,p−Sh,p⋅αp+1⋅hp+1⋅Ih,pN1+αp+1⋅hp+1⋅Ih,pN)−(S(tp)−S(tp)⋅αp+1⋅hp+1⋅I(tp)N1+αp+1⋅hp+1⋅I(tp)N)|≤|Sh,p−S(tp)|+αmax⋅hp+1N⋅IS,2 | (3.35) |
holds where IS,2 is given and estimated by
IS,2=|Sh,p⋅Ih,p⋅(1+αp+1⋅hp+1⋅I(tp)N)−S(tp)⋅I(tp)⋅(1+αp+1⋅hp+1⋅Ih,pN)(1+αp+1⋅hp+1⋅Ih,pN)⋅(1+αp+1⋅hp+1⋅I(tp)N)|≤|Sh,p⋅Ih,p−S(tp)⋅I(tp)|⏟=:IIS,2+αmax⋅hp+1N⋅|Sh,p⋅Ih,p⋅I(tp)−S(tp)⋅I(tp)⋅Ih,p|⏟=:IIIS,2. | (3.36) |
We have
IIS,2=|Sh,p⋅Ih,p−S(tp)⋅I(tp)|≤|Sh,p⋅(Ih,p−I(tp))|+|I(tp)⋅(Sh,p−S(tp))|≤N⋅|Ih,p−I(tp)|+N⋅|Sh,p−S(tp)| | (3.37) |
and
IIIS,2=|Sh,p⋅Ih,p⋅I(tp)−S(tp)⋅I(tp)⋅Ih,p|=|I(tp)⋅(Sh,p⋅Ih,p−S(tp)⋅Ih,p)|≤N⋅|Ih,p⋅(Sh,p−S(tp))|≤N2⋅|Sh,p−S(tp)|. | (3.38) |
Plugging (3.37) and (3.38) into (3.36) yields
IS,2≤IIS,2+αmax⋅hp+1N⋅IIIS,2≤N⋅|Ih,p−I(tp)|+N⋅|Sh,p−S(tp)|+αmax⋅hp+1⋅N⋅|Sh,p−S(tp)|=N⋅|Ih,p−I(tp)|+N⋅(1+αmax⋅hp+1)⋅|Sh,p−S(tp)|. | (3.39) |
Using (3.35), we obtain
|Sh,p+1−~Sh,p+1|≤|Sh,p−S(tp)|+αmax⋅hp+1N⋅IS,2≤(1+αmax⋅hp+1+(αmax⋅hp+1)2)⋅|Sh,p−S(tp)|+αmax⋅hp+1⋅|Ih,p−I(tp)|. | (3.40) |
2.2) We see that
|Ih,p+1−~Ih,p+1|=|(Ih,p−Ih,p⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅Sh,p+1N)1+βp+1⋅hp+1)−(I(tp)−I(tp)⋅(βp+1⋅hp+1−αp+1⋅hp+1⋅~Sh,p+1N)1+βp+1⋅hp+1)| | (3.41) |
holds and get
|Ih,p+1−~Ih,p+1|≤|Ih,p−I(tp)|+βmax⋅hp+1⋅|Ih,p−I(tp)|+αmax⋅hp+1N⋅|Ih,p⋅Sh,p+1−I(tp)⋅~Sh,p+1|≤|Ih,p−I(tp)|+βmax⋅hp+1⋅|Ih,p−I(tp)|+αmax⋅hp+1N⋅|Ih,p⋅Sh,p+1−I(tp)⋅Sh,p+1|+αmax⋅hp+1N⋅|I(tp)⋅Sh,p+1−I(tp)⋅~Sh,p+1|≤(1+hp+1⋅(αmax+βmax))⋅|Ih,p−I(tp)|+αmax⋅hp+1⋅|Sh,p+1−~Sh,p+1|. | (3.42) |
Plugging (3.40) into (3.42) yields
|Ih,p+1−~Ih,p+1|≤(1+hp+1⋅(αmax+βmax))⋅|Ih,p−I(tp)|+αmax⋅hp+1⋅{(1+αmax⋅hp+1+(αmax⋅hp+1)2)⋅|Sh,p−S(tp)|+αmax⋅hp+1⋅|Ih,p−I(tp)|}=(1+hp+1⋅(αmax+βmax)+α2max⋅h2p+1)⋅|Ih,p−I(tp)|+(αmax⋅hp+1+(αmax⋅hp+1)2+(αmax⋅hp+1)3)⋅|Sh,p−S(tp)|. | (3.43) |
2.3) We obtain
|Rh,p+1−~Rh,p+1|≤|Rh,p−R(tp)|+βmax⋅hp+1⋅|Ih,p+1−~Ih,p+1|(3.43)≤|Rh,p−R(tp)|+(βmax⋅hp+1+βmax⋅h2p+1⋅(αmax+βmax)+βmax⋅α2max⋅h3p+1)⋅|Ih,p−I(tp)|+(βmax⋅αmax⋅h2p+1+βmax⋅α2max⋅h3p+1+βmax⋅α3max⋅h4p+1)⋅|Sh,p−S(tp)| | (3.44) |
2.4) For our summary, we define
Bp+1:=max{|Sh,p+1−~Sh,p+1|,|Ih,p+1−~Ih,p+1|,|Rh,p+1−~Rh,p+1|} | (3.45) |
for all p∈{0,1,…,M−1} and
Dp:=max{|Sh,p−S(tp)|,|Ih,p−I(tp)|,|Rh,p−R(tp)|} | (3.46) |
for all p∈{1,…,M}. By (3.40), (3.43) and (3.44), we define the constants
CS,prop:=1+hp+1⋅2⋅αmax+h2p+1⋅α2max=1+hp+1⋅(2⋅αmax+hp+1⋅α2max)⏟=:~CS,prop;CI,prop:=1+hp+1⋅(2⋅(αmax+βmax)+2⋅α2max⋅hp+1+α3max⋅h2p+1)⏟=:~CI,prop;CR,prop:=1+hp+1⋅(βmax+2⋅βmax⋅(αmax+βmax)⋅hp+1+2⋅βmax⋅α2max⋅h2p+1+βmax⋅α3max⋅h3p+1)=:1+hp+1⋅~CR,prop |
and
Cprop:=max{~CS,prop,~CI,prop,~CR,prop}. | (3.47) |
Hence, it holds
Bp+1≤(1+hp+1⋅Cprop)⋅Dp. | (3.48) |
3) We obtain
Dp+1≤Bp+1+Ap+1≤(1+hp+1⋅Cprop)⋅Dp+Cloc⋅h2p+1≤(1+hp+1⋅Cprop)⋅((1+hp⋅Cprop)⋅Dp−1+Cloc⋅h2p)+Cloc⋅h2p+1 | (3.49) |
and inductively
Dp+1≤exp(Cprop⋅T)⋅D1+exp(Cprop⋅T)⋅Cloc⋅h⋅T | (3.50) |
which proves linear convergence of the time-discrete solution towards the time-continuous solution.
Our algorithm for our proposed non-standard finite-difference-method for (1.1) is portrayed in Algorithm 2 below.
Algorithm 2 Algorithmic summary for our proposed non-standard finite-difference-method (3.2) for (1.1) |
1: Inputs
2: Time vector (t1,…,tM)T∈RM 3: Time-varying transmission rates (α1,…,αM)T∈RM 4: Time-varying recovery rates (β1,…,βM)T∈RM 5: Initialize S:=0,I:=0,R:=0∈RM 6: Initial conditions S1:=S1, I1:=I1 and R1:=R1 7: Total population size N:=S1+I1+R1 8: Non-Standard Finite-Difference-Method 9: for j∈{1,…,M−1} do 10: hj+1:=tj+1−tj 11: Sj+1:=Sj1+hj+1⋅αj+1⋅IjN from (3.6) 12: Ij+1:=Ij+hj+1⋅αj+1⋅Sj+1⋅IjN1+hj+1⋅βj+1 from (3.7) 13: Rj+1:=Rj+hj+1⋅βj+1⋅Ij+1 from (3.8) 14: end for 15: Outputs 16: Calculated vectors S,I,R∈RM |
We consider the parameter identification problem (1.3) for all j∈{1,2,…,M−1} where we take the following assumptions into account:
(A21) The sequences {Sh,p}Mp=1, {Ih,p}Mp=1 and {Rh,p}Mp=1 are given;
(A22) It holds 0≤Sh,p≤N for all p∈{1,…,M} and the sequence {Sh,p}Mp=1 is monotonically decreasing;
(A23) It holds 0≤Ih,p≤N for all p∈{1,…,M};
(A24) It holds 0≤Rh,p≤N for all p∈{1,…,M} and the sequence {Rh,p}Mp=1 is monotonically increasing;
(A25) We assume Sh,p≠0, Ih,p≠0 and Rh,p≠0 for all p∈{1,…,M}.
Our idea now is to reduce (1.3) to
{Sh,p+1−Sh,php+1=−αp+1⋅Sh,p+1⋅Ih,pN;Rh,p+1−Rh,php+1=βp+1⋅Ih,p+1 | (4.1) |
for all p∈{1,…,M−1}. Hence, we obtain the sought time-varying transmission rate and the sought time-varying recovery rate by
{αp+1=NSh,p+1⋅Ih,p⋅(Sh,p−Sh,p+1)hp+1;βp+1=1Ih,p+1⋅(Rh,p+1−Rh,p)hp+1 | (4.2) |
for all p∈{1,…,M−1}. Finally, we have explicit formulas for the time-varying transmission and recovery rates at every time point which we can evaluate by the known data from the numbers of susceptible, infected and recovered people. We have the following theorem.
Theorem 7. Let all assumptions (A21)–(A25) be fulfilled. (4.1) for parameter identification is uniquely solvable for all p∈{1,…,M−1} and it holds αp+1≥0 and βp+1≥0 for all p∈{1,…,M−1}.
Proof. 1) Unique solvability is a direct consequence of (4.2).
2) {Sh,p}Mp=1 is monotonically decreasing. Hence, Sh,p−Sh,p+1≥0 for all p∈{1,…,M−1} and we have
αp+1=NSh,p+1⋅Ih,p⋅(Sh,p−Sh,p+1)hp+1≥0. |
3) {Rh,p}Mp=1 is monotonically increasing. Hence, Rh,p+1−Rh,p≥0 for all p∈{1,…,M−1} and we have
βp+1=1Ih,p+1⋅(Rh,p+1−Rh,p)hp+1≥0. |
This finishes our claim's proof.
Our algorithmic summary for our proposed parameter identification problem (4.2) reads:
Algorithm 3 Algorithmic summary for our proposed parameter identification algorithm for (4.2) |
1: Inputs
2: Time vector (t1,…,tM)T∈RM 3: Sequence of susceptible population {Sh,p}Mp=1 saved in one vector S∈RM 4: Sequence of infected population {Ih,p}Mp=1 saved in one vector I∈RM 5: Sequence of recovered population {Rh,p}Mp=1 saved in one vector R∈RM 6: Constant total population size N:=S1+I1+R1 7: Initialize vectors α:=0∈RM and β:=0∈RM 8: Parameter Identification Algorithm 9: for j∈{1,…,M−1} do 10: hj+1:=tj+1−tj 11: αj+1:=NSh,j+1⋅Ih,j⋅(Sh,j−Sh,j+1)hj+1 12: βj+1=1Ih,j+1⋅(Rh,j+1−Rh,j)hj+1 13: end for 14: Outputs 15: Calculated vectors α,β∈RM |
In this section, we want to strengthen our theoretical findings by two numerical examples. We apply GNU OCTAVE for our implementation [43].
The initial conditions for our first example read S(0)=5000, I(0)=5000, R(0)=0, N=10,000, α=0.5, β=0.1 and our simulation interval is given by [0,T] with T=70. We compare three numerical algorithms, namely our proposed non-standard finite-difference-method (NSFDM), the explicit Eulerian scheme (EE) and an explicit Runge-Kutta scheme with two stages (RK2) and use equidistant time step sizes h for our computations.
As it can be clearly seen in Figures 1 and 2, only our novel non-standard finite-difference-method is unconditionally non-negativity-preserving and stable. Both explicit standard time-discretizations suffer from time-step restrictions to obtain non-negativity preservation. In Figure 3, we observe that all three numerical algorithms possess same properties for smaller time step sizes h. On the positive side for all algorithms, they conserve total population size N as depicted in Figure 4.
Finally, underlining our convergence result from Theorem 6, we compare results of our non-standard finite-difference-method (NSFDM) for different time step sizes h with a fine scale Runge-Kutta scheme of order 4 (RK4) at T=70 where a fine time step size of 0.0001 is applied for (RK4). The errors
● Error for S(t): |SNSFDM,M−SRK4,M|;
● Error for I(t): |INSFDM,M−IRK4,M|;
● Error for R(t): |RNSFDM,M−RRK4,M|
are used for this purpose. It can be clearly seen from Table 1 that the theoretical convergence order is achieved by our non-standard finite-difference-method.
h | 0.03125 | 0.0625 | 0.125 | 0.25 | 0.5 | 1.0 |
Error for S(t) | 0.27673 | 0.55049 | 1.0889 | 2.1307 | 4.0817 | 7.5129 |
Error for I(t) | 0.14805 | 0.2971 | 0.59806 | 1.2115 | 2.4843 | 5.2145 |
Error for R(t) | 0.41436 | 0.83717 | 1.6766 | 3.3317 | 6.5556 | 12.717 |
We consider real-world data from Spain [44]. N=47,370,000 is the total population size of Spain. The cumulative cases of infected people are modified such
S(t)=N−I(t)−R(t);I(t)=Nconfirmed(t)−Ndead(t)−Nrecovered(t);R(t)=Ndead(t)+Nrecovered(t) |
hold from the given data. We take α(t)=0.52⋅e−0.03⋅t and β(t)=0.045. For our simulation, we additionally assume h=0.75 as an equidistant time step size.
Our estimated transmission rate α(t) and constant recovery rate β(t) are user-chosen and adapted to the data in Figures 6 and 7, while the modified data for infected and recovered people are depicted in Figure 5. We solely consider the beginning of the pandemic because, later, vaccines have been available and reinfections have occurred after virus modifications. In Figure 8, we see results of our numerical simulations with h=0.75. Results are relatively sensitive with respect to time step sizes and estimates rates, e.g., time-varying transmission rates. Hence, we can only conclude that good data acquisition and different predictions in different settings are crucial for future pandemics to make predictions for courses of such future epidemics.
In this article, we first summarized some analytical properties of a time-continuous epidemiological model (1.1) as given in [15]. Afterwards, we designed a new non-standard finite-difference-method (1.3) as a time-discrete version of the continuous model. In Section 3, we contributed our main results on our proposed non-standard finite-difference-method (1.3). Namely, we investigated unconditionally non-negativity preservation, conservation of total population size, convergence towards a disease-free equilibrium point and linear convergence by letting the time size h→0. Conclusively for our theoretical findings, we developped a simple parameter identification algorithm in Section (4). In Section 5, we gave two numerical examples to underline our theoretical findings. Comparing Algorithms 1 and 2, we conclude that the latter one is definitely easier to implement and it can serve as a starting point for constructing higher order time discretization schemes for (1.1). Regarding practical applications, our proposed time-discretization by a non-standard finite-difference-method preserves all desired properties from the time-continuous model which are expected from our real-word intuition. Additionally, the simple parameter identification algorithm produce fast graphs from given data where trends in time-varying transmission rates such as contact restrictions might be seen from.
There might be different directions to extend our work:
● It seems straightforward to integrate further compartments into our model such that we can additionally investigate influences such as, for example, vaccines or the simple extension to the SEIR model. For example, we readily can construct
{Sh,j+1−Sh,jhj+1=−αj+1⋅Sh,j+1⋅Eh,jN,Eh,j+1−Eh,jhj+1=αj+1⋅Sh,j+1⋅Eh,jN−γj+1⋅Eh,j+1,Ih,j+1−Ih,jhj+1=γj+1⋅Eh,j+1−βj+1⋅Ih,j+1,Rh,j+1−Rh,jhj+1=βj+1⋅Ih,j+1,Sh,1=S0,Eh,1=E0,Ih,1=I0,Rh,1=R0 | (6.1) |
as one variant of a non-standard finite-difference-method for the SEIR model and it follows directly that this scheme conserves total population size N and can be written in an explicit fashion as our proposed non-standard finite-difference-method for our considered SIR model by
{Sh,j+1=Sh,j1+hj+1⋅αj+1⋅Eh,jN,Eh,j+1=Eh,j+hj+1⋅αj+1⋅Sh,j+1⋅Eh,jN1+hj+1⋅γj+1,Ih,j+1=Ih,j+hj+1⋅γj+1⋅Eh,j+11+hj+1⋅βj+1,Rh,j+1=Rh,j+hj+1⋅βj+1⋅Ih,j+1 | (6.2) |
to see that it also preserves non-negativity assuming positive initial conditions. One disadvantage is that there are different possibilities to construct such non-standard finite-difference-methods by non-local approximations and a suitable choice depends on the time-continuous properties which should be transferred to the time-discrete case. However, as seen by this example, it is flexible to construct different possibilities of algorithms and they are easy to implement;
● It might be of interest to construct higher order non-standard finite-difference-methods from our first-order non-standard finite-difference-method in order to get higher accuracy although, especially, our second example demonstrated that predictions of such models need to be considered with care. One straightforward way to improve accuracy, and hence, the convergence order of numerical solution schemes is application of Richardson's extrapolation [45];
● One can use our discretization model for the discretization of optimal control problems for minimizing certain epidemic aspect such as eradication time [46].
Our code and used data from [44] can be found under https://github.com/bewa87/2023-SIR-FirstOrder-NSFDM.
We thank the editor and both anonymous reviewers for their valuable comments which definitely helped us to improve quality and readability of our manuscript.
The authors declare there is no conflict of interest.
[1] | James W (1890) Attention. The Principles of Psychology I: 427. 10.1037/10538-011 |
[2] |
Gabrieli JDE (1998) Cognitive neuroscience of human memory. An Rev Psychol 49: 87-115. doi: 10.1146/annurev.psych.49.1.87
![]() |
[3] |
Kapur S, Craik FIM, Tulving E, et al. (1994) Neuroanatomical correlates of encoding in episodic memory: levels of processing effect. Proc Natl Acad Sci 91: 2008-2011. doi: 10.1073/pnas.91.6.2008
![]() |
[4] |
Posner MI, Petersen SE, Fox PT, et al. (1988) Localization of cognitive operations in the human brain. Science 240: 1627-1631. DOI: 10.1126/science.3289116 doi: 10.1126/science.3289116
![]() |
[5] | Posner MI, Petersen SE (1990) The attention system of the human brain. An Rev Neurosci 13: 25-42. |
[6] |
Petersen SE, Posner MI (2012) The Attention system of the human brain: 20 years after. An Rev Neurosci 35: 73-89. doi:10.1146/annurev-neuro-062111-150525. doi: 10.1146/annurev-neuro-062111-150525
![]() |
[7] |
Squire LR (1986) Mechanisms of memory. Science 232: 1612-1619. doi:10.1126/science.3086978 doi: 10.1126/science.3086978
![]() |
[8] |
Squire LR (2004) Memory systems of the brain: A brief history and current perspective. Neurobio Learning Memory 82: 171-177. doi: 10.1016/j.nlm.2004.06.005
![]() |
[9] |
Squire LR, Zola-Morgan S (1991) The medial temporal love memory system. Science 253: 1380-1386. doi:10.1126/science.1896849. doi: 10.1126/science.1896849
![]() |
[10] |
Chun MM, Turk-Browne NB (2007) Interactions between attention and memory. Current Opinion Neurobio 17: 177-184. doi: 10.1016/j.conb.2007.03.005. doi: 10.1016/j.conb.2007.03.005
![]() |
[11] |
Badre D, Poldrack RA, Pare-Blagoev EJ, et al. (2005) Dissociable controlled retrieval and generalized selection mechanisms in ventrolateral prefrontal cortex. Neuron 47: 907-918. doi:10.1016/j.neuron.2005.07.023. doi: 10.1016/j.neuron.2005.07.023
![]() |
[12] |
Wagner AD, Shannon BJ, Kahn I, et al. (2005) Parietal lobe contributions to episodic memory retrieval. Trends Cogni Sci 9: 445-453. doi:10.1016/j.tics.2005.07.001 doi: 10.1016/j.tics.2005.07.001
![]() |
[13] |
Cohen JD, Perstein WM, Braver TS, et al. (1997) Temporal dynamics of brain activation during a working memory task. Nature 386: 604-608. doi: 10.1038/386604a0
![]() |
[14] |
Miller EK, Cohen JD (2001) An integrative theory of prefrontal function. An Rev Neurosci 24: 167-202. doi: 10.1146/annurev.neuro.24.1.167
![]() |
[15] | Baddeley A (1996) Exploring the central executive. Quarter J Experiment Psychol 49A: 5-28. |
[16] |
Braver TS (2012) The variable nature of cognitive control: A dual-mechanisms framework. Trends Cogn Sci 16: 106-113. doi: 10.1016/j.tics.2011.12.010
![]() |
[17] | Elliot R, Dolan RJ, Frith C (2000) Dissociable functions in the medial and lateral orbitofrontal cortex: Evidence from human neuroimaging studies. Cerebral Cortex 10: 308-317. |
[18] |
Jiang J, Egner T (2014) Using neural pattern classifiers to quantify the modularity of conflict-control mechanisms in the human brain. Cerebral Cortex 24: 1793-1805. doi: 10.1093/cercor/bht029
![]() |
[19] | Miller EK, Wallis JD (2009) Executive function and higher-order cognition: Definition and neural substrates. In L.R. Squire (ed.) Encyclopedia Neuroscience Vol. 4, pp 99-104. Oxford: Academic Press |
[20] |
Anderson MC, Spellman BA (1995) On the status of inhibitory mechanisms in cognition: Memory retrieval as a model case. Psychol Rev 102: 68-100. doi:10.1037/0033-295x.102.1.68. doi: 10.1037/0033-295X.102.1.68
![]() |
[21] |
Bissett PG, Nee DE, Jonides J (2009) Dissociating interference-control processes between memory and response. J Experiment Psychol Learning Memory Cognition 35: 1306-1316. DOI: 10.1037/a0016537. doi: 10.1037/a0016537
![]() |
[22] |
Nestor PG, Piech R, Allen C, et al. (2005) Retrieval-induced forgetting in schizophrenia. Schizophrenia Res 75: 199-209. doi: 10.1016/j.schres.2005.01.011
![]() |
[23] |
Depue BE, Curran T, Banich MT (2007) Prefrontal Regions Orchestrate Suppression of Emotional Memories via a Two-Phase Process. Science 317: 215-219. doi:10.1126/science.1139560. doi: 10.1126/science.1139560
![]() |
[24] |
Peters GJ, David CN, Marcus MD, et al. (2013) The medial prefrontal cortex is critical for memory retrieval and resolving interference. Learning Memory 20: 201-209 doi: 10.1101/lm.029249.112
![]() |
[25] |
Koechlin E, Hyafil A (2007) Anterior prefrontal function and the limits of human decision making. Science 318: 594-598. doi: 10.1126/science.1142995
![]() |
[26] | Nestor PG, Ohtani T, Bouix S, et al. (2015) Dissociating prefrontal circuitry in intelligence and memory: Neuropsychological correlates of magnetic resonance and diffusion tensor imaging. Brain Imaging Behavior 9: 839-847. doi: 10.1007/s11682-014-9344-6. |
[27] |
Ohtani T, Nestor PG, Bouix S, et al. (2014) Medial Frontal White and gray matter contributions to general intelligence. PLoS One 9: e112691. doi:10.137/journal.pone.0112691. doi: 10.1371/journal.pone.0112691
![]() |
[28] | Nestor PG, Ohtani, Levitt JJ, et al. (2015) Attentional control and intelligence: MRI orbital frontal gray matter and neuropsychological correlates. Behavior Neurology. http://dx.doi.org/10.1155/2015/354186 |
[29] | Heaton RK (1981) Wisconsin Card Sort Manual. Odessa: Psychological Assessment Resources. |
[30] | Arbuthnott K, Frank J (2000) Trail Making Test, Part B as a measure of executive control: Validation using a set-switching paradigm. J Clin Experiment Neuropsychol 22: 518-528. |
[31] | Baddeley AD, Emslie H, Nimmo-Smith I (1994) Doors and People: A test of visual and verbal recall and recognition. Flempton, Bury St. Edmunds: Thames Valley Test Company. |
[32] | Buschman TJ, Miller EK (2014) Goal-direction and top-down control. Phil Trans R Soc B 369. doi:10.1098/rstb.2013.0471. |
[33] |
Mansouri FA, Matsumoto K, Tanaka K (2006) Prefrontal cell activities related to monkeys’ success and failure in adapting to rule changes in a Wisconsin Card Sorting Test analog. J Neurosci 26: 2745-2756. doi: 10.1523/JNEUROSCI.5238-05.2006
![]() |
[34] |
Nestor PG, Kubicki M, Niznikiewicz M, et al. (2008) Neuropsychological disturbance in schizophrenia: A diffusion tensor imaging study. Neuropsychology 22: 246-254. doi: 10.1037/0894-4105.22.2.246
![]() |
[35] | Manns JR, Squire LR (1999) Impaired recognition memory on the Doors and People Test after damage limited to the hippocampal region. Hippocampus 9: 495-499. |
[36] |
Vargha-Khadem F, Gadian DG, Watkins KE, et al. (1997) Differential effects of early hippocampal pathology on episodic and semantic Memory. Science 277: 376-380. doi:10.1126/science.277.5324.376 doi: 10.1126/science.277.5324.376
![]() |
[37] | Douaud G, Groves AR, Tamnes CK, et al. (2014) A common brain network links development, aging, and vulnerability to disease. PNAS 111: 17649-17653. |
[38] |
Miller EK, Fusi S (2013) Limber neurons for a nimble mind. Neuron 78: 211-213. doi:10.1016/j.neuron.2013.04.007. doi: 10.1016/j.neuron.2013.04.007
![]() |
[39] |
Rigotti M, Barak O, Warden MR, et al. (2013) The importance of mixed selectivity in complex cognitive tasks. Nature 497: 585-590. doi:10.1038/nature12160. doi: 10.1038/nature12160
![]() |
[40] |
Nestor PG, Nakamura M, Niznikiewicz M, et al. (2013) In search of the functional neuroanatomy of sociality: MRI subdivisions of orbital frontal cortex and social cognition. Soc Cogn Affective Neurosci 8: 460-467. doi:10.1039/scan/nss018 doi: 10.1093/scan/nss018
![]() |
[41] | Michael B, Spitzer, Robert L, et al. (2002) Structured Clinical Interview for DSM-IV-TR Axis I Disorders, Research Version, Non-patient Edition. (SCID-I/NP) New York: Biometrics Research, New York State Psychiatric Institute, November. |
[42] | First MB, Gibbon M, Spitzer RL, et al. (1997) Structured Clinical Interview for DSM-IV Axis II Personality Disorders, (SCID-II). Washington, D.C.: American Psychiatric Press, Inc. |
[43] |
Bouix S, Martin-Femandez M, Ungar L, et al. (2007) On evaluating brain tissue classifiers without a ground truth. NeuroImage 36: 1207-1224. doi: 10.1016/j.neuroimage.2007.04.031
![]() |
[44] |
Pohl K, Fisher J, Bouix S, et al. (2007) Using the logarithm of odds to define a vector space on probabilistic atlases. Med Image Analysis 11: 465-477. doi: 10.1016/j.media.2007.06.003
![]() |
[45] | Cohen J, Cohen P (1975) Applied multiple regression/correlation analysis of the behavioral sciences (2nd ed.). Hillsdale, NJ: Lawrence Erlbaum Associates. |
[46] |
Cabeza R, Locantore JK, Anderson ND (2003) Lateralization of prefrontal activity during episodic memory retrieval: evidence for the production monitoring hypothesis. J Cogn Neurosci 15: 249-259. doi: 10.1162/089892903321208187
![]() |
[47] |
Reed JM, Squire LR (1997) Impaired recognition memory in patients with lesions limited to the hippocampal formation. Behavior Neurosci 111: 667-675. doi: 10.1037/0735-7044.111.4.667
![]() |
[48] |
Hwang K, Ghuman AS, Manoach DS, et al. (2014) Cortical neurodynamics of inhibitory control. J Neurosci 34: 9551-9561. doi: 10.1523/JNEUROSCI.4889-13.2014
![]() |
[49] |
Simon JS, Spiers HJ (2003) Prefrontal and medial temporal lobe interactions in long term memory. Nat Rev Neurosci 4: 637-648. doi: 10.1038/nrn1178
![]() |
[50] |
Nestor PG, Kubicki M, Kuroki N, et al. (2007) Episodic memory and neuroimaging of hippocampus and fornix in chronic schizophrenia. Psychiatry Res Neuroimaging 155: 21-28 doi: 10.1016/j.pscychresns.2006.12.020
![]() |
[51] |
Miller EK (2000) The prefrontal cortex and cognitive control. Nat Rev Neurosci 1: 59-65. doi: 10.1038/35036228
![]() |
[52] |
Shaw P, Greenstein D, Lerch J, et al. (2006) Intellectual ability and cortical development in children and adolescents. Nature 440: 676-679. doi: 10.1038/nature04513
![]() |
[53] |
Jung RE, Haier RJ (2007) The parieto-frontal integration theory (P-FIT): converging neuroimaging evidence. Behavior Brain Sci 30: 135-154. doi: 10.1017/S0140525X07001185
![]() |
[54] |
Kane MJ, Bleckley MK, Conway ARA, et al. (2001) A controlled attention view of working memory capacity. J Experiment Psychol General 130: 169-183. doi: 10.1037/0096-3445.130.2.169
![]() |
1. | Hai-yang Xu, Heng-you Lan, Fan Zhang, General semi-implicit approximations with errors for common fixed points of nonexpansive-type operators and applications to Stampacchia variational inequality, 2022, 41, 2238-3603, 10.1007/s40314-022-01890-7 | |
2. | Yan Wang, Rui Wu, Shanshan Gao, The Existence Theorems of Fractional Differential Equation and Fractional Differential Inclusion with Affine Periodic Boundary Value Conditions, 2023, 15, 2073-8994, 526, 10.3390/sym15020526 | |
3. | Sumati Kumari Panda, Thabet Abdeljawad, Fahd Jarad, Chaotic attractors and fixed point methods in piecewise fractional derivatives and multi-term fractional delay differential equations, 2023, 46, 22113797, 106313, 10.1016/j.rinp.2023.106313 | |
4. | Philip N. A. Akuka, Baba Seidu, C. S. Bornaa, Marko Gosak, Mathematical Analysis of COVID-19 Transmission Dynamics Model in Ghana with Double-Dose Vaccination and Quarantine, 2022, 2022, 1748-6718, 1, 10.1155/2022/7493087 | |
5. | SUMATI KUMARI PANDA, ABDON ATANGANA, THABET ABDELJAWAD, EXISTENCE RESULTS AND NUMERICAL STUDY ON NOVEL CORONAVIRUS 2019-NCOV/ SARS-COV-2 MODEL USING DIFFERENTIAL OPERATORS BASED ON THE GENERALIZED MITTAG-LEFFLER KERNEL AND FIXED POINTS, 2022, 30, 0218-348X, 10.1142/S0218348X22402149 | |
6. | Tahair Rasham, Separate families of fuzzy dominated nonlinear operators with applications, 2024, 70, 1598-5865, 4271, 10.1007/s12190-024-02133-0 | |
7. | Sumati Kumari Panda, Thabet Abdeljawad, A. M. Nagy, On uniform stability and numerical simulations of complex valued neural networks involving generalized Caputo fractional order, 2024, 14, 2045-2322, 10.1038/s41598-024-53670-4 | |
8. | Sumati Kumari Panda, Kumara Swamy Kalla, A.M. Nagy, Limmaka Priyanka, Numerical simulations and complex valued fractional order neural networks via (ɛ – μ)-uniformly contractive mappings, 2023, 173, 09600779, 113738, 10.1016/j.chaos.2023.113738 | |
9. | Hammed Anuoluwapo Abass, Maggie Aphane, Morufu Oyedunsi Olayiwola, An inertial method for solving systems of generalized mixed equilibrium and fixed point problems in reflexive Banach spaces, 2023, 16, 1793-5571, 10.1142/S1793557123502078 | |
10. | Yassine Adjabi, Fahd Jarad, Mokhtar Bouloudene, Sumati Kumari Panda, Revisiting generalized Caputo derivatives in the context of two-point boundary value problems with the p-Laplacian operator at resonance, 2023, 2023, 1687-2770, 10.1186/s13661-023-01751-0 | |
11. | Nihar Kumar Mahato, Bodigiri Sai Gopinadh, , 2024, Chapter 15, 978-981-99-9545-5, 339, 10.1007/978-981-99-9546-2_15 | |
12. | Sumati Kumari Panda, Velusamy Vijayakumar, Bodigiri Sai Gopinadh, Fahd Jarad, 2024, Chapter 6, 978-981-99-9545-5, 177, 10.1007/978-981-99-9546-2_6 | |
13. | Sumati Kumari Panda, Ilyas Khan, Vijayakumar Velusamy, Shafiullah Niazai, Enhancing automic and optimal control systems through graphical structures, 2024, 14, 2045-2322, 10.1038/s41598-024-53244-4 | |
14. | P K Santra, G S Mahapatra, Sanjoy Basu, Stability analysis of fractional epidemic model for two infected classes incorporating hospitalization impact, 2024, 99, 0031-8949, 065237, 10.1088/1402-4896/ad4692 | |
15. | Anupam Das, Bipan Hazarika, Mohsen Rabbani, 2024, Chapter 10, 978-981-99-9206-5, 165, 10.1007/978-981-99-9207-2_10 | |
16. | Tahair Rasham, Sumati Kumari Panda, Ghada Ali Basendwah, Aftab Hussain, Multivalued nonlinear dominated mappings on a closed ball and associated numerical illustrations with applications to nonlinear integral and fractional operators, 2024, 10, 24058440, e34078, 10.1016/j.heliyon.2024.e34078 | |
17. | Sumati Kumari Panda, Velusamy Vijayakumar, Kottakkaran Sooppy Nisar, Applying periodic and anti-periodic boundary conditions in existence results of fractional differential equations via nonlinear contractive mappings, 2023, 2023, 1687-2770, 10.1186/s13661-023-01778-3 | |
18. | Sumati Kumari Panda, Kottakkaran Sooppy Nisar, Velusamy Vijayakumar, Bipan Hazarika, Solving existence results in multi-term fractional differential equations via fixed points, 2023, 51, 22113797, 106612, 10.1016/j.rinp.2023.106612 | |
19. | Sumati Kumari Panda, Velusamy Vijayakumar, Results on finite time stability of various fractional order systems, 2023, 174, 09600779, 113906, 10.1016/j.chaos.2023.113906 | |
20. | Sumati Kumari Panda, A.M. Nagy, Velusamy Vijayakumar, Bipan Hazarika, Stability analysis for complex-valued neural networks with fractional order, 2023, 175, 09600779, 114045, 10.1016/j.chaos.2023.114045 | |
21. | Mokhtar Bouloudene, Fahd Jarad, Yassine Adjabi, Sumati Kumari Panda, Quasilinear Coupled System in the Frame of Nonsingular ABC-Derivatives with p-Laplacian Operator at Resonance, 2024, 23, 1575-5460, 10.1007/s12346-023-00902-z | |
22. | Sumati Kumari Panda, Vijayakumar Velusamy, Ilyas Khan, Shafiullah Niazai, Computation and convergence of fixed-point with an RLC-electric circuit model in an extended b-suprametric space, 2024, 14, 2045-2322, 10.1038/s41598-024-59859-x |
h | 0.03125 | 0.0625 | 0.125 | 0.25 | 0.5 | 1.0 |
Error for S(t) | 0.27673 | 0.55049 | 1.0889 | 2.1307 | 4.0817 | 7.5129 |
Error for I(t) | 0.14805 | 0.2971 | 0.59806 | 1.2115 | 2.4843 | 5.2145 |
Error for R(t) | 0.41436 | 0.83717 | 1.6766 | 3.3317 | 6.5556 | 12.717 |