This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Efficient relaxation scheme for the SIR and related compartmental models

Vo Anh Khoa Department of Mathematics, Florida A&M University, Tallahassee, FL 32307, USA [email protected], [email protected]    Pham Minh Quan Department of Computer Science, Florida State University, Tallahassee, FL 32306, USA    Ja’Niyah Allen Department of Mathematics, Florida A&M University, Tallahassee, FL 32307, USA    Kbenesh W. Blayneh Department of Mathematics, Florida A&M University, Tallahassee, FL 32307, USA
Abstract

In this paper, we introduce a novel numerical approach for approximating the SIR model in epidemiology. Our method enhances the existing linearization procedure by incorporating a suitable relaxation term to tackle the transcendental equation of nonlinear type. Developed within the continuous framework, our relaxation method is explicit and easy to implement, relying on a sequence of linear differential equations. This approach yields accurate approximations in both discrete and analytical forms. Through rigorous analysis, we prove that, with an appropriate choice of the relaxation parameter, our numerical scheme is non-negativity-preserving and globally strongly convergent towards the true solution. These theoretical findings have not received sufficient attention in various existing SIR solvers. We also extend the applicability of our relaxation method to handle some variations of the traditional SIR model. Finally, we present numerical examples using simulated data to demonstrate the effectiveness of our proposed method.

SIR models, relaxation, global convergence, infectious diseases

I Introduction

In recent years, the world has witnessed the devastating impact of infectious diseases on a global scale. From the rapid spread of COVID-19 to the resurgence of long-standing ailments like measles and influenza, understanding the dynamics of epidemics has become crucial for protecting public health. To gain a deeper understanding of these intricate phenomena, scientists have increasingly relied on mathematical modeling as an influential tool for unraveling the complex mechanisms governing disease transmission. Among the various models, the Susceptible-Infectious-Recovered (SIR) model has emerged as a fundamental framework, providing valuable insights into epidemic dynamics; cf. e.g. [7, 11, 15] for its applications to modeling the influenza, Ebola and COVID-19.

The SIR model, initially proposed in the early 20th century by Kermack and McKendrick [10], has since been refined and adapted to address contemporary challenges. This model effectively captures the fundamental dynamics of epidemics by dividing a population into three distinct compartments: susceptible individuals, infectious individuals, and removed individuals. By considering the interactions between these compartments, the SIR model takes into account various factors such as transmission rates, removal rates, and the depletion of susceptible individuals over time. The “removals” in this context encompass individuals who are isolated, deceased, or have recovered and gained immunity. Additionally, the model assumes that individuals who have gained immunity or recovered enter a new category that is not susceptible to the disease.

Consider a homogeneously mixed group of individuals of total size N1N\gg 1. Let t(0,T)t\in\left(0,T\right) be the time variable with T>0T>0 being the final time of observations. We take into account the following functions:

S(t)\displaystyle S\left(t\right) =number of susceptibles at time t,\displaystyle=\text{number of susceptibles at time }t,
I(t)\displaystyle I\left(t\right) =number of infectives at time t,\displaystyle=\text{number of infectives at time }t,
R(t)\displaystyle R\left(t\right) =number of removals at time t.\displaystyle=\text{number of removals at time }t.

Initiated, again, by Kermack and McKendrick in 1927 [10], the evolutionary dynamics of these individuals can be modeled through the following system of ordinary differential equations (ODEs):

