 Open access

# On New High Order Iterative Schemes for Solving Initial Value Problems in Epidemiology

Written By

Sandile Motsa and Stanford Shateyi

Submitted: November 17th, 2011 Published: September 19th, 2012

DOI: 10.5772/48264

From the Edited Volume

## Numerical Simulation

Edited by Mykhaylo Andriychuk

Chapter metrics overview

View Full Metrics

## 1. Introduction

Most problems arising from mathematical epidemiology are often described in terms of differential equations. However, it is often very difficult to obtain closed form solutions of such equations, especially those that are nonlinear. In most cases, attempts are made to obtain only approximate or numerical solutions. In this work, we revisit the SIR epidemic model with constant vaccination strategy that was considered in , where the Adomian decomposition method was used to solve the governing system of nonlinear initial value differential equations.

In this work we develop new accurate iterative schemes which are based on extending Taylor series based linearization method to obtain accurate and fast converging sequence of hybrid iteration schemes. At first order, the hybrid iteration scheme reduces to quasilinearization method (QLM) which was originally developed in . More recently Mandelzweig and his co-workers [8–10] have extended the application of the QLM to a wide variety of nonlinear BVPs and established that the method converges quadratically. In this work we demonstrate that the proposed hybrid iteration schemes are more accurate and converge faster than the QLM approach.

To implement the method we consider the SIR model that describes the temporal dynamics of a childhood disease in the presence of a preventive vaccine. In SIR models the population is assumed to be divided into the standard three classes namely, the susceptibles (S), who can catch the infection but are so far uninfected, the infectives (I), those who have the disease and can transmit it to the susceptibles, and the removed (R), who have either died or who have recovered and are therefore immune.

The governing equations for the problem are described  by

dSdt =(1P)πNβSINμS,E1
dIdt =βSIN(κ+μ)I,E2
dRdt =PπN+κIμR,E3

whereS(t), I(t) and R(t) denote the susceptibles, infectives and the removed classes respectively.

The total population is denoted by N = S + I + R, μ is the death rate, P is the fraction of citizens vaccinated at birth each year, β is the average contact rate, π is the constant birth rate, and κ is the rate at which an individual recovers from the disease and enters the removed group which also contains vaccinated individuals. Equations (1 - 3) are solved using the new hybrid iteration schemes and the results are compared with results from the Runge-Kutta MATLAB in-built solver ode45.

## 2. Numerical solution

To simplify the formulation of the solution, equations (1) - (3) are scaled by dividing by N. We define new variables z1 = S/N, z2 = I/N and z3 = R/N. This leads to z1 + z2 + z3 = 1 and if we assume that π = μ, the scaled new system becomes

z1(t)=(1P)πβz1(t)z2(t)πz1(t),z1(0)=s0,E4
z2(t)=βz1(t)z2(t)(π+κ)z2(t),z2(0)=i0,E5

wheres0 and i0 are given constants. The solution for z3(t) can be obtained from z3 = 1−z1z2.

Previous studies [47, 12] have shown that the long term behaviour of systems like (4) - (5) can be classified into two categories namely, endemic or eradication. From the long term behaviour of z1(t) and z2(t) it holds that the solution asymptotically approaches a disease free equilibrium (DFE) or the endemic equilibrium (EE) where

limt+(z1(t),z2(t)) =DFE=(1P,0),E6
limt+(z1(t),z2(t)) =EE=(1PRv,πβ(Rv1)).E7

Here Rv, the vaccination reproduction number, is the threshold that determines the stability of the equilibria and is defined by

Rv=β(1P)γ+π.E8

It was shown in  that the DFE is locally stable if Rv<1 and the EE is locally stable provided 1 <Rv≤ 4(κ + π)/π. In this work, we use develop new iteration schemes to solve the system (4) - (5) using parameters that yield both the DFE and EE.

## 3. Method of solution

To develop the method of solution, we assume that the true solution of (4 - 5) is zs,α(s = 1, 2) and zs,γare the initial approximations. We introduce the following coupled system,

Ljzj+fj(z1,γ,z2,γ)+s=12(zszs,γ)fjzs(z1,γ,z2,γ)+gj(z1,z2)=Ψj,E9
gj(z1,z2)=fj(z1,z2)fj(z1,γ,z2,γ)s=12(zszs,γ)fjzs(z1,γ,z2,γ),E10

where

L1z1=z1+πz1,L2z2=z2+(π+κ)z2,E11
f1(z1,z2)=βz1z2,f2(z1,z2)=βz1z2,Ψ1=(1P)π,Ψ2=0.E12

