Efficient relaxation scheme for the SIR and related compartmental models
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.
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 . Let be the time variable with being the final time of observations. We take into account the following functions:
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.1) |
Here, the following assumptions are considered.
(A1) The total population size is always , meaning that for all .
(A2) We know the infection rate from the infection process, and the removal rate from the removal process.
(A3) The initial conditions are , and .
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 . 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 be the reciprocal relative removal rate. By the second and third equations of system (I.1), we have
which leads to . Therefore, we arrive at
(II.1) |
To find , we set in (II.1) and use (A3). Indeed, by , we get and thus, deduce that
(II.2) |
Combining this and (A1), we derive the following nonlinear differential equation for :
(II.3) |
Remark.
To this end, the notation is used to denote the space of functions with continuous derivatives. For the particular space, it is the space of continuous functions on with the standard max norm.
Theorem 1.
Proof.
The positivity of and is guaranteed by the first and second equations of system (I.1), i.e.
Then, by the third equation of (I.1), the non-negativity of follows.
Cf. [24, Theorem 3.2], since the right hand side of (II.3) is globally Lipschitzian, the equation admits a unique local solution. Moreover, in view of the fact that for any , 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 . Thereby, the existence and uniqueness of follows. We also get the existence and uniqueness of 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 well in (II.3), then and will be well approximated via (II.2) and (I.1), respectively. Define for . We can rewrite (II.3) as
Remark.
By the first and second equations of the SIR system (I.1), we get
Therefore, using and , we find that . Equivalently, we deduce that
Since function for attains its maximum at , we can estimate the so-called amplitude, which is the maximum value of , in the following manner.
(II.4) |
II.2 Derivation and analysis of the numerical scheme
Let be a time-dependent sequence satisfying, for ,
(II.5) |
The sequence aims to approximate in (II.3) in the sense that will be close to as uniformly in time. The accompanying initial condition for equation (II.5) is for any . Since our approximate model performs as an iterative scheme, we need a starting point, . Here, we choose based on the initial condition of (cf. (A3)), which is the best information given to the sought .
Also, in (II.5), we introduce a -independent constant 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 in (II.5) with either or only the exponential term in being linearized.
Formulated below is the theorem showing that the scheme preserves the non-negativity of the removals over the relaxation process.
Theorem 2.
The sequence is a non-negativity-preserving scheme. Moreover, it holds true that for all ,
Proof.
We prove this theorem by induction. The statement holds true for . Indeed, since , the equation for reads as
Therefore, we get
Next, assume that the statement holds true for . We prove that it also holds true for . By (II.5), we have
Thus, we obtain As a by product, we can estimate that
Hence, we complete the proof of the theorem. ∎
In the following, we formulate the strong convergence result for the scheme . 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 . Such an estimation can merely be obtained by the aid of the non-negativity of the scheme.
Theorem 3.
Our theoretical finding below shows that when , the scheme converges faster than the case . The proof of the following corollary is also found in the Appendix.
Corollary 4.
Assume that . We can find a constant independent of such that the following error estimate holds true:
(II.6) |
As readily expected, for every step , 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
(II.7) |
leading to
By induction and by the choice , we can show that
Therefore, if we choose , then . Note that this bound is independent of . Thus, by Theorem 1, we get for any with, cf. (II.7), Theorem 2 and the choice ,
Furthermore, by differentiating both sides of (II.5) with respect to time, we can demonstrate that for any . Indeed,
This yields that , which is a -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 for being a fixed integer. Then, we set the mesh-point in time by for . We seek as a discrete solution to equation (II.5). By the standard Euler method, is determined by the following equation:
(II.8) |
By this way, the global error of the Euler method is attained in the sense that for every , there exists a constant such that
We accentuate that by the above analysis of , i.e. for any , the constant is independent of . Thus, by Theorem 3, we can estimate the distance between the discrete (approximate) solution and the true solution at each mesh-point,
(II.9) |
Remark.
We have the following remarks:
-
•
After obtaining the approximator for , we can compute using (II.2). Then, the approximate solution for can be determined using (A1), specifically .
-
•
Both and in (II.9) are independent of and . As a by product, our discrete relaxation scheme , as defined in (II.8), is globally strongly convergent in . Similar to the proof of Theorem 2, we can demonstrate that 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 . Among these, the Runge-Kutta method stands out as the most favorable choice, offering a convergence rate of order . 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 and for any . Therefore, we can show that globally converges to with a rate of ; cf. e.g. [8, Theorem 3.4] for the existing theory on the global convergence of the Runge-Kutta method. Note here that is the conventional Landau symbol.
-
•
Similar to (II.9), the convergence of the Runge-Kutta method remains unaffected by . Nevertheless, it is important to emphasize that this convergence is heavily contingent upon the upper bounds of the involved derivatives. Considering the boundedness of and 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 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
(III.1) |
where stands for the number of deceased people (after infection) at time . In (III.1), we make use of the following assumptions.
(B1) The total population size is always conserved with , meaning that for all .
(B2) We know the infection rate from the infection process, the removal rate from the removal process, and the death rate from the mortality process.
(B3) The initial conditions are , , and .
Remark.
Remark.
The SIRD model (III.1) resembles the SIRX model without containment rate. In the SIRX model, an additional class called “" 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 , the SIRX model without containment rate consideres 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 and the application of the relaxation scheme. From the second and third equations of system (III.1), we deduce that
(III.3) |
where we have recalled the reciprocal relative removal constant . Using the same way, the third and last equations of system (III.1) give
(III.4) |
by virtue of (cf. (B3)). Then, plugging (III.3), (III.4) and (B1) into the third equation of (III.1), we obtain the following differential equation for :
(III.5) |
Henceforth, our relaxation scheme in this case becomes
(III.6) |
where . Similar to the SIR model, here we rely on (B3) to choose for any as the initial condition and as the starting point.
By choosing , our sequence (defined in (III.6)) is non-negativity-preserving and globally strongly convergent to 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 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 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:
(III.7) |
In this perspective, we make use of the following assumptions.
(C1) The total population size is dependent of , i.e. . It can be computed that for some fixed .
(C2) We know the infection rate from the infection process, the removal rate from the removal process, and the death rate from the mortality process.
(C3) The initial conditions are , and . This implies that .
Similar to the classical SIR model, we seek the transcendental equation for prior to the application of our proposed numerical scheme. When doing so, we define and . By the second and third equations of system (III.7), we find that
(III.8) | ||||
(III.9) |
Therefore, we deduce that
(III.10) |
or equivalently, . Herewith, we have recalled the reciprocal relative removal rate . Henceforth, we have
(III.11) |
Since and by (D3), we find that . Moreover, by taking the derivative in time of (III.11), we arrive at
(III.12) |
Dividing both sides of (III.12) by , we find that
Then combining this with (III.10) and (III.11), we derive the following differential equation for :
or equivalently, . Thus, we obtain and
Together with the back-substitution , we thereby get . Now, we note that by (C1) and (C3), holds true for any . Plugging this into (III.9) and using the fact that , we derive the transcendental equation for as follows:
(III.13) |
By setting , our relaxation scheme for the SIR model with background mortality is structured by
(III.14) |
Similar to the above-mentioned SIR-based models, we choose for any as the initial condition and as the starting point, based on the fact that . Also, here we take to ensure the non-negativity preservation and global strong convergence of the sequence (defined in (III.14)) to the sought 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 . It is also worth mentioning that Theorem 1 remains true in this case, providing the global existence and uniqueness of 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 (referred to as ) can be found in [10, 4, 3]. In particular, it is of the following form:
(IV.1) |
where
The approximate analytic solution mentioned above corresponds to the solution of the Riccati equation. However, it is applicable only when is sufficiently small. Furthermore, the conventional explicit Euler method is expressed as follows:
(IV.2) |
where is the discrete solution to the nonlinear differential equation (II.3) for 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 :
(IV.3) |
where we have denoted the intermediate values by
(IV.4) | ||||
(IV.5) | ||||
(IV.6) | ||||
(IV.7) |
When using our method, it is important to note that for each iteration , we solve the linear differential equation , where . Notice that in this equation, the presence of the midpoint , applied to obtained from the previous step, leads to the following linear approximation:
(IV.8) |
Denote this approximation by . Thereby, we seek satisfying (IV.3) in which the intermediate values are given by
(IV.9) | ||||
(IV.10) | ||||
(IV.11) | ||||
(IV.12) |
On the other hand, when directly applying the Runge-Kutta RK4 method to the nonlinear differential equation (II.3), we have .
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.
- 2.
To evaluate the accuracy of the relaxation scheme, we assess the proximity of the approximation when approaching the maximum value of . It is important to recall that explicit expressions for 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 cannot be found explicitly, we run the simulation with several values of and 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 presented in (II.4) and the peak day.
Here, we consider a population sample of for the SIR model (I.1) over the course of one year (). Initially, we assume that there are infected people in this sample, leaving individuals susceptible to infection. Furthermore, we choose a removal rate of and an infection rate of . With these choices, we obtain a reciprocal relative removal rate of , indicating that . Additionally, for our relaxation process, we set .
Method # | 1 | 1 | 2 | 2 | 3 | 4 | 4 |
---|---|---|---|---|---|---|---|
# of time step | None | ||||||
# of iteration | 5 | 50 | 2 | 4 | None | None | None |
Amplitude | 797 | 800 | 800 | 800 | 755 | 793 | 800 |
Peak day | 25 | 23 | 138 | 35 | 114 | 32 | 25 |
Our numerical results for Test 1 are presented in Table 1. Based on the maximum amplitude (), 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 and . Remarkably, when and , our method yields an value of 797, which is very close to the true value of 800 as shown in (II.4). In contrast, the obtained from the approximate analytic solution (method #3) shows a significant deviation. We also observe that the amplitude obtained from method #3 remains unaffected regardless of the choice of .
A comparison between methods #1 and #2 reveals that while the regular linearization technique can provide a satisfactory estimate of (800 when considering and ), method #2 suffers from severe numerical instability as illustrated in the second row of Figure IV.1, particularly when increasing to obtain a more accurate graphical representation.
Furthermore, when and 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 to 1000, both methods #1 (with an increased ) 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 () is attained on the 24th day by employing sufficiently large values of (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 and , 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 , 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.







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 and a transmission rate of . Assuming the initial infected population is , and the removal rate remains constant at throughout the entire six-month period (), we can calculate that the simulated disease reaches its peak at ; cf. (II.4). Moreover, based on numerical observations with a sufficiently large value of (>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 (), method #5 with yields an amplitude 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 , a larger value than in Test 1, due to the larger population under consideration. Cf. Theorem 3, the choice of does affect our error estimation which heavily depends on the total size of the removal population.
We also see that when increasing to 2000, our proposed method #5 with an increased precisely achieves the true amplitude, , 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 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 () and the true peak day of 73, at least and 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 | ||||||
# of iteration | 20 | 50 | None | None | 20 | 50 |
Amplitude | 51295165 | 51367769 | 50948480 | 51367765 | 51341234 | 51367573 |
Peak day | 72 | 73 | 72 | 73 | 54 | 72 |






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 , , , , . In the SIRD model (III.1), we choose a death rate of , which implies a choice of the relaxation parameter . In the SIR model with background mortality (III.7), we use the background death of and select .
Our numerical findings for the SIRD model are detailed in Figure IV.3. We specifically investigate the scenario where , thereby contravening the relaxation condition (). Consistent with our theorem concerning non-negativity preservation, we observe that the relaxed solution with , 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 (a case that adheres to the condition), we also note that the RK4-relaxation outperforms the Euler-relaxation approach. Given the (as formulated in (III.2)), and with a coarse mesh of and , 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 and .




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 from to .
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 and 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 and . In contrast, the Euler framework demands a minimum of and for similar outcomes.




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 for . It follows from (II.5) and (II.3) that satisfies the following differential equation:
(V.1) |
where we have denoted for . Herewith, by Theorems 1 and 2, we are allowed to consider . We can compute that . Then, for and since , we estimate that
which shows
(V.2) |
Therefore, the left-hand side of (V.1) can be bounded from above by
Using the Hölder inequality, we find that
Thus, we deduce that
By the elementary inequality , we obtain the following estimate
(V.3) |
Step 2: By induction, we can show that for any
(V.4) |
It follows from (V.3) that (V.4) holds true for . Indeed,
Assume that (V.4) holds true for . We show that it also holds true for . By (V.3), we have
Hence, we complete Step 2.
Step 3: By (V.4), observe that . Combining this, (V.4) and the fact that gives
Note that we have the and time independence of and . Moreover, we know that by the choice . Therefore, in view of the fact that for any constant , we can always find such that for any ,
Hence, we obtain the strong convergence of the sequence toward the true solution .
Proof of Corollary 4
We define and as above. Multiplying (V.1) by and using (V.2) yield
Equivalently, we obtain
Notice that by the choice , it holds true that when . Using the integrating factor and taking integration with respect to , we get
Henceforth, we obtain
(V.5) |
By induction and the fact that , we deduce
Since when , 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.