{I(t)=βS(t)I(t)γI(t),S(t)=βS(t)I(t),R(t)=γI(t).\begin{cases}I^{\prime}\left(t\right)=\beta S\left(t\right)I\left(t\right)-\gamma I\left(t\right),\\ S^{\prime}\left(t\right)=-\beta S\left(t\right)I\left(t\right),\\ R^{\prime}\left(t\right)=\gamma I\left(t\right).\end{cases} (I.1)

Here, the following assumptions are considered.

(A1) The total population size is always N>0N>0, meaning that S(t)+I(t)+R(t)=NS\left(t\right)+I\left(t\right)+R\left(t\right)=N for all tt.

(A2) We know the infection rate β>0\beta>0 from the infection process, and the removal rate γ>0\gamma>0 from the removal process.

(A3) The initial conditions are S(0)=n>1S\left(0\right)=n>1, I(0)=a1I\left(0\right)=a\geq 1 and R(0)=0R\left(0\right)=0.

The explicit solution of the SIR model, despite its basic structure, is widely known to be unattainable due to the exponential nonlinearity of the transcendental equation governing removals. Consequently, numerous numerical methods have been proposed to address this fundamental model. The Taylor expansion method, initially employed by Kermack and McKendrick in 1927, approximates the exponential term, leading to an approximate analytic solution. This technique was utilized to simulate the plague epidemic of 1905-1906 in Bombay, India, and has since become a tutorial resource for students at both undergraduate and graduate levels; cf. [4].

Over the years, many different methods have been studied to solve the SIR model. Piyawong et al. [20] introduced an unconditionally convergent scheme that captures the long-term behavior of the SIR model, offering improved numerical stability compared to conventional explicit finite difference methods. Mickens [18] and, recently, Conte et al. [6] proposed and analyzed stable nonstandard finite difference methods that effectively preserve the positivity of the SIR solutions. Semi-analytical methods, such as the Adomian decomposition approach [17], have also been proposed, alongside other methods cited therein, to derive approximate analytical solutions. Additionally, the solutions of the SIR model can be expressed in terms of the Lambert function, as demonstrated in the publications by [2, 21]. Furthermore, an alternative approach involving parametric analysis has been employed to obtain analytical solutions; see e.g. [9]. While most of these approaches are local approximations, a recent global semi-analytical approach utilizing the Padé approximation has been presented in [5].

While the above-mentioned approximation methods have demonstrated numerical effectiveness, their convergence theories have received limited investigation. Some publications discussing discrete methods focus solely on stability analysis, leaving the global convergence analysis unexplored. In this study, we propose a novel numerical approach that guarantees global convergence. Our approach employs a relaxation procedure, derived from the conventional linearization technique, to approximate the SIR model in a continuous setting. Unlike the classical version, our modified procedure introduces a relaxation term. In the existing literature on partial differential equations (e.g., [13, 14, 19, 25] and references cited therein), this relaxation term mitigates the local convergence issues encountered by conventional linearization techniques such as Newton’s method. Consequently, it permits to choose an arbitrary starting point while guaranteeing the global convergence. Within our specific context, the relaxation term facilitates capturing the non-negativity of solutions while preserving global convergence. In addition, by relying only on the dependence of the relaxation constant on the removal rate, our approach accurately captures the long-term behavior of the system. Besides, our explicit and easy-to-implement approximate scheme is governed by a sequence of linear differential equations. The desired approximate solution can be obtained discretely or analytically based on individual preference.

Our paper is four-fold. In section II, we begin by revisiting the transcendental equation for removals and discussing the essential properties of the SIR model. The latter part of this section focuses on introducing the proposed relaxation scheme and establishing its theoretical foundations. We prove that this scheme is globally strongly convergent and preserves non-negativity. Additionally, we derive an error estimate in C0C^{0}. In section III, we extend the applicability of our proposed scheme to some variants of the SIR model. Then, to validate the effectiveness of our method, numerical examples are presented in Section IV. Finally, we provide some concluding remarks in section V, and the appendix contains the proofs of our central theorems.

II Relaxation procedure

II.1 Transcendental equation revisited

It is well known that the SIR model can be solved from a transcendental differential equation. Here, we revisit how to get such an equation to complete our analysis of the proposed scheme below. Let μ=β/γ\mu=\beta/\gamma be the reciprocal relative removal rate. By the second and third equations of system (I.1), we have

dSdR=μS,\frac{dS}{dR}=-\mu S,

which leads to ln(S)=μR+c\ln\left(S\right)=-\mu R+c. Therefore, we arrive at

S(t)=ecμR(t).S\left(t\right)=e^{c-\mu R\left(t\right)}. (II.1)

To find cc, we set t=0t=0 in (II.1) and use (A3). Indeed, by n=S(0)=ecμR(0)=ecn=S\left(0\right)=e^{c-\mu R\left(0\right)}=e^{c}, we get c=ln(n)c=\ln\left(n\right) and thus, deduce that

S(t)=neμR(t).S\left(t\right)=ne^{-\mu R\left(t\right)}. (II.2)

Combining this and (A1), we derive the following nonlinear differential equation for R(t)R\left(t\right):

R(t)=γ(NneμR(t)R(t)).R^{\prime}\left(t\right)=\gamma\left(N-ne^{-\mu R\left(t\right)}-R\left(t\right)\right). (II.3)
Remark.

To this end, the notation CmC^{m} is used to denote the space of functions with mm continuous derivatives. For the particular C0C^{0} space, it is the space of continuous functions on [0,T]\left[0,T\right] with the standard max norm.

Theorem 1.

The differential equation (II.3) admits a unique C1C^{1} non-negative solution R(t)R\left(t\right). Moreover, the existence and uniqueness in C1C^{1} of positive S(t)S\left(t\right) and I(t)I\left(t\right) to the SIR system (I.1) follow.

Proof.

The positivity of S(t)S\left(t\right) and I(t)I\left(t\right) is guaranteed by the first and second equations of system (I.1), i.e.

S(t)\displaystyle S\left(t\right) =nexp(β0tI(s)𝑑s),\displaystyle=n\exp\left(-\beta\int_{0}^{t}I\left(s\right)ds\right),
I(t)\displaystyle I\left(t\right) =aexp(0t(βS(s)γ)𝑑s).\displaystyle=a\exp\left(\int_{0}^{t}\left(\beta S\left(s\right)-\gamma\right)ds\right).

Then, by the third equation of (I.1), the non-negativity of R(t)R\left(t\right) follows.

Cf. [24, Theorem 3.2], since the right hand side of (II.3) is globally Lipschitzian, the equation admits a unique local C1C^{1} solution. Moreover, in view of the fact that |γ(NneμR(t)R(t))|γ|R(t)|+γ(N+n)\left|\gamma\left(N-ne^{-\mu R\left(t\right)}-R\left(t\right)\right)\right|\leq\gamma\left|R\left(t\right)\right|+\gamma\left(N+n\right) for any t0t\geq 0, the obtained solution is global as a by-product of [24, Theorem 3.9]. Observe that the right hand side of (II.2) is decreasing in the argument of R(t)R\left(t\right). Thereby, the existence and uniqueness of S(t)S\left(t\right) follows. We also get the existence and uniqueness of I(t)I\left(t\right) in view of the fact that the total population is conserved; cf. (A1).

Hence, we complete the proof of the theorem. ∎

Observe that if one can approximate R(t)R\left(t\right) well in (II.3), then S(t)S\left(t\right) and I(t)I\left(t\right) will be well approximated via (II.2) and (I.1), respectively. Define g(r)=γneμr+γrg\left(r\right)=\gamma ne^{-\mu r}+\gamma r for rr\in\mathbb{R}. We can rewrite (II.3) as

R(t)=γNg(R(t)).R^{\prime}\left(t\right)=\gamma N-g\left(R\left(t\right)\right).
Remark.

By the first and second equations of the SIR system (I.1), we get

dIdS=1+1μS.\frac{dI}{dS}=-1+\frac{1}{\mu S}.

Therefore, using S(0)=nS\left(0\right)=n and I(0)=aI\left(0\right)=a, we find that I(t)a=S(t)+n+1μln(S(t))1μln(n)I\left(t\right)-a=-S\left(t\right)+n+\frac{1}{\mu}\ln\left(S\left(t\right)\right)-\frac{1}{\mu}\ln\left(n\right). Equivalently, we deduce that

I(t)=1μln(S(t))S(t)+a+n1μln(n).I\left(t\right)=\frac{1}{\mu}\ln\left(S\left(t\right)\right)-S\left(t\right)+a+n-\frac{1}{\mu}\ln\left(n\right).

Since function f(S)=1μln(S)Sf\left(S\right)=\frac{1}{\mu}\ln\left(S\right)-S for S>0S>0 attains its maximum at S=μ1S=\mu^{-1}, we can estimate the so-called amplitude, which is the maximum value of II, in the following manner.

Imax=1μln(μ)1μ+a+n1μln(n).I_{\max}=-\frac{1}{\mu}\ln\left(\mu\right)-\frac{1}{\mu}+a+n-\frac{1}{\mu}\ln\left(n\right). (II.4)

II.2 Derivation and analysis of the numerical scheme

Let {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} be a time-dependent sequence satisfying, for k=1,2,3,k=1,2,3,\ldots,

Rk(t)+MRk(t)=γNg(Rk1(t))+MRk1(t).R_{k}^{\prime}\left(t\right)+MR_{k}\left(t\right)=\gamma N-g\left(R_{k-1}\left(t\right)\right)+MR_{k-1}\left(t\right). (II.5)

The sequence {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} aims to approximate R(t)R\left(t\right) in (II.3) in the sense that RkR_{k} will be close to RR as kk\to\infty uniformly in time. The accompanying initial condition for equation (II.5) is Rk(0)=0R_{k}\left(0\right)=0 for any k0k\geq 0. Since our approximate model performs as an iterative scheme, we need a starting point, R0(t)R_{0}\left(t\right). Here, we choose R0(t)=0R_{0}\left(t\right)=0 based on the initial condition of R(t)R\left(t\right) (cf. (A3)), which is the best information given to the sought R(t)R\left(t\right).

Also, in (II.5), we introduce a kk-independent constant Mγ>0M\geq\gamma>0 for the so-called relaxation process. This relaxation term plays a very important role. It allows us to prove the non-negativity of the relaxation scheme, while many numerical approaches, including the regular linearization method, do not have or cannot prove this feature. Herewith, the regular linearization method we meant is the scheme {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} in (II.5) with either M=0M=0 or only the exponential term in g(r)g\left(r\right) being linearized.

Formulated below is the theorem showing that the scheme {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} preserves the non-negativity of the removals over the relaxation process.

Theorem 2.

The sequence {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} is a non-negativity-preserving scheme. Moreover, it holds true that for all MγM\geq\gamma,

0g(Rk)γn+MRkfor any k0and t0.0\leq g\left(R_{k}\right)\leq\gamma n+MR_{k}\quad\text{for any }k\geq 0\;\text{and }t\geq 0.
Proof.

We prove this theorem by induction. The statement holds true for k=1k=1. Indeed, since R0(t)=0R_{0}\left(t\right)=0, the equation for R1(t)R_{1}\left(t\right) reads as

R1(t)+MR1(t)=γNγn0.R_{1}^{\prime}\left(t\right)+MR_{1}\left(t\right)=\gamma N-\gamma n\geq 0.

Therefore, we get

R1(t)\displaystyle R_{1}\left(t\right) =γ(Nn)M(1eMt)0,\displaystyle=\frac{\gamma\left(N-n\right)}{M}\left(1-e^{-Mt}\right)\geq 0,
g(R1)\displaystyle g\left(R_{1}\right) =γneμR1(t)+γR1(t)γn+MR1(t).\displaystyle=\gamma ne^{-\mu R_{1}\left(t\right)}+\gamma R_{1}\left(t\right)\leq\gamma n+MR_{1}\left(t\right).

Next, assume that the statement holds true for k=k0k=k_{0}. We prove that it also holds true for k=k0+1k=k_{0}+1. By (II.5), we have

Rk0+1(t)\displaystyle R_{k_{0}+1}^{\prime}\left(t\right) +MRk0+1(t)\displaystyle+MR_{k_{0}+1}\left(t\right)
=γNg(Rk0(t))+MRk0(t)0.\displaystyle=\gamma N-g\left(R_{k_{0}}\left(t\right)\right)+MR_{k_{0}}\left(t\right)\geq 0.

Thus, we obtain Rk0+1(t)eMtRk0+1(0)0.R_{k_{0}+1}\left(t\right)\geq e^{-Mt}R_{k_{0}+1}\left(0\right)\geq 0. As a by product, we can estimate that

g(Rk0+1)\displaystyle g\left(R_{k_{0}+1}\right) =γneμRk0+1(t)+γRk0+1(t)\displaystyle=\gamma ne^{-\mu R_{k_{0}+1}\left(t\right)}+\gamma R_{k_{0}+1}\left(t\right)
γn+MRk0+1(t).\displaystyle\leq\gamma n+MR_{k_{0}+1}\left(t\right).

Hence, we complete the proof of the theorem. ∎

In the following, we formulate the strong convergence result for the scheme {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty}. For ease of presentation, proof of this result is deliberately placed in the Appendix. It is worth mentioning that proof of the strong convergence of the scheme relies so much on the strict estimation of gg^{\prime}. Such an estimation can merely be obtained by the aid of the non-negativity of the scheme.

Theorem 3.

The sequence {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} defined in (II.5) is strongly convergent in C0C^{0} toward the true solution R(t)R\left(t\right) to Equation (II.3). In particular, we can find a number C=C(T,M,γ,n,μ)>0C=C\left(T,M,\gamma,n,\mu\right)>0 independent of kk such that the following error estimate holds true:

max0tT|Rk(t)R(t)|2Ckk!max0tT|R(t)|2.\max_{0\leq t\leq T}\left|R_{k}\left(t\right)-R\left(t\right)\right|^{2}\leq\frac{C^{k}}{k!}\max_{0\leq t\leq T}\left|R\left(t\right)\right|^{2}.

Our theoretical finding below shows that when nμ<1n\mu<1, the scheme {Rk(t)}k=0\left\{R_{k}\left(t\right)\right\}_{k=0}^{\infty} converges faster than the case nμ1n\mu\geq 1. The proof of the following corollary is also found in the Appendix.

Corollary 4.

Assume that nμ<1n\mu<1. We can find a constant c(0,1)c\in\left(0,1\right) independent of kk such that the following error estimate holds true:

max0tT|Rk(t)R(t)|ckmax0tT|R(t)|.\max_{0\leq t\leq T}\left|R_{k}\left(t\right)-R\left(t\right)\right|\leq c^{k}\max_{0\leq t\leq T}\left|R\left(t\right)\right|. (II.6)

As readily expected, for every step kk, we obtain a non-homogeneous differential equation that can be effectively approximated in the discrete framework. Mimicking the proof of Theorem II.3 and using Theorem 2, we have

Rk(t)+MRk(t)γNγn+(Mγ)Rk1(t),R_{k}^{\prime}\left(t\right)+MR_{k}\left(t\right)\leq\gamma N-\gamma n+\left(M-\gamma\right)R_{k-1}\left(t\right), (II.7)

leading to

Rk(t)\displaystyle R_{k}\left(t\right) eMt0teMs(γa+(Mγ)Rk1(s))𝑑s\displaystyle\leq e^{-Mt}\int_{0}^{t}e^{Ms}\left(\gamma a+\left(M-\gamma\right)R_{k-1}\left(s\right)\right)ds
tγa+(Mγ)0tRk1(s)𝑑s.\displaystyle\leq t\gamma a+\left(M-\gamma\right)\int_{0}^{t}R_{k-1}\left(s\right)ds.

By induction and by the choice R0(t)=0R_{0}\left(t\right)=0, we can show that

|Rk(t)|γai=1k(Mγ)i1tii!.\left|R_{k}\left(t\right)\right|\leq\gamma a\sum_{i=1}^{k}\left(M-\gamma\right)^{i-1}\frac{t^{i}}{i!}.

Therefore, if we choose γMγ+1T\gamma\leq M\leq\gamma+\frac{1}{T}, then |Rk(t)|Tγa(e1)\left|R_{k}\left(t\right)\right|\leq T\gamma a\left(e-1\right). Note that this bound is independent of kk. Thus, by Theorem 1, we get RkC1R_{k}\in C^{1} for any kk with, cf. (II.7), Theorem 2 and the choice Mγ+1TM\leq\gamma+\frac{1}{T},

|Rk(t)|γa+(Mγ)Tγa(e1)γae.\left|R_{k}^{\prime}\left(t\right)\right|\leq\gamma a+\left(M-\gamma\right)T\gamma a\left(e-1\right)\leq\gamma ae.

Furthermore, by differentiating both sides of (II.5) with respect to time, we can demonstrate that RkC2R_{k}\in C^{2} for any kk. Indeed,

Rk′′(t)\displaystyle R_{k}^{\prime\prime}\left(t\right) +MRk(t)\displaystyle+MR_{k}^{\prime}\left(t\right)
=(Mγ+γnμeμRk1(t))Rk1(t)\displaystyle=\left(M-\gamma+\gamma n\mu e^{-\mu R_{k-1}\left(t\right)}\right)R_{k-1}^{\prime}\left(t\right)
(Mγ+γnμ)|Rk1(t)|.\displaystyle\leq\left(M-\gamma+\gamma n\mu\right)\left|R_{k-1}^{\prime}\left(t\right)\right|.

This yields that |Rk′′(t)|2Mγ+γnμ\left|R_{k}^{\prime\prime}\left(t\right)\right|\leq 2M-\gamma+\gamma n\mu, which is a kk-independent upper bound. This ensures the Euler method’s global error by leveraging its existing convergence theory. For completeness, we present below the discrete solution to our proposed scheme.

Consider the time increment Δt=T/P\Delta t=T/P for P2P\geq 2 being a fixed integer. Then, we set the mesh-point in time by tp=pΔtt_{p}=p\Delta t for 0pP0\leq p\leq P. We seek RkpRk(tp)R_{k}^{p}\approx R_{k}\left(t_{p}\right) as a discrete solution to equation (II.5). By the standard Euler method, RkpR_{k}^{p} is determined by the following equation:

Rkp\displaystyle R_{k}^{p} +ΔtMRkp\displaystyle+\Delta tMR_{k}^{p}
=Rkp1+Δt(γNg(Rk1p)+MRk1p).\displaystyle=R_{k}^{p-1}+\Delta t\left(\gamma N-g\left(R_{k-1}^{p}\right)+MR_{k-1}^{p}\right). (II.8)

By this way, the global error of the Euler method is attained in the sense that for every kk, there exists a constant C~>0\tilde{C}>0 such that

max0pP|RkpRk(tp)|C~Δt.\max_{0\leq p\leq P}\left|R_{k}^{p}-R_{k}\left(t_{p}\right)\right|\leq\tilde{C}\Delta t.

We accentuate that by the above analysis of RkR_{k}, i.e. RkC2R_{k}\in C^{2} for any kk, the constant C~\tilde{C} is independent of kk. Thus, by Theorem 3, we can estimate the distance between the discrete (approximate) solution RkpR_{k}^{p} and the true solution RR at each mesh-point,

max0pP|RkpR(tp)|C~Δt+Ckk!max0tT|R(t)|.\max_{0\leq p\leq P}\left|R_{k}^{p}-R\left(t_{p}\right)\right|\leq\tilde{C}\Delta t+\sqrt{\frac{C^{k}}{k!}}\max_{0\leq t\leq T}\left|R\left(t\right)\right|. (II.9)
Remark.

We have the following remarks:

  • After obtaining the approximator RkpR_{k}^{p} for R(tp)R\left(t_{p}\right), we can compute S(tp)S\left(t_{p}\right) using (II.2). Then, the approximate solution for I(tp)I\left(t_{p}\right) can be determined using (A1), specifically I(tp)=NS(tp)R(tp)I\left(t_{p}\right)=N-S\left(t_{p}\right)-R\left(t_{p}\right).

  • Both C~\tilde{C} and CC in (II.9) are independent of PP and kk. As a by product, our discrete relaxation scheme {Rkp}k=0\left\{R_{k}^{p}\right\}_{k=0}^{\infty}, as defined in (II.8), is globally strongly convergent in C0C^{0}. Similar to the proof of Theorem 2, we can demonstrate that RkpR_{k}^{p} is non-negativity-preserving. It is important to note that many previous approximations, such as the method of series expansions [17, 5], parametrization method [9, 22] and finite difference method [20, 23], did not adequately address the preservation of non-negativity/positivity. Furthermore, certain recent positive numerical schemes fail to provide an error bound, as observed in the publications [12, 6].

  • While the application of the Euler method is initiated, we can further employ higher-order numerical methods to produce a faster convergent solver for the linear differential equation of RkR_{k}. Among these, the Runge-Kutta method stands out as the most favorable choice, offering a convergence rate of order q2q\geq 2. Building upon the analysis of the Euler method above, we can prove that all derivatives of the right hand side of (II.5) exist up to order qq and RkCqR_{k}\in C^{q} for any kk. Therefore, we can show that RkpR_{k}^{p} globally converges to RkR_{k} with a rate of 𝒪(Δtq)\mathcal{O}\left(\Delta t^{q}\right); cf. e.g. [8, Theorem 3.4] for the existing theory on the global convergence of the Runge-Kutta method. Note here that 𝒪(x)\mathcal{O}\left(x\right) is the conventional Landau symbol.

  • Similar to (II.9), the convergence of the Runge-Kutta method remains unaffected by kk. Nevertheless, it is important to emphasize that this convergence is heavily contingent upon the upper bounds of the involved derivatives. Considering the boundedness of Rk,RkR_{k},R_{k}^{\prime} and Rk′′R_{k}^{\prime\prime} established above, it becomes evident that these bounds tend to increase as the order rises. Consequently, it is crucial to exclusively employ variants of the Runge-Kutta method with appropriately high orders. This perspective holds true when applying the Runge-Kutta method directly to the differential equation (II.3).

III Extensions to other SIR models

In this section, we briefly discuss the applicability of the relaxation method to other population models of SIR type. In particular, we show below how the proposed approach can be adapted to approximate the SIRD (Susceptible-Infectious-Recovered-Deceased) and SIRX models; cf. [1, 16, 3] for an overview of these models.

SIRD model

The SIRD model extends the SIR model by distinguishing between recovered and deceased individuals. In this framework, the removals in the SIR model no longer encompass the number of infected individuals who have passed away. To account for mortality, a mortality rate σ>0\sigma>0 is introduced, representing the rate at which infected individuals succumb to death. Consequently, the death rate per unit of time is calculated as the product of the mortality rate and the number of infected individuals. Additionally, as the number of deceased individuals is excluded from the removals, the rate of change of infections over time is adjusted to reflect the loss caused by mortality. Mathematically, the SIRD model reads as

{I(t)=βS(t)I(t)(γ+σ)I(t),S(t)=βS(t)I(t),R(t)=γI(t),D(t)=σI(t),\begin{cases}I^{\prime}\left(t\right)=\beta S\left(t\right)I\left(t\right)-\left(\gamma+\sigma\right)I\left(t\right),\\ S^{\prime}\left(t\right)=-\beta S\left(t\right)I\left(t\right),\\ R^{\prime}\left(t\right)=\gamma I\left(t\right),\\ D^{\prime}\left(t\right)=\sigma I\left(t\right),\end{cases} (III.1)

where D(t)D\left(t\right) stands for the number of deceased people (after infection) at time tt. In (III.1), we make use of the following assumptions.

(B1) The total population size is always conserved with N>0N>0, meaning that S(t)+I(t)+R(t)+D(t)=NS\left(t\right)+I\left(t\right)+R\left(t\right)+D\left(t\right)=N for all tt.

(B2) We know the infection rate β>0\beta>0 from the infection process, the removal rate γ>0\gamma>0 from the removal process, and the death rate σ>0\sigma>0 from the mortality process.

(B3) The initial conditions are S(0)=n>1S\left(0\right)=n>1, I(0)=a1I\left(0\right)=a\geq 1, R(0)=0R\left(0\right)=0 and D(0)=0D\left(0\right)=0.

Remark.

By the first and second equations of the SIRD system (III.1), we see that

dIdS=1+γ+σβS.\frac{dI}{dS}=-1+\frac{\gamma+\sigma}{\beta S}.

Similar to the classic SIR model (I.1), we can thus formulate the so-called amplitude in the following fashion:

Imax\displaystyle I_{\max} =γ+σβln(γ+σβ)\displaystyle=\frac{\gamma+\sigma}{\beta}\ln\left(\frac{\gamma+\sigma}{\beta}\right)
γ+σβ+a+nγ+σβln(n)\displaystyle-\frac{\gamma+\sigma}{\beta}+a+n-\frac{\gamma+\sigma}{\beta}\ln\left(n\right) (III.2)

when SS reaches γ+σβ\frac{\gamma+\sigma}{\beta}.

Remark.

The SIRD model (III.1) resembles the SIRX model without containment rate. In the SIRX model, an additional class called “XX" was introduced to account for the impact of social or individual behavioral changes during quarantine. Individuals in this class, referred to as symptomatic quarantined individuals, no longer contribute to the transmission of the infection. Instead of σ\sigma, the SIRX model without containment rate consideres κ>0\kappa>0 that represents the rate at which infected individuals are removed due to quarantine measures. The SIRX model with the containment rate is not the scope of our paper since the associated transcendental system does not take the same form of (II.5). Indeed, the transcendental system governing the full SIRX model is of an integro-differential equation.

Now, we detail the transcendental equation for R(t)R\left(t\right) and the application of the relaxation scheme. From the second and third equations of system (III.1), we deduce that

S(t)=neμR(t),S\left(t\right)=ne^{-\mu R\left(t\right)}, (III.3)

where we have recalled the reciprocal relative removal constant μ=β/γ\mu=\beta/\gamma. Using the same way, the third and last equations of system (III.1) give

D(t)=σγR(t)D\left(t\right)=\frac{\sigma}{\gamma}R\left(t\right) (III.4)

by virtue of R(0)=D(0)=0R\left(0\right)=D\left(0\right)=0 (cf. (B3)). Then, plugging (III.3), (III.4) and (B1) into the third equation of (III.1), we obtain the following differential equation for R(t)R\left(t\right):

R(t)=γ[NneμR(t)(1+σγ)R(t)].R^{\prime}\left(t\right)=\gamma\left[N-ne^{-\mu R\left(t\right)}-\left(1+\frac{\sigma}{\gamma}\right)R\left(t\right)\right]. (III.5)

Henceforth, our relaxation scheme in this case becomes

Rk(t)+M¯Rk(t)=γNg¯(Rk1(t))+M¯Rk1(t),R_{k}^{\prime}\left(t\right)+\overline{M}R_{k}\left(t\right)=\gamma N-\overline{g}\left(R_{k-1}\left(t\right)\right)+\overline{M}R_{k-1}\left(t\right), (III.6)

where g¯(r)=γneμr+(γ+σ)r\overline{g}\left(r\right)=\gamma ne^{-\mu r}+\left(\gamma+\sigma\right)r. Similar to the SIR model, here we rely on (B3) to choose Rk(0)=0R_{k}\left(0\right)=0 for any k0k\geq 0 as the initial condition and R0(t)=0R_{0}\left(t\right)=0 as the starting point.

By choosing M¯γ+σ\overline{M}\geq\gamma+\sigma, our sequence {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} (defined in (III.6)) is non-negativity-preserving and globally strongly convergent to RR of the transcendental equation (III.5). These findings are analogous to our central Theorems 2 and 3, and therefore, we omit their formulations. Besides, Theorem 1 is applied to (III.5), guaranteeing the global existence and uniqueness of the C1C^{1} solutions to the SIRD model (III.1).

SIR model with background mortality

The SIR model, along with its variants SIRD and SIRX, assumes a constant population size. These models, known as epidemiological SIR-type models without vital dynamics, are limited in their representation of population changes; see (A1), (B1) and (C1). The SIR model with vital dynamics addresses this limitation by incorporating birth and death rates to account for population size fluctuations.

In the present work, we explore that the transcendental system governing the SIR model with background mortality takes the form of (II.5). With σ\sigma being the death rate, the population experiences changes over time. Here, individuals from all compartments can exit through deaths, allowing for a more realistic representation of population dynamics. Mathematically, the SIR model with background mortality can be expressed as follows:

{I(t)=βS(t)I(t)γI(t)σI(t),S(t)=βS(t)I(t)σS(t),R(t)=γI(t)σR(t).\begin{cases}I^{\prime}\left(t\right)=\beta S\left(t\right)I\left(t\right)-\gamma I\left(t\right)-\sigma I\left(t\right),\\ S^{\prime}\left(t\right)=-\beta S\left(t\right)I\left(t\right)-\sigma S\left(t\right),\\ R^{\prime}\left(t\right)=\gamma I\left(t\right)-\sigma R\left(t\right).\end{cases} (III.7)

In this perspective, we make use of the following assumptions.

(C1) The total population size is dependent of tt, i.e. N=N(t)>0N=N\left(t\right)>0. It can be computed that N(t)=S(t)+I(t)+R(t)=eσtN0N\left(t\right)=S\left(t\right)+I\left(t\right)+R\left(t\right)=e^{-\sigma t}N_{0} for some fixed N0>0N_{0}>0.

(C2) We know the infection rate β>0\beta>0 from the infection process, the removal rate γ>0\gamma>0 from the removal process, and the death rate σ>0\sigma>0 from the mortality process.

(C3) The initial conditions are S(0)=n>1S\left(0\right)=n>1, I(0)=a1I\left(0\right)=a\geq 1 and R(0)=0R\left(0\right)=0. This implies that N0=n+aN_{0}=n+a.

Similar to the classical SIR model, we seek the transcendental equation for RR prior to the application of our proposed numerical scheme. When doing so, we define R¯(t)=eσtR(t)\overline{R}\left(t\right)=e^{\sigma t}R\left(t\right) and S¯(t)=eσtS(t)\overline{S}\left(t\right)=e^{\sigma t}S\left(t\right). By the second and third equations of system (III.7), we find that

S¯(t)\displaystyle\overline{S}^{\prime}\left(t\right) =βS¯(t)I(t),\displaystyle=-\beta\overline{S}\left(t\right)I\left(t\right), (III.8)
R¯(t)\displaystyle\overline{R}^{\prime}\left(t\right) =γeσtI(t).\displaystyle=\gamma e^{\sigma t}I\left(t\right). (III.9)

Therefore, we deduce that

dS¯dR¯\displaystyle\frac{d\overline{S}}{d\overline{R}} =μeσtS¯,\displaystyle=-\mu e^{-\sigma t}\overline{S}, (III.10)

or equivalently, ln(S¯)=μeσtR¯+c~(t)\ln\left(\overline{S}\right)=-\mu e^{-\sigma t}\overline{R}+\tilde{c}\left(t\right). Herewith, we have recalled the reciprocal relative removal rate μ=β/γ\mu=\beta/\gamma. Henceforth, we have

S¯(t)=ec~(t)μeσtR¯(t).\overline{S}\left(t\right)=e^{\tilde{c}\left(t\right)-\mu e^{-\sigma t}\overline{R}\left(t\right)}. (III.11)

Since S¯(0)=n\overline{S}\left(0\right)=n and R¯(0)=R(0)=0\overline{R}\left(0\right)=R\left(0\right)=0 by (D3), we find that c~(0)=ln(n)\tilde{c}\left(0\right)=\ln\left(n\right). Moreover, by taking the derivative in time of (III.11), we arrive at

S¯(t)=ec~(t)μeσtR¯(t)[c~(t)μeσt(σ+R¯(t))].\overline{S}^{\prime}\left(t\right)=e^{\tilde{c}\left(t\right)-\mu e^{-\sigma t}\overline{R}\left(t\right)}\left[\tilde{c}^{\prime}\left(t\right)-\mu e^{-\sigma t}\left(-\sigma+\overline{R}^{\prime}\left(t\right)\right)\right]. (III.12)

Dividing both sides of (III.12) by R¯(t)\overline{R}^{\prime}\left(t\right), we find that

S¯(t)R¯(t)\displaystyle\frac{\overline{S}^{\prime}\left(t\right)}{\overline{R}^{\prime}\left(t\right)}
=ec~(t)μeσtR¯(t)[c~(t)μeσt(σ+R¯(t))]R¯(t).\displaystyle=\frac{e^{\tilde{c}\left(t\right)-\mu e^{-\sigma t}\overline{R}\left(t\right)}\left[\tilde{c}^{\prime}\left(t\right)-\mu e^{-\sigma t}\left(-\sigma+\overline{R}^{\prime}\left(t\right)\right)\right]}{\overline{R}^{\prime}\left(t\right)}.

Then combining this with (III.10) and (III.11), we derive the following differential equation for c~(t)\tilde{c}\left(t\right):

ec~(t)μeσtR¯(t)[c~(t)μeσt(σ+R¯(t))]\displaystyle e^{\tilde{c}\left(t\right)-\mu e^{-\sigma t}\overline{R}\left(t\right)}\left[\tilde{c}^{\prime}\left(t\right)-\mu e^{-\sigma t}\left(-\sigma+\overline{R}^{\prime}\left(t\right)\right)\right]
=μeσtec~(t)μeσtR¯(t)R¯(t),\displaystyle=-\mu e^{-\sigma t}e^{\tilde{c}\left(t\right)-\mu e^{-\sigma t}\overline{R}\left(t\right)}\overline{R}^{\prime}\left(t\right),

or equivalently, c~(t)=μσeσt\tilde{c}^{\prime}\left(t\right)=-\mu\sigma e^{-\sigma t}. Thus, we obtain c~(t)=ln(n)+μ(eσt1)\tilde{c}\left(t\right)=\ln\left(n\right)+\mu\left(e^{-\sigma t}-1\right) and

S¯(t)=neμ(eσt1)eμeσtR¯(t).\overline{S}\left(t\right)=ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu e^{-\sigma t}\overline{R}\left(t\right)}.

Together with the back-substitution eσtR¯(t)=R(t)e^{-\sigma t}\overline{R}\left(t\right)=R\left(t\right), we thereby get S¯(t)=neμ(eσt1)eμR(t)\overline{S}\left(t\right)=ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu R\left(t\right)}. Now, we note that by (C1) and (C3), eσtI(t)=N0S¯(t)R¯(t)e^{\sigma t}I\left(t\right)=N_{0}-\overline{S}\left(t\right)-\overline{R}\left(t\right) holds true for any tt. Plugging this into (III.9) and using the fact that S¯(t)=neμ(eσt1)eμR(t)=neμ(eσt1)eμeσtR¯(t)\overline{S}\left(t\right)=ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu R\left(t\right)}=ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu e^{-\sigma t}\overline{R}\left(t\right)}, we derive the transcendental equation for R¯\overline{R} as follows:

R¯(t)=γ[N0neμ(eσt1)eμeσtR¯(t)R¯(t)].\overline{R}^{\prime}\left(t\right)=\gamma\left[N_{0}-ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu e^{-\sigma t}\overline{R}\left(t\right)}-\overline{R}\left(t\right)\right]. (III.13)

By setting g^(r)=γneμ(eσt1)eμeσtr+γr\hat{g}\left(r\right)=\gamma ne^{\mu\left(e^{-\sigma t}-1\right)}e^{-\mu e^{-\sigma t}r}+\gamma r, our relaxation scheme for the SIR model with background mortality is structured by

R¯k(t)\displaystyle\overline{R}_{k}^{\prime}\left(t\right) +M^R¯k(t)\displaystyle+\hat{M}\overline{R}_{k}\left(t\right)
=γN0g^(R¯k1(t))+M^R¯k1(t).\displaystyle=\gamma N_{0}-\hat{g}\left(\overline{R}_{k-1}\left(t\right)\right)+\hat{M}\overline{R}_{k-1}\left(t\right). (III.14)

Similar to the above-mentioned SIR-based models, we choose R¯k(0)=0\overline{R}_{k}\left(0\right)=0 for any k0k\geq 0 as the initial condition and R¯0(t)=0\overline{R}_{0}\left(t\right)=0 as the starting point, based on the fact that R¯(0)=R(0)=0\overline{R}\left(0\right)=R\left(0\right)=0. Also, here we take M^γ\hat{M}\geq\gamma to ensure the non-negativity preservation and global strong convergence of the sequence {R¯k}k=0\left\{\overline{R}_{k}\right\}_{k=0}^{\infty} (defined in (III.14)) to the sought R¯\overline{R} of the transcendental equation (III.13). As another analog of Theorems 2 and 3, we omit details of the formulations of the theoretical results for the sequence {R¯k}k=0\left\{\overline{R}_{k}\right\}_{k=0}^{\infty}. It is also worth mentioning that Theorem 1 remains true in this case, providing the global existence and uniqueness of C1C^{1} solutions to the SIR model with mortality (III.7).