This idea of introducing the coupled equations of the form (9-10) have previously been used in  the construction of Newton-like iteration formulae for the computation of the solutions of nonlinear equations of the form f (x) = 0.

We write equation (9) as

Ljzj+s=12zsfjzs(z1,γ,z2,γ)+gj(z1,z2)=Φj(z1,γ,z2,γ),E13

where

Φj(z1,γ,z2,γ)=Ψj+s=12zs,γfjzs(z1,γ,z2,γ)fj(z1,γ,z2,γ).E14

We use the quasilinearization method (QLM) of Bellman and Kalaba  to solve equation (13). The QLM determines the (i+ 1)th iterative approximation zj,i+1 as the solution of the differential equation

Ljzj,i+1+s=12zs,i+1fjzs(z1,γ,z2,γ)+gj(z1,i,z2,i)+s=12(zs,i+1zs,i)gjzs(z1,i,z2,i)=Φj(z1,γ,z2,γ),E15

which can be written as

Ljzj,i+1+s=12[fjzs(z1,γ,z2,γ)+gjzs(z1,i,z2,i)]zs,i+1=s=12zs,igjzs(z1,i,z2,i)gj(z1,i,z2,i)+Φj(z1,γ,z2,γ),E16

subject to

z1,i+1=s0,z2,i+1=i0.E17

We assume that zj,0is obtained as a solution of the linear part of equation (13) given by

Ljzj,0+s=12zs,0fjzs(z1,γ,z2,γ)=Φj(z1,γ,z2,γ),E18

which yields the iteration scheme

Ljzj,r+1+s=12zs,r+1fjzs(z1,r,z2,r)=Φj(z1,r,z2,r).E19

We note that equation (19) is the standard QLM iteration scheme for solving (4 - 5).

When i= 0 in (16) we can approximate zjas

zjzj,1.E20

Thus, setting i= 0 in (16) we obtain

Ljzj,1+s=12[fjzs(z1,γ,z2,γ)+gjzs(z1,0,z2,0)]zs,1=s=12zs,0gjzs(z1,0,z2,0)gj(z1,0,z2,0)+Φj(z1,γ,z2,γ),E21

which yields the iteration scheme

Ljzj,r+1+s=12[fjzs(z1,r,z2,r)+gjzs(z1,r+1(0),z2,r+1(0))]zs,r+1=s=12zs,r+1(0)gjzs(z1,r+1(0),z2,r+1(0))gj(z1,r+1(0),z2,r+1(0))+Φj(z1,r,z2,r),E22

wherezj,r+1(0)is the solution of

Ljzj,r+1(0)+s=12zs,r+1(0)fjzs(z1,r,z2,r)=Φj(z1,r,z2,r).E23

The general iteration scheme obtained by setting i= m (m ≥ 2) in equation (16), hereinafter referred to as scheme-m is

Ljzj,r+1+s=12[fjzs(z1,r,z2,r)+gjzs(z1,r+1(m1),z2,r+1(m1))]zs,r+1=s=12zs,r+1(m1)gjzs(z1,r+1(m1),z2,r+1(m1))gj(z1,r+1(m1),z2,r+1(m1))+Φj(z1,r,z2,r),E24

wherezj,r+1(m1)is obtained as the solution of

Ljzj,r+1(m1)+s=12[fjzs(z1,r,z2,r)+gjzs(z1,r+1(m2),z2,r+1(m2))]zs,r+1(m1)=s=12zs,r+1(m2)gjzs(z1,r+1(m2),z2,r+1(m2))gj(z1,r+1(m2),z2,r+1(m2))+Φj(z1,r,z2,r).E25

The initial approximation for solving the iteration algorithms, scheme-m is obtained by solving the linear part of the governing equations (4 - 5). This gives

z1,0=(1P)(1eπt)+s0eπt,z2,0=i0e(π+κ)t.E26

The iteration schemes (19),(24 - 25) can be solved numerically using standard methods such as finite difference, finite elements, spline collocation methods,etc. In this study we use the Chebyshev spectral collocation method to solve the iteration schemes. For brevity, we omit the details of the spectralmethods, and refer interested readers to ([2, 13]). Before applying the spectral method, it is convenient to transform the domain on which the governing equation is defined to the interval [-1,1] on which the spectral method can be implemented. We use the transformation t = tF(τ + 1)/2 to map the interval [0, tF] to [-1,1], where tFis a finite time. The basic idea behind the spectral collocation method is the introduction of a differentiation matrix D which is used to approximate the derivatives of the unknown variables z at the collocation points as the matrix vector product

dzdt=k=0NDjkz(τk)=DZ,j=0,1,,N,E27