IV Numerical experiments

In this section, we verify the numerical performance of the proposed relaxation method. Initially, we employ various approaches to solve the SIR model (I.1) for the purpose of comparison. These include our method (II.5), as well as the standard methods: approximate analytic solution, regular linearization procedure, and conventional explicit Euler method. It is important to note that since the conventional explicit Euler method is considered in this comparison, we also apply the Euler method to our relaxation scheme, as outlined in (II.8), as well as to the regular linearization procedure.

Additionally, it is worth mentioning that the approximate analytic solution for R(t)R\left(t\right) (referred to as RaR_{\text{a}}) can be found in [10, 4, 3]. In particular, it is of the following form:

Ra(t)=1nμ2[nμ1+ηtanh(γηt2ψ)],R_{\text{a}}\left(t\right)=\frac{1}{n\mu^{2}}\left[n\mu-1+\eta\tanh\left(\frac{\gamma\eta t}{2}-\psi\right)\right], (IV.1)

where

η\displaystyle\eta =[2nμ2(Nn)+(nμ1)2]1/2,\displaystyle=\left[2n\mu^{2}\left(N-n\right)+\left(n\mu-1\right)^{2}\right]^{1/2},
ψ\displaystyle\psi =tanh1[1η(nμ1)].\displaystyle=\tanh^{-1}\left[\frac{1}{\eta}\left(n\mu-1\right)\right].

The approximate analytic solution mentioned above corresponds to the solution of the Riccati equation. However, it is applicable only when μR\mu R is sufficiently small. Furthermore, the conventional explicit Euler method is expressed as follows:

Rp=Rp1+Δt(γNg(Rp1)),R^{p}=R^{p-1}+\Delta t\left(\gamma N-g\left(R^{p-1}\right)\right), (IV.2)

where RpR(tp)R^{p}\approx R\left(t_{p}\right) is the discrete solution to the nonlinear differential equation (II.3) for tp=pΔtt_{p}=p\Delta t being the mesh-point in time.

In the second test, we utilize the widely used Runge-Kutta RK4 method to solve the SIR model (II.5) by applying it to our relaxation scheme (I.1). We then compare its performance when using the Euler-relaxation method (II.8) and when directly applying the Runge-Kutta RK4 method to (II.3). For sake of clarity, we provide the formulation of the RK4 method for solving a differential equation of a general type R(t)=F(t,R(t))R^{\prime}\left(t\right)=F\left(t,R\left(t\right)\right):

Rp\displaystyle R^{p} =Rp1+16K1(tp1,Rp1)+13K2(tp1,Rp1)\displaystyle=R^{p-1}+\frac{1}{6}K_{1}\left(t_{p-1},R^{p-1}\right)+\frac{1}{3}K_{2}\left(t_{p-1},R^{p-1}\right)
+13K3(tp1,Rp1)+16K4(tp1,Rp1),\displaystyle+\frac{1}{3}K_{3}\left(t_{p-1},R^{p-1}\right)+\frac{1}{6}K_{4}\left(t_{p-1},R^{p-1}\right), (IV.3)

where we have denoted the intermediate values by

K1(tp1,Rp1)\displaystyle K_{1}\left(t_{p-1},R^{p-1}\right) =ΔtF(tp1,Rp1),\displaystyle=\Delta tF\left(t_{p-1},R^{p-1}\right), (IV.4)
K2(tp1,Rp1)\displaystyle K_{2}\left(t_{p-1},R^{p-1}\right) =ΔtF(tp1+Δt2,Rp1+K12),\displaystyle=\Delta tF\left(t_{p-1}+\frac{\Delta t}{2},R^{p-1}+\frac{K_{1}}{2}\right), (IV.5)
K3(tp1,Rp1)\displaystyle K_{3}\left(t_{p-1},R^{p-1}\right) =ΔtF(tp1+Δt2,Rp1+K22),\displaystyle=\Delta tF\left(t_{p-1}+\frac{\Delta t}{2},R^{p-1}+\frac{K_{2}}{2}\right), (IV.6)
K4(tp1,Rp1)\displaystyle K_{4}\left(t_{p-1},R^{p-1}\right) =ΔtF(tp1+Δt,Rp1+K3).\displaystyle=\Delta tF\left(t_{p-1}+\Delta t,R^{p-1}+K_{3}\right). (IV.7)

When using our method, it is important to note that for each iteration kk, we solve the linear differential equation Rk(t)=F(t,Rk(t))R_{k}^{\prime}\left(t\right)=F\left(t,R_{k}\left(t\right)\right), where F(t,Rk(t))=MRk(t)+γNg(Rk1(t))+MRk1(t)F\left(t,R_{k}\left(t\right)\right)=-MR_{k}\left(t\right)+\gamma N-g\left(R_{k-1}\left(t\right)\right)+MR_{k-1}\left(t\right). Notice that in this equation, the presence of the midpoint tp1+Δt2t_{p-1}+\frac{\Delta t}{2}, applied to Rk1(t)R_{k-1}\left(t\right) obtained from the previous step, leads to the following linear approximation:

Rk1(tp1+Δt2)=12[Rk1(tp1)+Rk1(tp1+Δt)].R_{k-1}\left(t_{p-1}+\frac{\Delta t}{2}\right)=\frac{1}{2}\left[R_{k-1}\left(t_{p-1}\right)+R_{k-1}\left(t_{p-1}+\Delta t\right)\right]. (IV.8)

Denote this approximation by Rk1p0.5=Rk1(tp1+Δt2)R_{k-1}^{p-0.5}=R_{k-1}\left(t_{p-1}+\frac{\Delta t}{2}\right). Thereby, we seek RkpR_{k}^{p} satisfying (IV.3) in which the intermediate values are given by

K1\displaystyle K_{1} =Δt(MRkp1+γNg(Rk1p1)+MRk1p1),\displaystyle=\Delta t\left(-MR_{k}^{p-1}+\gamma N-g\left(R_{k-1}^{p-1}\right)+MR_{k-1}^{p-1}\right), (IV.9)
K2\displaystyle K_{2} =Δt[M(Rkp1+K12)+γNg(Rk1p0.5)+MRk1p0.5],\displaystyle=\Delta t\left[-M\left(R_{k}^{p-1}+\frac{K_{1}}{2}\right)+\gamma N-g\left(R_{k-1}^{p-0.5}\right)+MR_{k-1}^{p-0.5}\right], (IV.10)
K3\displaystyle K_{3} =Δt[M(Rkp1+K22)+γNg(Rk1p0.5)+MRk1p0.5],\displaystyle=\Delta t\left[-M\left(R_{k}^{p-1}+\frac{K_{2}}{2}\right)+\gamma N-g\left(R_{k-1}^{p-0.5}\right)+MR_{k-1}^{p-0.5}\right], (IV.11)
K4\displaystyle K_{4} =Δt[M(Rkp1+K3)+γNg(Rk1p)+MRk1p].\displaystyle=\Delta t\left[-M\left(R_{k}^{p-1}+K_{3}\right)+\gamma N-g\left(R_{k-1}^{p}\right)+MR_{k-1}^{p}\right]. (IV.12)

On the other hand, when directly applying the Runge-Kutta RK4 method to the nonlinear differential equation (II.3), we have F(t,R(t))=γ(NneμR(t)R(t))F\left(t,R\left(t\right)\right)=\gamma\left(N-ne^{-\mu R\left(t\right)}-R\left(t\right)\right).

In the third test, we present the numerical performance of the proposed method in solving the SIR-based models discussed in section III. In particular, our focus in this test is on

  1. 1.

    the scheme {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty}, defined in (III.6), for the SIRD model (III.1). In this model, the relaxation parameter satisfies M¯γ+σ\overline{M}\geq\gamma+\sigma.

  2. 2.

    the scheme {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} computed from {R¯k}k=0\left\{\overline{R}_{k}\right\}_{k=0}^{\infty} (defined in (III.14)) for the SIR model with background mortality (III.7). In this case, we condition that M^γ\hat{M}\geq\gamma.

To evaluate the accuracy of the relaxation scheme, we assess the proximity of the approximation when approaching the maximum value of II. It is important to recall that explicit expressions for ImaxI_{\max} have been derived for each specific case. The reader is referred to (II.4) for the classical SIRD model, and (III.2) for the SIRD model. For the SIR model with background mortality, since the maximum value of II cannot be found explicitly, we run the simulation with several values of PP and KK to verify the numerical stability. When increasing these parameters, we also identify the numerical amplitude and peak day to see the performance of our relaxation method in the Euler and RK4 frameworks.

Test 1

In this test, we compare our Euler-relaxation approach with the approximate analytic solution (IV.1), the regular linearization procedure (which arises when the relaxation parameter vanishes), and the direct explicit Euler method (IV.2). Alongside assessing numerical stability, we evaluate the performance of these methods based on the amplitude ImaxI_{\max} presented in (II.4) and the peak day.

Here, we consider a population sample of N=1000N=1000 for the SIR model (I.1) over the course of one year (T=365T=365). Initially, we assume that there are a=2a=2 infected people in this sample, leaving n=998n=998 individuals susceptible to infection. Furthermore, we choose a removal rate of γ=0.02\gamma=0.02 and an infection rate of β=0.0004\beta=0.0004. With these choices, we obtain a reciprocal relative removal rate of μ=β/γ=0.02\mu=\beta/\gamma=0.02, indicating that nμ=19.96>1n\mu=19.96>1. Additionally, for our relaxation process, we set M=0.02M=0.02.

Method # 1 1 2 2 3 4 4
# of time step PP 100100 10001000 100100 10001000 None 100100 10001000
# of iteration KK 5 50 2 4 None None None
Amplitude ImaxI_{\max} 797 800 800 800 755 793 800
Peak day 25 23 138 35 114 32 25
Table 1: Values of the computed amplitude ImaxI_{\max} obtained from different methods and the corresponding peak days. Method #1: our Euler-relaxation method (II.8). Method #2: the regular linearization method, i.e. our proposed method (II.5) but with M=0M=0. Method #3: the approximate analytic solution RaR_{\text{a}} formulated in (IV.1). Method #4: the conventional explicit Euler method (IV.2) applied directly to the nonlinear differential equation (II.3). By (II.4), the true amplitude Imax,trueI_{\max,\text{true}} is 800 in this scenario.