whereN + 1 is the number of collocation points (grid points), D = 2D/tF, and Z = [z(τ0), z(τ1),..., z(τN)]Tis the vector function at the collocation points τj.

Applying the Chebyshev spectral method to (19), for instance, gives

where

aji=fiziE28

andI is an (N + 1) × (N + 1) identity matrix.

## 4. Results and discussion

In this section we present the results of solving the governing equations (4-5) using the iteration scheme-m. For illustration purposeswe present the results for m = 0, 1, 2 to illustrate the effect of increasing m in the accuracy and convergence of the iteration schemes. The number of collocations points in all the results presented here is N = 40. In order to assess the accuracy of the proposed method, the present numerical results were compared against results generated using the MATLAB initial value solver ode45. In the numerical simulations presented here, following , the governing parameters were carefully selected in order to represent the cases which give rise to both the disease free equilibrium (DFE) and endemic equilibrium (EE).We consider the following cases

1. Case 1: s0 = 1, i0 = 0, β = 0.8, κ = 0.03, π = 0.4, P = 0.9.

In this case we observe that Rv= 0.186 <1, hence we expect the disease to be eradicated from the population after some time.

2. Case 2: s0 = 0.8, i0 = 0.2 β = 0.8, κ = 0.03, π = 0.4, P = 0.9.

In this case we observe that Rv= 0.186 <1 and as expected, using these parameters, the disease should be eradicated as t → ∞.

3. Case 3: s0 = 0.8, i0 = 0.2 β = 0.8, κ = 0.03, π = 0.4, P = 0.

In this caseRv= 1.86 >1 which leads to the endemic equilibrium (no disease eradication).

4. Case 4: s0 = 0.8, i0 = 0.2 β = 0.8, κ = 0.03, π = 0.4, P = 0.3.

In this case Rv= 1.32 >1 which leads to the endemic equilibrium (no disease eradication).

The results for Case 1 are shown on Figs. 1 - 2. In this case, the initial guess and the first few iterations match the numerical solution all the iterative schemes in the plots of s(t), r(t). We observe that s(t) decreases monotonically with time while r(t) increases with time. The graph of the profile for i(t) is not shown because i(t) = 0 in this particular case. Figure 1.Case 1: Comparison of the numerical solution of the population fractions s(t) against the results from the iteration schemes-0, 1 and 2 Figure 2.Case 1: Comparison of the numerical solution of the population fractions r(t) against the results from the iteration schemes-0, 1 and 2

Figs. 3 - 5 show the numerical approximation of the profiles of the different classes for Case 2. Again, all the iterative schemes rapidly converge to the numerical solution. The population of the susceptibles decreases with time and that of the removed (those recovered with immunity) increases with time. The infected population initially increases and reaches a maximum, then gradually decreases to zero as t → ∞. Figure 3.Case 2: Comparison of the numerical solution of the population fractions s(t) against the results from the iteration schemes-0, 1 and 2 Figure 4.Case 2: Comparison of the numerical solution of the population fractions i(t) against the results from the iteration schemes-0, 1 and 2 Figure 5.Case 2: Comparison of the numerical solution of the population fractions r(t) against the results from the iteration schemes-0, 1 and 2

Figs. 6 - 8 show the numerical approximation of the profiles of the different classes for Case 3. It can be noted from the graphs that the Scheme-2 converges fastest towards the numerical results. Only 10 iterations are required for full convergence in Scheme-2 compared to 14 iterations in Scheme-1 and 28 iterations in Scheme-1. Figure 6.Case 3: Comparison of the numerical solution of the population fractions s(t) against the results from the iteration schemes-0, 1 and 2 Figure 7.Case 3: Comparison of the numerical solution of the population fractions i(t) against the results from the iteration schemes-0, 1 and 2 Figure 8.Case 3: Comparison of the numerical solution of the population fractions r(t) against the results from the iteration schemes-0, 1 and 2

Figs. 8 - 11 shows the variation all the population groups with time for Case 4. Again, we observe that Scheme-2 converges fastest towards the numerical results. Only 5 iterations are required for full convergence in Scheme-2 compared to 6 iterations in Scheme-1 and 12 iterations in Scheme-1. Figure 9.Case 4: Comparison of the numerical solution of the population fractions s(t) against the results from the iteration schemes-0, 1 and 2 Figure 10.Case 4: Comparison of the numerical solution of the population fractions i(t) against the results from the iteration schemes-0, 1 and 2 Figure 11.Case 4: Comparison of the numerical solution of the population fractions r(t) against the results from the iteration schemes-0, 1 and 2