Our numerical results for Test 1 are presented in Table 1. Based on the maximum amplitude (ImaxI_{\max}), our proposed method within the Euler context (method #1) outperforms the approximations obtained from methods #2–4. The first two columns of Table 1 demonstrate the numerical stability of our proposed method, particularly when dealing with relatively small values of PP and KK. Remarkably, when P=100P=100 and K=5K=5, our method yields an ImaxI_{\max} value of 797, which is very close to the true value of 800 as shown in (II.4). In contrast, the ImaxI_{\max} obtained from the approximate analytic solution (method #3) shows a significant deviation. We also observe that the amplitude ImaxI_{\max} obtained from method #3 remains unaffected regardless of the choice of PP.

A comparison between methods #1 and #2 reveals that while the regular linearization technique can provide a satisfactory estimate of ImaxI_{\max} (800 when considering P=100P=100 and K=2K=2), method #2 suffers from severe numerical instability as illustrated in the second row of Figure IV.1, particularly when increasing KK to obtain a more accurate graphical representation.

Furthermore, when PP and KK are relatively small, our proposed method shows a slight improvement over the conventional Euler method (method #4) within the same Euler context. At a coarse grid level, method #4 yields a relative error of 0.875%, while our method achieves a lower relative error of 0.375%. Upon increasing PP to 1000, both methods #1 (with an increased K=50K=50) and #4 demonstrate comparable accuracy in terms of amplitude and graphical representation, as depicted in the first and last rows of Figure IV.1.

Our numerical investigation reveals that the true peak value (Imax,trueI_{\max,\text{true}}) is attained on the 24th day by employing sufficiently large values of PP (over 3000) in both reliable methods #1 and #4. Comparing the peak days, it becomes evident from the last row of Table 1 that our relaxation method outperforms methods #2 and #3. While our method and method #4 achieve similar accuracy in terms of graphical simulation and amplitude, our proposed method detects the peak day earlier and with greater reliability. Specifically, considering small PP and KK, our relaxation method identifies the peak outbreak on the 25th day, which closely aligns with the true peak (24th), in contrast to the peak day of 32nd obtained from method #4. For larger PP, our method predicts an earlier peak occurrence (day 23rd), which proves advantageous in practical scenarios compared to the peak day of 25th obtained from method #4. The ability to predict the peak event of a disease earlier is of practical significance for decision-makers, enabling them to implement and sustain timely public health measures and interventions aimed at mitigating the disease risk.

Refer to caption
(a) Method #1 (P=100,K=5P=100,K=5)
Refer to caption
(b) Method #1 (P=1000,K=50P=1000,K=50)
Refer to caption
(c) Method #2 (P=100,K=2P=100,K=2)
Refer to caption
(d) Method #2 (P=1000,K=4P=1000,K=4)
Refer to caption
(e) Method #3
Refer to caption
(f) Method #4 (P=100P=100)
Refer to caption
(g) Method #4 (P=1000P=1000)
Figure IV.1: Graphical illustrations of Test 1. Row 1: Euler-relaxation method. Row 2: regular linearization method. Row 3: approximate analytic method. Row 4: direct Euler method.

Test 2

Our second test focuses on the numerical comparison between two approaches: applying the well-known Runge-Kutta RK4 method (referred to as method #5) to our relaxation scheme (II.5) and applying it directly to the nonlinear differential equation (II.3) (denoted as method #6). Additionally, we compare the convergence speed of method #5 with method #1, referred above to as the Euler-relaxation method (II.8).

As RK4 is a fourth-order method, we deliberately choose a large population size of N=97.47×106N=97.47\times 10^{6} and a transmission rate of β=3×109\beta=3\times 10^{-9}. Assuming the initial infected population is a=11a=11, and the removal rate remains constant at γ=0.05\gamma=0.05 throughout the entire six-month period (T=180T=180), we can calculate that the simulated disease reaches its peak at Imax,true=51367769I_{\max,\text{true}}=51367769; cf. (II.4). Moreover, based on numerical observations with a sufficiently large value of PP (>2000), we find that this peak is reached on the 73rd day.

Our numerical results are tabulated in Table 2, accompanied by corresponding graphical illustrations in Figure IV.2. We see that within the same RK4 framework, our proposed relaxation method (method #5) outperforms the direct approach. When the number of time steps is small (P=50P=50), method #5 with K=20K=20 yields an amplitude ImaxI_{\max} of 51295165 with a relative accuracy of 0.14%, while method #6 achieves 0.81%. Both methods capture the peak day (72) well compared to the true value of 73. Note in this case that we choose K=20K=20, a larger value than in Test 1, due to the larger population under consideration. Cf. Theorem 3, the choice of KK does affect our error estimation which heavily depends on the total size of the removal population.

We also see that when increasing PP to 2000, our proposed method #5 with an increased K=50K=50 precisely achieves the true amplitude, Imax,true=51367769I_{\max,\text{true}}=51367769, while the direct RK4 method produces a very close approximation of 51367765. Both methods also identify the peak day as the 73rd day.

Furthermore, we compare our relaxation method to the Euler and Runge-Kutta frameworks. In terms of amplitude, although method #1 initially provides a better value of 51341234 with an accuracy of 0.05%, it fails to accurately detect the peak day, significantly deviating from the true value of 73 (predicting 54 instead). Increasing PP to 2000 improves the amplitude to 51367573, but it still performs worse than the direct RK4 method’s amplitude of 51367765. Herewith, method #1 achieves an improved peak day of 72. Additionally, based on the simulation of method #1, we observe that to reach the true amplitude (Imax,true=51367769I_{\max,\text{true}}=51367769) and the true peak day of 73, at least P=19000P=19000 and K=100K=100 are required. Henceforth, our relaxation method in the RK4 framework, as readily expected, outperforms itself in the Euler framework.

Method # 5 5 6 6 1 1
# of time step PP 5050 20002000 5050 20002000 5050 20002000
# of iteration KK 20 50 None None 20 50
Amplitude ImaxI_{\max} 51295165 51367769 50948480 51367765 51341234 51367573
Peak day 72 73 72 73 54 72
Table 2: Values of the computed amplitude ImaxI_{\max} obtained from different methods and the corresponding peak days. Method #5: our RK4-relaxation method (IV.3) applied with (IV.8)–(IV.12). Method #6: the conventional RK4 method (IV.3)–(IV.7) applied directly to the nonlinear differential equation (II.3). Method #1: our Euler-relaxation method (II.8). By (II.4), the true amplitude Imax,trueI_{\max,\text{true}} is 51367769 in this scenario.
Refer to caption
(a) Method #5 (P=50,K=20P=50,K=20)
Refer to caption
(b) Method #5 (P=2000,K=50P=2000,K=50)
Refer to caption
(c) Method #6 (P=50P=50)
Refer to caption
(d) Method #6 (P=2000P=2000)
Refer to caption
(e) Method #1 (P=50,K=20P=50,K=20)
Refer to caption
(f) Method #1 (P=2000,K=50P=2000,K=50)
Figure IV.2: Graphical illustrations of Test 2. Row 1: RK4-relaxation method. Row 2: direct RK4 method. Row 3: Euler-relaxation method.

Test 3

As previously mentioned, in our last experiment, we aim to broaden the scope of the proposed relaxation method by applying it to various SIR-type models: specifically, the SIRD model and the SIR model with background mortality. These models share the same input parameters as those used in Test 1, where we set N=1000N=1000, n=998n=998, T=365T=365, γ=0.02\gamma=0.02, β=0.0004\beta=0.0004. In the SIRD model (III.1), we choose a death rate of σ=0.01\sigma=0.01, which implies a choice of the relaxation parameter M¯γ+σ=0.03\overline{M}\geq\gamma+\sigma=0.03. In the SIR model with background mortality (III.7), we use the background death of σ=0.001\sigma=0.001 and select M^γ=0.02\hat{M}\geq\gamma=0.02.

Our numerical findings for the SIRD model are detailed in Figure IV.3. We specifically investigate the scenario where M¯=0.015\overline{M}=0.015, thereby contravening the relaxation condition (M¯0.03\overline{M}\geq 0.03). Consistent with our theorem concerning non-negativity preservation, we observe that the relaxed solution with M¯=0.015\overline{M}=0.015, obtained from both the Euler and RK4 frameworks, fails to maintain non-negativity over time. This is evident in the first column of Figure IV.3. When M¯=0.03\overline{M}=0.03 (a case that adheres to the condition), we also note that the RK4-relaxation outperforms the Euler-relaxation approach. Given the Imax,true=730I_{\max,\text{true}}=730 (as formulated in (III.2)), and with a coarse mesh of P=200P=200 and K=10K=10, we observe that the RK4-relaxation produces an amplitude identical to the true value. In contrast, the Euler-relaxation yields a value of 729. It is also worth mentioning that the accurate amplitude is attained when applying the Euler-relaxation with P=800P=800 and K=10K=10.

Refer to caption
(a) Violating Euler-relaxation (P=100,K=5P=100,K=5, M¯=0.015\overline{M}=0.015)
Refer to caption
(b) Euler-relaxation (P=200,K=10,M¯=0.03P=200,K=10,\overline{M}=0.03)
Refer to caption
(c) Violating RK4-relaxation (P=100,K=5,M¯=0.015P=100,K=5,\overline{M}=0.015)
Refer to caption
(d) RK4-relaxation (P=200,K=10,M¯=0.03P=200,K=10,\overline{M}=0.03)
Figure IV.3: Graphical illustrations of Test 3 – SIRD model. Row 1: Euler-relaxation method with violating and non-violating cases. Row 2: RK4-relaxation method with violating and non-violating cases. These illustrations serve to highlight a crucial observation: when the relaxation parameter is not suitably selected, the numerical solution loses its adherence to non-negativity preservation.

Our numerical results pertaining to the SIR model with background mortality are presented in Figure IV.4. It is evident that both the Euler and RK4 relaxation methods show numerical stability and non-negativity preservation as we increase the values of (P,K)\left(P,K\right) from (100,5)\left(100,5\right) to (1000,50)\left(1000,50\right).

Consistent with our prior tests, the RK4-relaxation method continues to outperform the Euler-relaxation method. Leveraging this numerical stability, we run the RK4-relaxation method using large values of PP and KK to determine the numerical amplitude and peak day. Our findings reveal a numerical amplitude of 777, peaking on the 24th day. Within the RK4 framework, achieving this numerical amplitude and peak day requires approximately P=300P=300 and K=20K=20. In contrast, the Euler framework demands a minimum of P=1700P=1700 and K=20K=20 for similar outcomes.

Refer to caption
(a) Method #1 (P=100,K=5P=100,K=5)
Refer to caption
(b) Method #1 (P=1000,K=50P=1000,K=50)
Refer to caption
(c) Method #5 (P=100,K=5P=100,K=5)
Refer to caption
(d) Method #5 (P=1000,K=50P=1000,K=50)
Figure IV.4: Graphical illustrations of Test 3 – SIR model with background death. Row 1: Euler-relaxation method with different values of PP and KK. Row 2: RK4-relaxation method with diverse PP and KK values. In these illustrations, numerical stability and non-negativity preservation are observed.

V Concluding remarks

This work presents a novel numerical approach for solving the SIR model in population dynamics. While various approximation methods have been proposed for this classical model, the analysis of their convergence has been limited and challenging. Our approach introduces the relaxation procedure to approximate the continuous model. By carefully selecting the relaxation parameter, we achieve global strong convergence of the scheme and effectively preserve non-negativity. The proposed scheme is explicit and straightforward to implement, enabling us to obtain the approximate solution at either the discrete or analytical level. Additionally, we showcase the applicability of our scheme to numerous variants of the SIR model.

In our future work, we aim to extend our method to a globally strongly convergent higher-order scheme. Furthermore, we plan to apply the method to more complex SIR-based models involving multiple compartments.

Credit authorship contribution statement

V. A. Khoa: Supervision, Conceptualization, Formal analysis, Writing–review & editing. P. M. Quan: Software, Visualization. K. W. Blayneh: Formal analysis, Writing–review & editing. J. Allen: Formal analysis, Visualization.

Declaration of competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Data availability

Simulated data will be made available on request.

Acknowledgments

This research has received funding from the National Science Foundation (NSF). Specifically, V. A. K., P. M. Q., and J. A. extend their gratitude for the invaluable support provided by NSF. V. A. K. and J. A. also hold deep appreciation for the Florida A&M University Rattler Research program, its esteemed committee, and Dr. Tiffany W. Ardley. Their unwavering dedication has facilitated an exceptional academic journey for the mentee (J. A.) and the mentor (V. A. K.).

Furthermore, V. A. K. wishes to express many thanks to Dr. Charles Weatherford (Florida A&M University) and Dr. Ziad Musslimani (Florida State University). Their support has been instrumental in shaping V. A. K.’s early research career. Lastly, this work is complete on a momentous personal milestone – the wedding day of V. A. K. and the bride, Huynh Thi Kim Ngan.

Appendix

Proof of Theorem 3

Step 1: Define k(t)=Rk(t)R(t)\mathcal{E}_{k}\left(t\right)=R_{k}\left(t\right)-R\left(t\right) for k=1,2,3,k=1,2,3,\ldots. It follows from (II.5) and (II.3) that k\mathcal{E}_{k} satisfies the following differential equation:

k(t)+Mk(t)\displaystyle\mathcal{E}_{k}^{\prime}\left(t\right)+M\mathcal{E}_{k}\left(t\right) =g(Rk1(t))+g(R(t))+Mk1(t)\displaystyle=-g\left(R_{k-1}\left(t\right)\right)+g\left(R\left(t\right)\right)+M\mathcal{E}_{k-1}\left(t\right)
=p(R(t))p(Rk1(t)),\displaystyle=p\left(R\left(t\right)\right)-p\left(R_{k-1}\left(t\right)\right), (V.1)

where we have denoted p(r)=g(r)Mrp\left(r\right)=g\left(r\right)-Mr for r0r\geq 0. Herewith, by Theorems 1 and 2, we are allowed to consider r0r\geq 0. We can compute that p(r)=γnμeμr+γMp^{\prime}\left(r\right)=-\gamma n\mu e^{-\mu r}+\gamma-M. Then, for MγM\geq\gamma and since r0r\geq 0, we estimate that

γγnμMp(r)=γnμeμr+γM<0,\gamma-\gamma n\mu-M\leq p^{\prime}\left(r\right)=-\gamma n\mu e^{-\mu r}+\gamma-M<0,

which shows

|p(r)|M+γnμγ.\left|p^{\prime}\left(r\right)\right|\leq M+\gamma n\mu-\gamma. (V.2)

Therefore, the left-hand side of (V.1) can be bounded from above by

k(t)+Mk(t)(M+γnμγ)|k1(t)|.\mathcal{E}_{k}^{\prime}\left(t\right)+M\mathcal{E}_{k}\left(t\right)\leq\left(M+\gamma n\mu-\gamma\right)\left|\mathcal{E}_{k-1}\left(t\right)\right|.

Using the Hölder inequality, we find that

e2Mt|k(t)|2\displaystyle e^{2Mt}\left|\mathcal{E}_{k}\left(t\right)\right|^{2} (M+γnμγ)2(0teMs|k1(s)|𝑑s)2\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2}\left(\int_{0}^{t}e^{Ms}\left|\mathcal{E}_{k-1}\left(s\right)\right|ds\right)^{2}
(M+γnμγ)20te2Ms𝑑s0t|k1(s)|2𝑑s.\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2}\int_{0}^{t}e^{2Ms}ds\int_{0}^{t}\left|\mathcal{E}_{k-1}\left(s\right)\right|^{2}ds.

Thus, we deduce that

|k(t)|212M(M+γnμγ)2(1e2Mt)0t|k1(s)|2𝑑s.\left|\mathcal{E}_{k}\left(t\right)\right|^{2}\leq\frac{1}{2M}\left(M+\gamma n\mu-\gamma\right)^{2}\left(1-e^{-2Mt}\right)\int_{0}^{t}\left|\mathcal{E}_{k-1}\left(s\right)\right|^{2}ds.

By the elementary inequality ex+x1e^{-x}+x\geq 1, we obtain the following estimate

|k(t)|2(M+γnμγ)2t0t|k1(s)|2𝑑s.\left|\mathcal{E}_{k}\left(t\right)\right|^{2}\leq\left(M+\gamma n\mu-\gamma\right)^{2}t\int_{0}^{t}\left|\mathcal{E}_{k-1}\left(s\right)\right|^{2}ds. (V.3)

Step 2: By induction, we can show that for any 2k2\leq k\in\mathbb{N}

|k(t)|2(M+γnμγ)2kt0ts10s1sk10sk1|0(sk)|2𝑑sk𝑑sk1𝑑s1\left|\mathcal{E}_{k}\left(t\right)\right|^{2}\leq\left(M+\gamma n\mu-\gamma\right)^{2k}t\int_{0}^{t}s_{1}\int_{0}^{s_{1}}\ldots s_{k-1}\int_{0}^{s_{k-1}}\left|\mathcal{E}_{0}\left(s_{k}\right)\right|^{2}ds_{k}ds_{k-1}\ldots ds_{1} (V.4)

It follows from (V.3) that (V.4) holds true for k=2k=2. Indeed,

|2(t)|2(M+γnμγ)2t0t|1(s1)|2𝑑s1(M+γnμγ)4t0ts10s1|0(s2)|2𝑑s2𝑑s1.\left|\mathcal{E}_{2}\left(t\right)\right|^{2}\leq\left(M+\gamma n\mu-\gamma\right)^{2}t\int_{0}^{t}\left|\mathcal{E}_{1}\left(s_{1}\right)\right|^{2}ds_{1}\leq\left(M+\gamma n\mu-\gamma\right)^{4}t\int_{0}^{t}s_{1}\int_{0}^{s_{1}}\left|\mathcal{E}_{0}\left(s_{2}\right)\right|^{2}ds_{2}ds_{1}.

Assume that (V.4) holds true for k=k0k=k_{0}. We show that it also holds true for k=k0+1k=k_{0}+1. By (V.3), we have

|k0+1(t)|2\displaystyle\left|\mathcal{E}_{k_{0}+1}\left(t\right)\right|^{2}
(M+γnμγ)2t0t|k0(s)|2𝑑s\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2}t\int_{0}^{t}\left|\mathcal{E}_{k_{0}}\left(s\right)\right|^{2}ds
(M+γnμγ)2t0t(M+γnμγ)2k0s0ss10s1sk010sk01|0(sk0)|2𝑑sk0𝑑sk01𝑑s1𝑑s\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2}t\int_{0}^{t}\left(M+\gamma n\mu-\gamma\right)^{2k_{0}}s\int_{0}^{s}s_{1}\int_{0}^{s_{1}}\ldots s_{k_{0}-1}\int_{0}^{s_{k_{0}-1}}\left|\mathcal{E}_{0}\left(s_{k_{0}}\right)\right|^{2}ds_{k_{0}}ds_{k_{0}-1}\ldots ds_{1}ds
(M+γnμγ)2(k0+1)0ts10s1sk00sk0|0(sk0+1)|2𝑑sk0+1𝑑sk0𝑑s1.\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2\left(k_{0}+1\right)}\int_{0}^{t}s_{1}\int_{0}^{s_{1}}\ldots s_{k_{0}}\int_{0}^{s_{k_{0}}}\left|\mathcal{E}_{0}\left(s_{k_{0}+1}\right)\right|^{2}ds_{k_{0}+1}ds_{k_{0}}\ldots ds_{1}.

Hence, we complete Step 2.

Step 3: By (V.4), observe that 0sksk1s1t0\leq s_{k}\leq s_{k-1}\leq\ldots\leq s_{1}\leq t. Combining this, (V.4) and the fact that RC1R\in C^{1} gives

|k(t)|2\displaystyle\left|\mathcal{E}_{k}\left(t\right)\right|^{2} (M+γnμγ)2ktk+1max0tT|0(t)|20ts10s1sk10sk1𝑑sk𝑑sk1𝑑s1\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2k}t^{k+1}\max_{0\leq t\leq T}\left|\mathcal{E}_{0}\left(t\right)\right|^{2}\int_{0}^{t}s_{1}\int_{0}^{s_{1}}\ldots s_{k-1}\int_{0}^{s_{k-1}}ds_{k}ds_{k-1}\ldots ds_{1}
(M+γnμγ)2ktk+1k!max0tT|0(t)|2.\displaystyle\leq\left(M+\gamma n\mu-\gamma\right)^{2k}\frac{t^{k+1}}{k!}\max_{0\leq t\leq T}\left|\mathcal{E}_{0}\left(t\right)\right|^{2}.

Note that we have the kk and time independence of M+γnμγM+\gamma n\mu-\gamma and tTt\leq T. Moreover, we know that 0(t)=R0(t)R(t)=R(t)\mathcal{E}_{0}\left(t\right)=R_{0}\left(t\right)-R\left(t\right)=-R\left(t\right) by the choice R0(t)=0R_{0}\left(t\right)=0. Therefore, in view of the fact that limkQkk!=0\lim_{k\to\infty}\frac{Q^{k}}{k!}=0 for any constant Q>0Q>0, we can always find k¯>0\overline{k}>0 such that for any kk¯k\geq\overline{k},

(M+γnμγ)2kTk+1k!<1.\left(M+\gamma n\mu-\gamma\right)^{2k}\frac{T^{k+1}}{k!}<1.

Hence, we obtain the strong convergence of the sequence {Rk}k=0\left\{R_{k}\right\}_{k=0}^{\infty} toward the true solution RR.

Proof of Corollary 4

We define k(t)=Rk(t)R(t)\mathcal{E}_{k}\left(t\right)=R_{k}\left(t\right)-R\left(t\right) and p(r)=g(r)Mrp\left(r\right)=g\left(r\right)-Mr as above. Multiplying (V.1) by k(t)\mathcal{E}_{k}\left(t\right) and using (V.2) yield

12ddtk2(t)+Mk2(t)=[p(R(t))p(Rk1(t))]k(t)M+γnμγ2k12(t)+M+γnμγ2k2(t).\frac{1}{2}\frac{d}{dt}\mathcal{E}_{k}^{2}\left(t\right)+M\mathcal{E}_{k}^{2}\left(t\right)=\left[p\left(R\left(t\right)\right)-p\left(R_{k-1}\left(t\right)\right)\right]\mathcal{E}_{k}\left(t\right)\leq\frac{M+\gamma n\mu-\gamma}{2}\mathcal{E}_{k-1}^{2}\left(t\right)+\frac{M+\gamma n\mu-\gamma}{2}\mathcal{E}_{k}^{2}\left(t\right).

Equivalently, we obtain

ddtk2(t)+(Mγnμ+γ)k2(t)(M+γnμγ)k12(t).\frac{d}{dt}\mathcal{E}_{k}^{2}\left(t\right)+\left(M-\gamma n\mu+\gamma\right)\mathcal{E}_{k}^{2}\left(t\right)\leq\left(M+\gamma n\mu-\gamma\right)\mathcal{E}_{k-1}^{2}\left(t\right).

Notice that by the choice MγM\geq\gamma, it holds true that M>γnμγM>\gamma n\mu-\gamma when nμ<1n\mu<1. Using the integrating factor e(Mγnμ+γ)te^{\left(M-\gamma n\mu+\gamma\right)t} and taking integration with respect to tt, we get

k2(t)\displaystyle\mathcal{E}_{k}^{2}\left(t\right) e(Mγnμ+γ)t(M+γnμγ)0te(Mγnμ+γ)sk12(s)𝑑s\displaystyle\leq e^{-\left(M-\gamma n\mu+\gamma\right)t}\left(M+\gamma n\mu-\gamma\right)\int_{0}^{t}e^{\left(M-\gamma n\mu+\gamma\right)s}\mathcal{E}_{k-1}^{2}\left(s\right)ds
e(Mγnμ+γ)t[e(Mγnμ+γ)t1]M+γnμγMγnμ+γmax0tTk12(t).\displaystyle\leq e^{-\left(M-\gamma n\mu+\gamma\right)t}\left[e^{\left(M-\gamma n\mu+\gamma\right)t}-1\right]\frac{M+\gamma n\mu-\gamma}{M-\gamma n\mu+\gamma}\max_{0\leq t\leq T}\mathcal{E}_{k-1}^{2}\left(t\right).

Henceforth, we obtain

max0tT|k(t)|(M+γnμγMγnμ+γ)1/2max0tT|k1(t)|.\max_{0\leq t\leq T}\left|\mathcal{E}_{k}\left(t\right)\right|\leq\left(\frac{M+\gamma n\mu-\gamma}{M-\gamma n\mu+\gamma}\right)^{1/2}\max_{0\leq t\leq T}\left|\mathcal{E}_{k-1}\left(t\right)\right|. (V.5)

By induction and the fact that R0(t)=0R_{0}\left(t\right)=0, we deduce

max0tT|k(t)|(M+γnμγMγnμ+γ)k/2max0tT|0(t)|=(M+γnμγMγnμ+γ)k/2max0tT|R(t)|.\max_{0\leq t\leq T}\left|\mathcal{E}_{k}\left(t\right)\right|\leq\left(\frac{M+\gamma n\mu-\gamma}{M-\gamma n\mu+\gamma}\right)^{k/2}\max_{0\leq t\leq T}\left|\mathcal{E}_{0}\left(t\right)\right|=\left(\frac{M+\gamma n\mu-\gamma}{M-\gamma n\mu+\gamma}\right)^{k/2}\max_{0\leq t\leq T}\left|R\left(t\right)\right|.

Since M+γnμγ<Mγnμ+γM+\gamma n\mu-\gamma<M-\gamma n\mu+\gamma when nμ<1n\mu<1, we obtain the target estimate (II.6).

References

  • [1] N. T. J. Bailey. The mathematical theory of infectious diseases and its applications. Griffin, 1975.
  • [2] N. S. Barlow and S. J. Weinstein. Accurate closed-form solution of the SIR epidemic model. Physica D: Nonlinear Phenomena, 408:132540, 2020.
  • [3] G. Bärwolff. Modeling of COVID-19 propagation with compartment models. Mathematische Semesterberichte, 68(2):181–219, 2021.
  • [4] J. Caldwell and D. K. S. Ng. Mathematical Modelling: Case Studies and Projects. Springer, 2004.
  • [5] Y. Chakir. Global approximate solution of SIR epidemic model with constant vaccination strategy. Chaos, Solitons & Fractals, 169:113323, 2023.
  • [6] D. Conte, N. Guarinoa, G. Paganoa, and B. Paternoster. Positivity-preserving and elementary stable nonstandard methodfor a COVID-19 SIR model. Dolomites Research Notes on Approximation, 15:65–77, 2022.
  • [7] D. J. D. Earn, J. Dushoff, and S. A. Levin. Ecology and evolution of the flu. Trends in Ecology & Evolution, 17(7):334–340, 2002.
  • [8] E. Hairer, S. P. Nørsett, and G. Wanner. Solving Ordinary Differential Equations I: Nonstiff Problems. Springer Berlin Heidelberg, 2008.
  • [9] T. Harko, F. S. N. Lobo, and M. K. Mak. Exact analytical solutions of the Susceptible-Infected-Recovered (SIR) epidemic model and of the SIR model with equal death and birth rates. Applied Mathematics and Computation, 236:184–194, 2014.
  • [10] W. O. Kermack and A. G. McKendrick. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character, 115(772):700–721, 1927.
  • [11] A. Khaleque and P. Sen. An empirical analysis of the Ebola outbreak in West Africa. Scientific Reports, 7(1), 2017.
  • [12] M. M. Khalsaraei, A. Shokri, H. Ramos, and S. Heydari. A positive and elementary stable nonstandard explicit scheme for a mathematical model of the influenza disease. Mathematics and Computers in Simulation, 182:397–410, 2021.
  • [13] V. A. Khoa, E. R. Ijioma, and N. N. Ngoc. Strong convergence of a linearization method for semi-linear elliptic equations with variable scaled production. Computational and Applied Mathematics, 39(4), 2020.
  • [14] V. A. Khoa, E. R. Ijioma, and N. N. Ngoc. Correction to: Strong convergence of a linearization method for semi-linear elliptic equations with variable scaled production. Computational and Applied Mathematics, 40(1), 2021.
  • [15] N. A. Kudryashov, M. A. Chmykhov, and M. Vigdorowitsch. Analytical features of the SIR model and their applications to COVID-19. Applied Mathematical Modelling, 90:466–473, 2021.
  • [16] B. F. Maier and D. Brockmann. Effective containment explains subexponential growth in recent confirmed COVID-19 cases in China. Science, 368(6492):742–746, 2020.
  • [17] O. D. Makinde. Adomian decomposition approach to a SIR epidemic model with constant vaccination strategy. Applied Mathematics and Computation, 184(2):842–848, 2007.
  • [18] R. E. Mickens. Numerical integration of population models satisfying conservation laws: NSFD methods. Journal of Biological Dynamics, 1(4):427–436, 2007.
  • [19] K. Mitra and I. S. Pop. A modified L-scheme to solve nonlinear diffusion problems. Computers & Mathematics with Applications, 77(6):1722–1738, 2019.
  • [20] W. Piyawong, E. H. Twizell, and A. B. Gumel. An unconditionally convergent finite-difference scheme for the SIR model. Applied Mathematics and Computation, 146(2-3):611–625, 2003.
  • [21] D. Prodanov. Comments on some analytical and numerical aspects of the SIR model. Applied Mathematical Modelling, 95:236–243, 2021.
  • [22] D. Prodanov. Asymptotic analysis of the SIR model and the Gompertz distribution. Journal of Computational and Applied Mathematics, 422:114901, 2023.
  • [23] S. Side, A. M. Utami, Sukarna, and M. I. Pratama. Numerical solution of SIR model for transmission of tuberculosis by Runge-Kutta method. Journal of Physics: Conference Series, 1040:012021, 2018.
  • [24] T. C. Sideris. Ordinary Differential Equations and Dynamical Systems. Atlantis Press, 2013.
  • [25] M. Slodicka. Error estimates of an efficient linearization scheme for a nonlinear elliptic problem with a nonlocal boundary condition. ESAIM: Mathematical Modelling and Numerical Analysis, 35(4):691–711, 2001.