Skip to main content
Proceedings. Mathematical, Physical, and Engineering Sciences logoLink to Proceedings. Mathematical, Physical, and Engineering Sciences
. 2020 Feb 26;476(2234):20190673. doi: 10.1098/rspa.2019.0673

Nonlinear two-point boundary value problems: applications to a cholera epidemic model

Atiqur Chowdhury 1, Saleh Tanveer 2, Xueying Wang 3,
PMCID: PMC7069490  PMID: 32201479

Abstract

This paper is concerned primarily with constructive mathematical analysis of a general system of nonlinear two-point boundary value problem when an empirically constructed candidate for an approximate solution (quasi-solution) satisfies verifiable conditions. A local analysis in a neighbour- hood of a quasi-solution assures the existence and uniqueness of solutions and, at the same time, provides error bounds for approximate solutions. Applying this method to a cholera epidemic model, we obtain an analytical approximation of the steady-state solution with rigorous error bounds that also displays dependence on a parameter. In connection with this epidemic model, we also analyse the basic reproduction number, an important threshold quantity in the epidemiology context. Through a complex analytic approach, we determine the principal eigenvalue to be real and positive in a range of parameter values.

Keywords: quasi-solution, two-point boundary value problem, steady-state solution, basic reproduction number

1. Introduction

Nonlinear systems of two-point boundary value problem (BVP) are ubiquitous in applications. This paper primarily concerns a class of nonlinear two-point BVPs that arise as a steady state in a reaction–diffusion setting, though by no means limited to it. The approach relies on an empirically constructed analytical expression for a candidate approximate solution, henceforth referred to as a quasi-solution. By inverting the linearized operator about this quasi-solution, and checking appropriate conditions, it is possible to prove existence and uniqueness of solution in a local neighbourhood. Indeed, this has been the basis of a large number of computer-assisted proofs in modern literature (see for instance [15]). There are however a few instances [69] we know of where the quasi-solution is simple enough to allow checks of estimates with minimal or no computer assist. Here, we seek a transparent approach for a class of nonlinear two-point BVP in one dimension with a changing parameter. Though simpler than [15], the complexity is comparable to a PDE in two variables. For the specific BVP where we applied this method, computer assist is limited to products of polynomials in two variables of low order (at most 12), conversion into Chebyshev representations polynomials, and explicit integrations. Furthermore, using rational numbers, we avoid round-off errors.

We formulate the main theoretical result for a general BVP in theorem 2.4 in terms of explicit conditions that can be checked for a quasi-solution chosen for a specific BVP arising in an epidemic modelling of cholera [10] and other reaction–diffusion models in biology (e.g. [1115]).

A second mathematical problem analysed in this paper is specific to the the epidemiological model whose steady states have been analysed in the first part. This concerns the basic reproduction number R0, a most important threshold parameter for disease extinction in mathematical epidemiology [1619], which measures the expected number of the secondary infection produced by one primary case in an otherwise susceptible population. Recent work [10] shows that the mathematical problem can be reduced to a relatively simple eigenvalue problem of a linear two-point BVP. Though, theoretical expressions are relatively simple, a significant open problem addressed here in theorem 5.1 is whether (i) all eigenvalues are in the right half complex plane, (ii) the eigenvalue with the smallest real part is on the real axis. The basic reproduction number R0 is the reciprocal of the smallest eigenvalue, and therefore, it is important that these properties are displayed for any epidemiological model to be relevant. Computer assist in this case is limited to calculating exponential of matrices with fixed entries and their determinants, each of size 4 × 4, and calculation of roots of the low-order polynomials.

2. Constructive existence proof for a general system of nonlinear two-point boundary value problem

Consider the following two-point boundary value problem (BVP)

N(U):=U(τ)+AU(τ)+f(U)=0,τ(0,1)U(0)+B0U(0)=0,U(1)+B1U(1)=0, 2.1

where U:[0,1]Rn, A=diag[a11,a22,,ann] is a constant matrix1 of size n with ajj ≥ 0 for (j = 1, 2, …, n), B0 and B1 are constant diagonal matrices of size n with non-negative entries, and fC2(D) for DRn, an open bounded set, where D2 f is assumed bounded. We choose a smooth quasi-solution U0 ∈ C2 [0, 1] so that U0(τ)D for each τ ∈ [0, 1] and U0(0)+B0U0(0)=0, while errors ϵR and ϵB, defined in (2.6), are each small.2 We allow N,B0,B1,A,U0 to depend on some parameter ρ ∈ [ − 1, 1], though this dependence is suppressed, except when needed.

(a). Notations

  • (i)

    |U|:=U12+U22++Un2 for any vector U=(U1,U2,,Un)Rn.

  • (ii)

    |M|:=trace(MTM) is the L2 compatible matrix norm for an n × n real matrix M.

  • (iii)

    S denotes the Banach space of continuous real-valued vector functions on [0, 1] equipped with supremum norm ||F||S:=supτ[0,1]|F(τ)|, for any FS.

  • (iv)

    L0 = D f (U0) denotes the n × n matrix (Jacobian) function f at U0.

  • (v)
    For EC2([0,1],Rn), with ||E||S small enough to ensure U0(τ)+E(τ)D for each τ ∈ [0, 1], we define operators L and N1 as follows
    L[E]:=E+AE+L0EandN1[E]:=f(U0+E)f(U0)L0E. 2.2
  • (vi)
    Define functional F of any real-valued vector or matrix function gS:
    F[g]:=g(1)+B101g(s)ds. 2.3
    Remark 2.1. —
    It follows from above that
    |F[g]|(1+|B1|)||g||S. 2.4
  • (vii)
    We define operator G:SS such that
    G[r](τ):=E~(τ), 2.5
    where E~ satisfies LE~=r with E~(0)=E~(0)=0.

(b). Definitions

  • (i)
    ϵR and ϵB denote upper-bounds as follows:
    ||N[U0]||SϵR,|U0(1)+B1U0(1)|ϵB. 2.6
  • (ii)
    The (2n) × (2n) matrix Ψ (τ) associated with the linearized system of (2.1) at U0 is defined to be the unique solution of the following system
    Ψ+(0In×nL0A)Ψ=0,Ψ(0)=I2n×2n. 2.7
    Remark 2.2. —
    From the ordinary differential equation (ODE) theory, G[r](τ) is a vector function consisting of the last n components of the 2n-component vector
    Ψ(τ)0τΨ1(s)(0r(s))ds 2.8
  • (iii)
    For convenience, it is useful to define a fundamental matrix n × n matrix Φ related to Ψ as the unique solution to:
    LΦ=0,Φ(0)+B0Φ(0)=0,Φ(0)=In×n. 2.9
    A quasi-fundamental matrix Φ0 is chosen to satisfy ||LΦ0||=ϵϕ to be small, while satisfying the same initial conditions as Φ.
  • (iv)
    Define n × n matrices Q, Q0, depending on ρ alone, so that
    Q=F[Φ]+B1,Q0=F[(Φ0)]+B1. 2.10
    When Q is invertible, we define bound MQ satisfying
    |Q1|MQ. 2.11
  • (v)
    We define constants M and MG to be upper-bounds as follows
    ||Φ||SM,||G[r]||SMG||r||S. 2.12
  • (vi)
    For E,E1,E2Bρ0S, a closed ball of some radius ρ0 centred at the origin that ensures U0(τ)+E(τ)DRn, for each τ ∈ [0, 1], we define CN3 so that
    ||Df(U0+E)Df(U0)||SCN||E||S 2.13
    and
    ||N1[E]|12CN|E||S2,||N1[E1]N1[E2]||Sρ0CN||E1E2||S. 2.14

Remark 2.3. —

From (2.10), (2.4), (2.5) and (2.12), and the definition of Φ0, it follows that |QQ0|(1+|B1|)MGϵϕ, and hence when calculations show Q0 to be invertible, then Q will be invertible with

MQ|Q01|[1(1+|B1|MGϵϕ)]1,when(1+|B1|)MGϵϕ<1. 2.15

We will state the main theorem in this section and apply it to the epidemic model in §3.

Theorem 2.4. —

If for some choice of quasi-solution U0, Q0 is invertible and satisfies (2.15), and ϵR and ϵB are each small enough so that ϵ=MGϵR+MMQ[(1+|B1|)MGϵR+ϵB] satisfies

α:=2ϵCNMG(1+1M)2(1+MMQ(1+|B1|))<1, 2.16

then, there is a unique solution U to the two-point BVP (2.1) in a neighbourhood of quasi-solution U0 with

||U(τ)U0(τ)||S2ϵ,|U(0)U0(0)|2ϵM. 2.17

The proof of theorem 2.4 will have to await a few more lemmas.

It is clear from (2.2) that (2.1) is equivalent to the following two-point BVP for E = U − U0:

LE=N[U0]N1[E],0<τ<1E(0)+B0E(0)=0,E(1)+B1E(1)=U0(1)B1U0(1). 2.18

(c). Solution to boundary value problem (2.18)

Any small solution to (2.18) will necessarily be a solution to the initial value problem (IVP)

LE=N[U0]N1[E],E(0)+B0E(0)=0,E(0)=δ, 2.19

for some small δ. From ODE theory, for τ sufficiently small, a unique solution E to (2.19) is guaranteed when quasi-solution U0 is smooth. We want to show that this solution extends all the way to τ = 1 and remains small in the ||||S norm, when |δ | is sufficiently small, and there is a unique δ in some ball of Rn that ensures that E satisfies the boundary condition of (2.18) at τ = 1. In the following, we derive an integral reformulation of the two-point BVP (2.18) that will involve both ES and δRn.

Let E~=EΦδ. Clearly, LE~=r with E~(0)=E~(0)=0. Hence, it follows from the ODE theory and definition of operator G in (2.5) that the initial value problem (IVP) (2.19) is equivalent to the nonlinear integral equation

E(τ)=Φ(τ)δG[N[U0]](τ)G[N1[E]](τ), 2.20

where E is considered known in terms of E through the relation

E(τ)=δ+0τE(τ)dτ. 2.21

Equation (2.21) implies

||E||S|δ|+||E||S. 2.22

Now, consider the boundary condition on the right end; i.e. E(1)+B1E(1)=U0(1)B1U0(1), which from definition of functional F becomes

F[E]+B1δ=U0(1)B1U0(1). 2.23

Substituting (2.20) into (2.23) and using functional F and matrix Q in (2.3) and (2.10), (2.23) becomes

Qδ=F[G[N[U0]+N1[E]]]U0(1)B1U0(1). 2.24

When Q is invertible, as is ensured when (2.15) holds, (2.24) is equivalent to

δ=δ(0)+Q1F[GN1[E]]=:M2[E,δ], 2.25

where

δ(0)=Q1F[G[N[U0]]]Q1[U0(1)+B1U0(1)]. 2.26

as far as nonlinear On substituting the right-hand side of (2.25) in (2.20), we obtain

E=E(0)G[N1[E]]+ΦQ1F[GN1[E]]=:M1[E,δ], 2.27

where

E(0)(τ)=G[N[U0]](τ)+Φ(τ)δ(0). 2.28

Equation (2.27) and (2.25) determine (E,δ)S×Rn as shall be seen shortly. It is clear from the derivation that as long as Q is invertible, finding such solution is equivalent to finding a solution to the original two-point BVP. Indeed, the arguments above allow us to conclude the following proposition.

Proposition 2.5. —

If Q0 is invertible and satisfies (2.15), then the BVP (2.18) is equivalent to (E, E (0)) satisfying (2.27) and (2.25), where δ ≡ E(0).

Lemma 2.6. —

δ(0) defined in (2.26) satisfies the following bound

|δ(0)|MQ{(1+|B1|)MGϵR+ϵB}. 2.29

Proof. —

The proof follows from the expression in (2.26) using bounds on Q1, F, G, N[U0] and U0(1)+B1U0(1) (see (2.6), (2.11), (2.4) and (2.12)). ▪

Lemma 2.7. —

For ϵ defined in theorem 2.4, E(0) defined in (2.28) satisfies

||E(0)||Sϵ. 2.30

Proof. —

From expression (2.28), the proof follows from bounds in δ(0) in lemma (2.6), and the bounds on N[U0] and Φ in (2.6) and (2.11), respectively. ▪

Definition 2.8. —

We define χ=(E,δ)S×Rn and define a norm in this space

||χ||=max{||E||S,M|δ|}. 2.31

We define an operator M:S×RnS×Rn so that

M[χ]=(M1[E,δ],M2[E,δ]), 2.32

where M1:S×RnS and M2:S×RnRn are defined by (2.27) and (2.25).

Then, by above definition, equations (2.27) and (2.25) for (E, δ) can be written abstractly as χ=M[χ].

Proof of theorem 2.4. —

It suffices to show that M:B2ϵB2ϵ is contractive. For that purpose, applying bounds for Φ, G, Q1, F and N1 (see (2.14)) and using (2.30) and (2.16), (2.27) lead to

||M1[E,δ]||Sϵ+12MGCN[1+MMQ(1+|B1|)](||E||S+|δ|)2ϵ+2MGCN[1+MMQ(1+|B1|)]ϵ2(1+1M)22ϵ,

where the last inequality is obtained from assumption (2.16). Likewise, using definition (2.25), we find that

|M2[E,δ]|ϵM+2MQ(1+|B1|)MGCNϵ2(1+1M)22ϵM, 2.33

which immediately implies from definition of |||| that M:B2ϵB2ϵ. Now, consider two different χ1=(E1,δ1) and χ2=(E2,δ2) in B2ϵS×Rn. We first note that

||Ei||S||Ei||S+|δi|2ϵ(1+1M),i=1,2,

and

||E1E2||S||E1E2||S+|δ1δ2|(1+1M)||χ1χ2||.

By (2.2) and (2.13),

||EiN1[Ei]||S=||Df(U0+Ei)Df(U0)||SCN||Ei||S,i=1,2,

It then follows from (2.14) that

||N1[E1]N1[E2]||S2CNϵ(1+1M)2||χ1χ2||.

Therefore, from (2.27), we have

||M1[E1,δ1]M1[E2,δ2]||S2CNϵMG(1+1M)2(1+MMQ[1+|B1|])||χ1χ2||,

whereas from (2.25), we have

|M2[E1,δ1]M2[E2,δ2]|n2CNϵMG(1+1M)2MQ[1+|B1|]||χ1χ2||. 2.34

It follows immediately from definition of norm |||| in S×Rn that

||M[χ1]M[χ1]||α||χ1χ2|| 2.35

and hence M:B2ϵB2ϵ is contractive. Theorem 2.4 follows from the Banach Contraction Theorem. ▪

3. Determining quasi-solution, ϵR, ϵB, M, MG and MQ

Determining quasi-solution based on numerical solutions is fairly straight forward, and one can use a number of different basis. In the simplest case, we can consider a discrete set ρ = ρm ∈ [ − 1, 1], and for each such ρ = ρm, numerically determine the solution to the two-point BVP at a set of discrete points τl ∈ [0, 1]. We employ a polynomial or Chebyshev fit procedure involving Tj (ρ) Tk (2τ − 1) basis, using numerical values of U, U to determine U′′ = −A U − f (U), which leads to

U0(τ;ρ)=j=0Nτk=0Nρuj,kτjρk, 3.1

where uj,kRn are constants. We may choose each entry of uj,k to be a rational number to avoid round-off errors. Independently, numerical solution at τ = 0 at a sequence of ρ values as above, is used to determine u^k in the representation

U0(0;ρ)=k=0NBu^kρj. 3.2

Using boundary conditions (3.2) and U0(0)=B0U0(0), we determine expression U0 that satisfies the left boundary condition exactly. Expression for quasi-fundamental matrix Φ0 (τ;ρ) is determined in a similar manner, and each column can be generated through an ODE solver for IVP and use of polynomial fit, as for (3.1).

Without much loss of generality,4 we assume that f(U) is either a polynomial or rational function. To determine residual bounds ϵR rigorously, we multiply the i-th scalar component of (2.1), call it ei, by a non-negative5 polynomial Pi (U1, U2, …, Un) so that Pi ei is a polynomial in U1, U2, …, Un, where U = (U1, …, Un). Therefore, substituting U = U0, obtained from integrating (3.1), will necessarily result in a polynomial in τ, ρ whose Chebyshev representation is

Pi(U0)ei(U0)=j=0N~k=0M~rj,kiTj(2τ1)Tk(ρ)

from which it follows that

||Pi(U0)ei(U0)||Sj=0N~k=0M~|rj,ki|.

We then determine lower bounds on Pi once again by using usual minimization in calculus on a low order polynomial approximation in τ and ρ, if necessary by breaking up into smaller subintervals, and using Chebyshev representation to bound the rest. This process leads to determination of bounds on ϵR:=||N[U0]||. The same process may be followed to find bound for ϵϕ:=||LΦ0||. To find ϵB, we substitute U0 and its derivative at τ = 1, use Chebyshev representation in ρ, and add absolute value of all coefficients.

It is clear that finding explicit fundamental solution Φ for a non-constant system of arbitrary order ODEs is not possible. The purpose of this section is to show that this is not needed. An ‘energy type’ argument combined with introduction of a ‘cumulative norm’ that has been used earlier in a scalar context [20] may be modified to find bounds upper M and MG on Φ and operator G:=ddτL1 respectively. This is crucial in checking that the conditions of theorem 2.4 apply.

Here we seek to determine bounds for Φ and operator G. For that purpose, we pose the IVP:

LE:=E+AE+L0E=r,withE(0)=δ,E(0)=B0δ. 3.3

with initial value Taking inner-product of (3.3) with E, we obtain

12ddτE,E+E,AE+E,L0E=E,r. 3.4

Write E = (ϵ1, ϵ2, …, ϵn)T. Then (3.4) can be written as

12ddτ(i=1nϵi2)+i=1naiiϵi2+E,L0E=E,r. 3.5

Integration of (3.4) results in

12i=1nϵi2=12δTB0TB0δi=1naii0τ|ϵi(s)|2ds0τE(s),L0(E(s)E(0))ds0τE(s),L0δ+0τE(s),r(s)ds. 3.6

Since aii ≥ 0 for all 1 ≤ i ≤ n, we have

12|E(τ)|212|B0|2|δ|2+0τ|L0(s)||E(s)||E(s)E(0)|ds+|δ|0τ|L0(s)||E(s)|ds+0τ|E(s)||r(s)|ds, 3.7

where the last inequality is obtained from Cauchy–Schwartz inequality. Note we can determine E in terms of E through integration

E(τ)=E(0)+0τE(s)ds. 3.8

In what follows, we will determine constants MG and M, which are an upper bound for the operators G and Φ defined in (2.9) and (2.5), respectively.

(a). Finding bound MG

In this case, we have zero boundary conditions on the left and so (3.7) implies

12|E(τ)|20τ|L0(s)||E(s)||E(s)|ds+0τ|E(s)||r(s)|.ds 3.9

Define

D(τ)=sups[0,τ]|E(s)|. 3.10

We notice

|E(τ)E(0)|τD(τ),|E(τ)|D(τ),τ0. 3.11

Then, using (3.8) in (3.9), we obtain

12|E(τ)|20τ|L0(s)|sD2(s)ds+0τD(s)|r(s)|ds0τ(s|L0(s)|+12)D2(s)ds+120τr2(s)ds, 3.12

for any 0 ≤ τ ≤ τ′ ≤ 1. Since the right-hand side of (3.12) is independent of τ, by taking the supremum over all possible 0 ≤ τ ≤ τ′ of the left-hand side of (3.12), we immediately obtain

12D2(τ)0τ(s|L0(s)|+12)D2(s)ds+120τr2(s)ds 3.13

Gronwall’s Lemma immediately implies that

D2(τ)0τexp[sτ(1+2s|L0(s)|)ds]r2(s)ds, 3.14

implying

D(1)exp[01s|L0(s)|ds](e1)||r||S. 3.15

Therefore, it follows from (2.12) that

MG(e1)exp[01s|L0(s)|ds]. 3.16

(b). Calculation of M

In this case, we need to set r = 0 and allow for inhomogeneous boundary condition at τ = 0. Returning to (3.7), we now obtain

|E(τ)|2|B0|2|δ|2+0τ2s|L0(s)|D2(s)ds+2|δ|0τ|L0(s)|D(s)ds|B0|2|δ|2+0τ(2s+1)|L0(s)|D2(s)ds+|δ|20τ|L0(s)|ds 3.17

for 0 ≤ τ ≤ τ′. It follows that

D2(τ)α(τ)+0τβ(s)D2(s)ds, 3.18

where

β(τ)=(2τ+1)|L0(τ)|,α(τ)=|δ|2(0τ|L0(s)|ds+|B0|2). 3.19

From Gronwall’s leads to

D2(τ)α(τ)+0τα(s)β(s)exp[sτβ(s)ds]. 3.20

On integration by parts, and using definition of α, β we obtain

D2(τ)|δ|2{exp[0τ(2s+1)|L0(s)|ds](|B0|2+1)1}. 3.21

It follows that

Mexp[01(2s+1)|L0(s)|ds](|B0|2+1)1. 3.22

Remark 3.1. —

In estimating MG, M in (3.16) and (3.22), if L0 = p(s)/q(s) for polynomial p, q with scalar q > 0, we note

012s|L0(s)|ds1qm01s|p(s)|2ds,01|L0(s)|ds1qm01|p0(s)|2ds, 3.23

where qm = min s∈[0,1] q(s). Integrals of Euclidean norm | p (s) |2 is explicit even when dependence on ρ is a polynomial. When needed, breaking up the integrals into subintervals affords sharper bounds.

(c). Calculation of MQ

Recall expression of MQ in (2.15). However, to apply this we need bounds on |Q01|. Since quasi-solution procedure leaves us with Q0 a polynomial in ρ, directly determining uniform bounds on |Q01| becomes more difficult. Instead, using numerical inverse Q01 at a finite set of ρ values in [ − 1, 1] and using polynomial fit, we determine empirically a matrix polynomial QI for which multiplication confirms that QE,I:=QIQ0I is small through a Chebyshev representation of each entry and addition of absolute value of coefficients. Then, it follows that

Q01=(I+QE,I)1QI,implying||Q01||||QI||1||QE,I||. 3.24

Using (3.24) in (2.15), we determine invertibility of Q and bound MQ. In principle, this procedure will work for any ρ ∈ [ − 1, 1], except at bifurcation point(s) where Q is necessarily singular. This is because quasi-fundamental matrix Φ0 may be constructed to approximate Φ to any desired accuracy, though accuracy demands are unrealistic when too close to a bifurcation point.

4. Cholera model and steady-state solution

Let’s consider a cholera partial differential equation (PDE) model along a theoretical river that was proposed in [21] and studied in [10,22,23].

St=Λβ1SIβ2SBB+KdS+σR+D12Sx2,0<x<L,t>0,It=β1SI+β2SBB+K(d+γ)I+D22Ix2,0<x<L,t>0,Rt=γI(d+σ)R+D32Rx2,0<x<L,t>0andBt=ξI+gB(1BKB)δBvBx+D42Bx2,0<x<L,t>0,} 4.1

with no flux boundary condition

Sx(x,t)=Ix(x,t)=Rx(x,t)=D4Bx(x,t)vB(x,t)=0,x=0,L,t>0,

and the initial condition S(x, 0), I(x, 0), R(x, 0), B(x,0)C([0,L],R+).

Here x ∈ [0, L] is the position variable and t ≥ 0 is the time variable. x = 0 and L represent two ends of the river. S = S(x, t), I = I(x, t), and R = R(x, t) measure the density of susceptible, infectious, and recovered human hosts at location x and time t, respectively. B = B(x, t) denotes the concentration of cholera in the water environment. Λ is the influx of susceptible humans. β1 and β2 represent direct (i.e. human-to-human) and indirect (i.e. environment-to-human) transmission rates, respectively. Di (1 ≤ i ≤ 4) is the diffusion coefficient of S, I, R and B, respectively. v is the convection coefficient depicting the drift for vibrio’s transport. d is the natural death rate of human hosts. σ is the rate at which recovered individuals lose immunity, γ represents the recovery rate of infectious hosts, and ξ denotes the time-dependent shedding rate of bacteria by infectious human hosts, and δ is the natural death rate of the bacteria. K is the half saturation rate that describes the infectious dose in water sufficient to produce disease in 50% of those exposed. KB is the maximal capacity of pathogen in water environment. The base values of these parameters are taken from [21], and D2 = D4 = 1 and v = 0.1 are assumed.

In this section, we apply the theory developed in §23 to find accurate analytic approximations to the steady-state solution of cholera model (4.1). Consider the steady-state solution (S~,I~,R~,B~) of model (4.1). With τ=1xL and scaling as follows:

S~(x)=Λd(1+S(τ)),I~(x)=β2ΛL2dD2I(τ),R~(x)=β2ΛL2γdD2(d+σ)R(τ),B~(x)=KB(τ) 4.2

the steady-state equations reduce to

c1S(τ)n2I(τ)(1+S(τ))[n2B(τ)(1+S(τ))][1+B(τ)]+c2R(τ)+S(τ)=0,c3I(τ)+n3S(τ)I(τ)+[n2B(τ)(1+S(τ))][1+B(τ)]+I(τ)=0,c4R(τ)+c4I(τ)+R(τ)=0andn4(B(τ))2+c5B(τ)+c6I(τ)+c7B(τ)+B(τ)=0,} 4.3

with the two-point boundary conditions S ′(τ) = I′ (τ) = R′ (τ) = B′ (τ) + c7 B(τ) = 0 for τ = 0, 1. where

c1=dL2D1,n1=ΛL4β1β2D1D2d,n2=β2L2D1,c2=σγβ2L4D1D2(σ+d),c3=β1ΛL2dD2(d+γ)L2D2,n3=n1n2,c4=(d+σ)L2D3,n4=KgL2D4Kb,c5=(gδ)L2D4,c6=ξL4β2ΛKD4D2d,c7=νLD4.} 4.4

We have now reduced the problem to 10 independent non-dimensional parameters c1, …, c7, n1, n2 and n4 (note n3 = n1/n2 is not independent). It is clear that if we define vector

U=(S,I,R,B)T, 4.5

then equation (4.3) takes the form (2.1). where n = 4, and ajj = 0 for j = 1, 2, 3, but a44 = c7. In our case the matrices B0 and B1 are also the same as A. The vector function f(U) in this case is given by

f(U)=(c1U1n1U2(1+U1)n2U4(1+U1)1+U4+c2U3c3U2+n3U1U2+U4(1+U1)(U4+1)c4U3+c4U2n4U42+c5U4+c6U2). 4.6

We notice that if we write U = U0 + E, the linearization of f(U) at U = U0 is given by L0 E, where L0 is in general an n × n matrix coming from calculation of Jacobian of f(U) at U = U0. In our case with

U0=(U10,U20,U30,U40)=(s0,i0,r0,b0),

and we have

L0=(c1n1U20n2U401+U40n1(1+U10)c2n2(1+U10)(1+U40)2n3U20+U40(1+U40)c3+n3U100(1+U10)(1+U40)20c4c400c60c52n4U40). 4.7

We also have for any U, the following expression that is useful in estimating CN in (2.13)–(2.14)

j,k,m=14|UkUm2fj(U)|2=4n42+4(1+U1)2(1+U4)6+2(1+U4)4+2n32+4n22(1+U1)2(1+U4)6+2n22(1+U4)4+2n12. 4.8

In epidemic dynamics of cholera, the dependence of steady state on ν, and hence on non-dimensional c7. We choose to explore the range:

c7=11+9ρ40,forρ[1,1], 4.9

all other parameters c1, c2, c3, c4, c5, c6, n1, n2, n3, n4 are constants in table 1.

Following the procedure outlined in the last section, we determined a suitable quasi-solution in the form

S0(τ,ρ)=k=06sk0ρk+j=07k=06sj,k(j+1)(j+2)ρkτj+2,I0(τ,ρ)=k=06ik0ρk+j=07k=06ij,k(j+1)(j+2)ρkτj+2,R0(τ,ρ)=k=06rk0ρk+j=07k=06rj,k(j+1)(j+2)ρkτj+2andB0(τ,ρ)=(k=010bk0ρk)(1c7(ρ)τ)+j=010k=010bj,k(j+1)(j+2)ρkτj+2.} 4.10

where coefficients of (4.10) are provided in tables 3 and 4. In a similar manner, the quasi-fundamental matrix Φ0 listed in section 1 of the electronic supplementary material.

(a). Checking conditions of theorem 2.4

First, we determined CN in (2.13) satisfies CN ≤ 2.114, computed from expression (4.8) for given values of parameter n1, n2, n3, n4 in table 1, when U0,U0+ED6 chosen to be

D:={UR4:0<1+U1<15,U4>13}.

Demonstrating U0D was based on extremizing a low-order polynomial approximation of U0 in τ and ρ and noting small bounds for the remaining terms through Chebyshev representation. The 2ϵ bound quoted below on ||E|| was more than sufficient to ensure U0(τ)+E(τ)D for each τ ∈ [0, 1].

Using procedures described in the previous section, also we determined ϵR ≤ 1.29 × 10−11, ϵB ≤ 5.35 × 10−13, ϵϕ1.001×106 and ϵ ≤ 1.324 × 10−6. We calculated the bounds M and MG based in (3.22) and (3.16) as a function of ρ and using Chebyshev representation in ρ of exponents (see remark 3.23 for integration) able to conclude MG2.53, and M ≤ 3.18. Using quasi-fundamental solution Φ0 given in section 1 of the electronic supplementary material, through a process described in the last section, we determined for any ρ ∈ [ − 1, 1], MQ6178, which gave rise to α = 0.529, enough for contractivity condition in theorem 2.4, with quasi-solution having 1.94 × 10−6 accuracy. More details appear in the electronic supplementary material.

5. Basic reproduction number

The basic reproduction number R0 is an important threshold quantity for disease extinction and persistence. By [10], R0 of our model can be characterized as the principal eigenvalue of the following problem.

D2ψI(x)+(d+γ)ψI=λN(β1ψI+β2/KψB),0<x<L,D4ψB(x)+vψB(x)+δψB=λ(ξψI+gψB),0<x<LψI(x)=0,x=0,L,and(D4ψB(x)vψB)(x)=0,x=0,L,} 5.1

where N = Λ/d.

We rescale (5.1) by introducing non-dimensional parameters as follows: p1 = (d + γ)/(D2/L2); p2 = 1/(D2/L2); p3 = 2/(D2K/L2); p4 = ν/(D4/L2); p5 = δ/(D4/L2); p6 = ξ/(D4/L2); p7 = g/(D4/L2); τ = 1 − x/L. Then equation (5.1) becomes

ψI(τ)p1ψI(τ)=λ(p2ψI(τ)p3ψB(τ)),0<τ<1,ψB(τ)+p4ψB(τ)p5ψB(τ)=λ(p6ψI(τ)p7ψB(τ)),0<τ<1,ψI(τ)=0,τ=0,1,andψB(τ)+p4ψB(τ)=0,τ=0,1.} 5.2

Theorem 5.1. —

For parameter p7 ∈ I7 = [0.01, 0.3] and other parameter values listed in table 2, the following statements hold: (1) All eigenvalues λH+, the right half complex plane. (2) The eigenvalue with the smallest real part λ0R+. (3) Furthermore, for p7{p7,j}j=160I7, the corresponding basic reproduction number R0=1/λ0 is within 10−8 of the computed values {R0,j}j=160, where {(p7,j,R0,j)}j=160 is listed at the end of section 5 of the electronic supplementary material (graphically represented in red stars in figure 1). Furthermore, there is a smooth curve R0(p7) that interpolates between these point values.

Figure 1.

Figure 1.

The basic reproduction number R0 as a function of the bacterial intrinsic growth rate g with g = p7. Let Δp7 denote the step size of the subsequent pj. In our case, Δp7 = 1/100 for p7 ∈ [0.01, 0.15], Δp7 = 1/200 for p7 ∈ [0.15, 0.25] and Δp7 = 1/500 for p7 ∈ [0.25, 0.3]. (a) 0.01 ≤ g ≤ 0.3. (b) 0.01 ≤ g ≤ 0.16. (Online version in colour.)

Remark 5.2. —

The proof of theorem 5.1 will have to await some preliminary results, and is given at the end of this section.

(a). A priori bounds on eigenvalues

In (5.2), we shall assume that D = p2 p7 − p3 p6 > 0, a necessary condition for the associated time evolution problem to be well-posed. This condition holds for parameter values listed in table 2.

Lemma 5.3. —

For D = p2 p7 − p3 p6 > 0, and for any choice of positive α, ϵj for j = 1, …6 that ensures the following conditions,

4(p7ϵ12αp3p4)(p2ϵ22p2p4)4p3p6(αp3p6α)2>0,

and then with any γ > 0 chosen small enough to assure

4(p712[ϵ1+ϵ6γ]αp3p4)(p212[ϵ2+ϵ5γ]p2p4)>(αp3+p6α+γ|αp3p6α|)2,

any eigenvalue λC is restricted to the region:

Dλmin{p2p5α2ϵ1p3p412ϵ2p2p4ϵ32(αp5p3+p1p6α),p7p112ϵ3(αp3p5+p6p1α)},Dγ|λ|Dλ+μ, 5.3

where

μ=max{p2p5+α2ϵ1p3p4+12ϵ2p2p4+ϵ32(αp5p3+p1p6α)+γ2ϵ6αp3p4+γ2ϵ5p2p4+ϵ72γ(|αp5p3p6p1α|),p7p1+12ϵ3(αp3p5+p6p1α)+12ϵ7γ(|αp5p3p6p1α|)}.

Proof. —

First, we derive from (5.2) an equivalent set of two equations where λ appears exclusively as λDψI in one equation and λDψB in the other. A routine application of ‘energy method’ on a rescaled variables (αψI, ψB) results in the above inequalities. Details appear in section 3 of the electronic supplementary material. ▪

(b). Direct calculation of eigenvalues using matrix exponential

With y=(ψI,ψI,ψB,ψB), equation (5.2) can be written as a system of first-order ODE

y=My,By[0]=0=By[1], 5.4

where

M=M(λ)=(0100p1λp20λp300001λp60p5λp7p4),B=(010000p41).

Since the general solution to y = M y is y(τ) = eτM y0, by enforcing the boundary conditions in (5.4), it follows eigenvalue λ is determined by

0=detG=det(BBeM)=p42(E2,1E3,4E2,4E3,1)+p4(E2,1E4,4E2,4E4,1+E2,3E3,1E2,1E3,3)+E2,3E4,1E2,1E4,3, 5.5

where Ej,k are the (j, k)-th entry of eM.

Lemma 5.4. (A priori bound on detG) —

For any λcC and r > 0, if |λ − λc | ≤ r and p7I:=[p7,m,p7,M], we have the following a priori bound

|detG|p42(E2,10E3,40+E2,40E3,10)+p4(E2,10E4,40+E2,40E4,10+E2,30E3,10+E2,10E3,30)+E2,30E4,10+E2,10E4,30=:Dλc,r,

where Ei,j0 are the (i, j)th entry of the matrix eM0 with

M0=(0100|p1λcp2|+rp20p3|λc|+rp300001rp6+|λc|p60M0,4,3p4)withM0,4,3=supp7I7sup|λλc|=r|p5λp7|.

Proof. —

Since the detG(λ) is an analytic function of λ, it is enough to check that the bounds hold on |λ − λc | = r, where on inspection. We notice that the (i, j) entry of M is bounded above by the (i, j)-th entry of matrix M0. Since matrix multiplication involves addition and multiplication operation, using triangular inequality, it follows that for all k ≥ 0, |[Mk]i,j|[M0k]i,j and therefore,

|Ei,j|Ei,j0:=[eM0]i,j. 5.6

Using this bound in (5.5), lemma 5.4 follows. ▪

Lemma 5.5. (A priori bound on p7 det G) —

For any λcC and r > 0, if |λ − λc | ≤ r and p7 ∈ I7 : = [p7,m, p7,M], we have the following a priori bound

|ddp7detG|α7=(|λc|+r)p42[(B2,1E3,40+E2,10B3,4+B2,4E3,10E2,40B3,1)+p4(B2,1E4,40+E2,10B4,4+B2,4E4,10+E2,40B4,1+B2,3E3,10+E2,30B3,1+B2,1E3,30+E2,10B3,3)+B2,3E4,10+E2,30B4,1+B2,1E4,30+E2,10B4,3], 5.7

where Bi,j=Ei,40E3,j0.

Proof. —

We first note that

p7M=λS,

where S = (Sij)4×4 with Sij = 1 for (i, j) = (4, 3) and zero otherwise.

It follows that

p7Mk=λj=0k1Mkj1SMj, 5.8

and hence

p7eM=λk=11k!n=0k1Mkn1SMn=λn=0(k=n+1Mkn1k!)SMn. 5.9

Since [M0]i,j ≥ | Mi,j | and n!l!(n+l)!1, it follows that

|p7Ei,j||λ|[n=0(l=0M0ll!)SM0nn!]i,j=[|λ|eM0SeM0]i,j=:|λ|Bi,j, 5.10

where Bi,j=Ei,40E3,j0, Therefore, our assertion follows by using (5.10) in p7detG obtained from (5.5). ▪

Corollary 5.6. —

If |λ − λc | ≤ q r for 0 < q < 1, and p7 ∈ I7, then for any integer k ≥ 0,

1k!|dkdλkdetG(λ)|1(1q)krkDλc,r. 5.11

In particular

1k!|dkdλkdetG(λc)|1rkDλc,r. 5.12

Proof. —

The first result follows from Cauchy integral formula for derivatives of analytic function detG. Taking the limit of q → 0+ in (5.11), we get the second result. ▪

Corollary 5.7. —

If |λ − λc | ≤ q r for 0 < q < 1, and p7 ∈ I7, then for any integer k ≥ 0,

1k!|k+1λkp7detG(λ)|1rk(1q)kα7. 5.13

In particular

1k!|kλkp7detG(λc)|1rkα7. 5.14

Proof. —

Recognizing the analyticity of (/p7)detG(λ;p7) in λ, in |λ − λc | ≤ r with bound α7 in lemma 5.5 on the outer boundary, the proof parallels the one in corollary 5.6. ▪

The following lemma gives error bounds on a polynomial approximation of detG(λ) based on the convergent Taylor expansion

detG(λ)=m=0Am(λλc)m,Am=1m!dmdλmdetG(λc). 5.15

The following result is obtained from direct calculation. The detailed proof for lemma 5.8 is provided in section 4 of the electronic supplementary material.

Lemma 5.8. —

Let NZ+ and 0 < q < 1. Define zj = λc + q r ei2πj/N.

A^m:=1Nj=0N1detG(zj)(zjλc)m.

Define polynomial

PN(λ)=m=0N1A^m(λλc)m. 5.16

Then, for |λ − λc | ≤ q r,

|detG(λ)PN(λ)|Dλc,r{qN(1q)(1+qN)+qN1q},|ddλ[detG(λ)PN(λ)]|1rDλc,r{qN(1qN)(m=1N1mqm1)+m=Nmqm1}.

Proof. —

Using (5.15) in (5.4), calculation shows that A^mAm=l=1Am+lN. The rest follows from using expressions for detG and pN in (5.15) and (5.16) and using bounds on Am available in (5.12). ▪

Remark 5.9. —

If for fixed p7 ∈ I7 and some q ∈ [0, 1) on |λ − λc | = q r, | (d/dλ)PN (λ) | ≥ mP > 0, and the error bounds in lemma 5.8 show |(d/dλ)detG(d/dλ)PN|(mP/2), then triangular inequality implies |(d/dλ)detG|(mP/2).

Lemma 5.10. —

If on the circle |λ − λc | ≤ q r for some 0 < q < 1, at some p7,0 ∈ I7,

|λdetG(λ,p7,0)|2mD>0.

Then, for p7 ∈ I7 satisfying |p7p7,0|mDr(1q)α7,

|λdetG(λ,p7)|mD. 5.17

Proof. —

By using corollary 5.7, and applying condition, from the mean value inequality,

|λdetG(λ,p7)λdetG(λ,p7,0)|α7r(1q)|p7p7,0|mD. 5.18

The lemma readily follows from triangular inequality. ▪

Proof of theorem 5.1. —

Here we outline the proof; details including values of bounds, choices of points and circles are provided in the electronic supplementary material. Through calculation of detG on the real axis, we identified smallest positive real eigenvalues {λ0,j}j=1J to within 10−8 accuracy for p7{p7,j}j=1J, uniformly spaced out points in the interval I=[1100,310], with other parameter values shown in table 2. The eigenvalues and their accuracy are justified through intermediate value theorem through evaluation of detG, accounting also for any floating point errors in matrix exponential and determinants. The corresponding reproduction number R0,j = 1/λ0,j at p7,j is identified as red points in figure 1. Define Ij = [p7,j − ΔL, p7,j + ΔR] where ΔL=ΔR=Δ:=12|p7,jp7,j±1|, except for left- and right-most sub-interval where ΔL = 0 and ΔR = 0, respectively. Combining this result with a priori bounds in lemma 5.3 for p7 ∈ I, we conclude that the eigenvalue with the smallest algebraic real part is necessarily restricted to

T={{λC:1.065λ1.1,|λ|λ0.578+2.504},forp7[1100,110],{λC:0.3λ1,|λ|λ0.578+0.062},forp7[110,310]. 5.19

We choose a sequence of circles Kλc,m,r0={λC:|λλc,m|=rm} centred at {λc,m}m=1M so that its union contains T, with dist(λ0,j,Kλc,m,rm)0.1. We also ensured that there is one and only one circle with centre λc,mR contained computed λ0,j. For each Ij, a priori bounds on detG on Kλcm,3rm gives bounds on (d/dλ)detG on Kλc,m,2r0 from (5.11); together with evaluation of detG on uniformly spaced out points on this circle, we get bounds on detG. We use this in lemma 5.8 to identify low-order (at most 10) polynomials PN(λ;p7,j) that approximates detG at p7,j on or inside Kλcm,r0. Bounds on p7detG on this circle for each Ij was also calculated from lemma 5.5. We formed polynomial P~N=al=1N1(λλc,myl) by using numerical roots of PN; but expanding P~N and finding l1 bounds of all coefficients PNP~N helped determine rigorous bounds on P~NdetG on Kλcm,r0 for each p7,j. For λKλc,m,rm, we checked |P~N(λ;p7,j)detG(λ,p7,j)|+Δ|p7detG|<infλKλc,m,rm|P~N(λ;p7,j)| to conclude from Rouche’s theorem that detG(λ;p7) and P~N(λ;p7,j) have the same number of zeros for any p7 ∈ Ij, where the roots and lower bounds of P~N is manifest in in the product form. The number of zeros was found to be exactly one when λ0,j was inside the particular Kλc,m,r0 with real λc,m, and zero otherwise. By repeating this process for each Ij, we concluded statements (1) and (2) of theorem 5.1. Since there is only one zero of detG(λ,p7) when the circle Kλc,m,rm centred on real axis contained λ0,j and none otherwise, it follows that this root is real. This is because complex roots of detG come in conjugate pairs, and this root is not repeated either as Rouche’s theorem counts multiplicity. Therefore, (d/dλ)detG(λ,p7)0 at the root inside Kλc,m,rm for any p7 ∈ Ij inside that circle. Implicit function theorem applies and the real root λ = λ(p7) is smooth for p7 ∈ Ij, and this holds for any j. ▪

Applying theorem 5.1 and taking the reciprocal of the obtained principal eigenvalue give us the corresponding basic reproduction number. The result of the basic reproduction number as a function of p7 is shown in figure 1. Computational details are available in the electronic supplementary material and data file below.

Supplementary Material

Supporting information
rspa20190673supp1.pdf (376.8KB, pdf)

Acknowledgements

We thank the Mathematical Biosciences Institute where this research was initiated. We also thank anonymous reviewers and the editor for their suggestions that improved this paper.

Appendix A. Definition of model parameters

Please see tables 1 and 2.

Table 1.

The base values of dimensionless parameters in model (4.3), with c7[120,12].

c1 c2 c3 c4 c5 c6 n1 n2 n3 n4
14317550 6096200 257253460858309 21731755 115 2592874000000 4074514000000 340 135817100000 320

Table 2.

The base values of dimensionless parameters in (5.2), with p7[1100,310].

p1 p2 p3 p4 p5 p6
44471317550 2757920306 11771271024 110 730 7

Appendix B. Coefficients of analytical representation of the Quasi-solution (4.10)

{sk0}k=06=[18980472329137,3084129156532,1607236496045,41491212586487,10071462729593,325969990527,2533025052188]{ik0}k=06=[2879135412755,40969151261861,11117404602566,145592337941,2597215368604,3714158554642,4140243595661]{rk0}k=06=[60105311388691,603285970461,54118964957,4672108455476,47710687996313,3295212284693,18364327699753]{bk0}k=010=[402245721054,2982165488743,4354773914987,56585288992416,1993359445976,139160452001,651741506847,3910459524989,1149705391730,4265859699649,1840315061408].

Please see tables 3 and 4.

Table 3.

Definition of [[sj,k]k=06]j=07 , [[ij,k]k=06]j=07 and [[rj,k]k=06]j=07 from top to bottom.

j k = 0 k = 1 k = 2 k = 3 k = 4 k = 5 k = 6
0 6480150555970 20015599192 435101437472 8254538401 765801458263 114468723411 382783725253
1 21247242138050 16632225631 166171742008 126256336231 71549632889 115257507556 1215376631831
2 673667208340 176555336366 2397152791822 12141223297 731081239925 301924459519 74293364217
3 1308588039170 137355729611 1120122525273 352100984759 97420330720 381761067265 1110231437285
4 193398680230 478106208325 311248161066 275335024797 52502910865 301412787787 710585297781
5 7413015149300 245108648507 2841331376621 28817130373 811320887039 18787003223 197647574836
6 1575751307850 159516265709 1041237189983 8526371155054 311997993660 526012585717 53130767477
7 8014132868490 591217867661 72389204477 65743492525 524246954817 24395534015 419528401267
0 2320344990260 156953660593 7791139853866 3898334913 50267528253 1244184564263 58441949442
1 1302711134510 314763159379 462714988725 1867284870865 235136441011 341218568913 16716042987164
2 1887750437730 154314505495 1310952824000 11101285629523 361350171567 55294157576 8360023835
3 2020983052290 44472227866 215143146626 180537606878 425158798273 217775241818 412383937737
4 327087455110 869325491760 29123747360 1889122303421 355280915597 153510775156 6313175203483
5 4183303339080 559350922252 1390219708103 830293222439 336543605957 145464134737 17581449539
6 695532676560 103793853349 311564860216 97143529570 38287216463 1211059973818 1196377349999
7 6171962293660 256108096283 190789649851 50986995157 14311263869712 436609567596 2982963883
0 4541599808130 1058454013349 13618954923841 743957310998 233510087965 164263302316 11877939294039
1 17305210445940 1616437133028 18702598626226 14519807359420 135882683912148 141253455220601 149568983705593
2 910516699390 6458441070215 122641039253 64528939049 3453285633781 329441195530 1425240271688
3 13951046919830 1141100559516 151429502724 304041168263 6131196754109 252587224603 171544845170
4 16237583618510 305155816778 1821287359053 411866299411 1323176292442 674877173779 150766539429
5 2492989040960 195285558983 191117776856 162318184 1010267286459 254962003035 152683733253
6 12715592080890 7249786938087 165748335457 3310683132116 821978973755 1176626857217 177772174922
7 3518390470470 1258496084667 77115397586 422311021271 120598383276 1466722408362 1294184814471

Table 4.

Definition of [[bj,k]k=05]j=010 and [[bj,k]k=610]j=010 from top to bottom.

j k = 0 k = 1 k = 2 k = 3 k = 4 k = 5
0 344747147810 1166461484105 1054582986985 2878910931742 179531928008 2509280385992
1 13273046230830 2622645340407 329731068113 314553569546 1434525632822 1747108806108
2 2895128740620 529312528249 634714042859 388496941959 1407012866123 386768752358
3 10694047040 207553188578 224653612359 4513115748573 997114937808 374541715003
4 14443243233550 93415604937 42942244163 1287511235506 697318851845 8210134879851
5 3968312219850 828721191866 721814085809 11443111213 239115484849 68918415117
6 24221000881870 290134499270 731358150583 251724046903 201238124267 49429846553
7 15563446416130 33519727713 4901173112439 143353276668 38924463210 21335466491
8 53696885040 1558494999797 656113885809 673110879180 450109699709 461255145706
9 18116322756460 190391254741 61916519066043 365338380182 338419721451 285720009629
10 2829114196690 43965216757 87954073159 91837401944 72831681775 39856118722
j k = 6 k = 7 k = 8 k = 9 k = 10
0 66016491327610 31826869197 114561516678 640203534031 177645125759
1 4572557006840 87823020842 294099507521 23367289039 120826281786
2 20639307390400 44278640283 432884697509 710103649175 712671640160
3 3931198457750 142707032585 10523940913448 4717260006895 194459858327
4 12902400176110 871267101596 25674403386 8310450506542 412018944114
5 373839726510 113588590866 29213792624 13602049401 741285272475
6 4631607498950 5112672073064 4271696687751 391012201445 44437743297
7 41347057640 29287739839 37133130481 33767068937 43397614913
8 401163814470 381952075069 121677704859 13454890973 1161686786955
9 679873851120 535907566712 891471564260 515045041289 552384001572
10 911871106180 525271372316 141742233887 64227709909 134364459194

Footnotes

1

The proof given works for non-constant positive definite matrix A; it can be adapted to any non-constant bounded A at the cost of much larger bounds arising from Gronwall Lemma.

2

Smallness criteria is set in theorem 2.4.

3

Since CN is only a property of f and the set DRn, it does not depend on τ.

4

Every smooth function in bounded domain can approximate by a rational function.

5

Since by assumption f is smooth in D, it is clear that when it is rational in U, we can choose non-zero denominators, which without loss of generality will be positive.

6

D is tailored to contain U0 through verifiable bounds with enough margin to contain U0 + E for any E in theorem 2.4.

Data accessibility

The main numerical codes used are available at http://www.math.wsu.edu/faculty/xueying/publications/public/.

Authors' contributions

S.T. and X.W. devised the project, and wrote the paper. A.C. conducted numerical work.

Competing interests

We declare we have no competing interests.

Funding

S.T. and X.W. were partially supported by NSF-DMS-1515755 and a grant from Simons Foundation (grant no. 317407), respectively. S.T. also acknowledges support from the Isaac Newton Institute.

Reference

  • 1.Arioli G, Koch H. 2010. Computer-assisted methods for the study of stationary solutions in dissipative systems, applied to the Kuramoto-Sivashinski equation. Arch. Ration. Mech. Anal. 197, 1033–1051. ( 10.1007/s00205-010-0309-7) [DOI] [Google Scholar]
  • 2.Mischaikow, K, Zgliczynski P. 2001. Rigorous numerics for partial differential equations: the Kuramoto-Sivashinsky equation. Found. Comput. Math. 1, 255–288. ( 10.1007/s002080010010) [DOI] [Google Scholar]
  • 3.Zgliczynski P. 2002. Attracting fixed points for the Kuramoto-Sivashinsky equation. SIAM J. Appl. Dyn. Syst. 1, 215–235. ( 10.1137/S111111110240176X) [DOI] [Google Scholar]
  • 4.Zgliczynski P. 2004. Rigorous numerics for dissipative partial differential equations II. Periodic orbit for the Kuramoto-Sivashinsky PDE—a computer assisted proof. Found. Comput. Math. 4, 157–185. ( 10.1007/s10208-002-0080-8) [DOI] [Google Scholar]
  • 5.Gameiro M, Lessard J. 2017. A posteriori verification of invariant objects of evolution equations: periodic orbits in the Kuramoto-Sivashinsky PDE. SIAM J. Appl. Dyn. Syst. 16, 687–728. ( 10.1137/16M1073789) [DOI] [Google Scholar]
  • 6.Fraenkel L. 2007. A constructive existence proof for the extreme Stokes wave. Arch. Ration. Mech. Anal. 183, 187–214. ( 10.1007/s00205-006-0003-y) [DOI] [Google Scholar]
  • 7.Costin O, Huang M, Schlag W. 2012. On the spectral properties of L± in three dimensions. Nonlinearity 25, 125–164. ( 10.1088/0951-7715/25/1/125) [DOI] [Google Scholar]
  • 8.Costin O, Huang M, Tanveer S. 2014. Proof of the Dubrovin conjecture and analysis of the tritronquée solutions of P1. Duke Math. J. 163, 665–704. ( 10.1215/00127094-2429589) [DOI] [Google Scholar]
  • 9.Costin O, Donninger R, Glogic I, Huang M. 2016. On the stability of self-similar solutions to nonlinear wave equations. Commun. Math. Phys. 343, 299–310. ( 10.1007/s00220-016-2588-9) [DOI] [Google Scholar]
  • 10.Wang X, Zhao X-Q, Wang J. 2018. A cholera epidemic model in a spatiotemporally heterogeneous environment. J. Math. Anal. Appl. 468, 893–912. ( 10.1016/j.maa.2018.08.039) [DOI] [Google Scholar]
  • 11.Britton NF. 1986. Reaction-diffusion equations and their applications to biology. London, UK: Elsevier Academic Press. [Google Scholar]
  • 12.Allen LJ, Bolker BM, Lou Y, Nevai AL. 2008. Asymptotic profiles of the steady states for an SIS epidemic reaction-diffusion model. Discrete Contin. Dyn. Syst. Ser. A 21, 1–20. ( 10.3934/dcds.2008.21.1) [DOI] [Google Scholar]
  • 13.Ferreira SC Jr, Martins ML, Vilela MJ. 2002. Reaction-diffusion model for the growth of avascular tumor. Phys. Rev. E 65, 021907 ( 10.1103/PhysRevE.65.021907) [DOI] [PubMed] [Google Scholar]
  • 14.Kondo S, Miura T. 2010. Reaction-diffusion model as a framework for understanding biological pattern formation. Science 329, 1616–1620. ( 10.1126/science.1179047) [DOI] [PubMed] [Google Scholar]
  • 15.Hsu S-B, Wang F-B, Zhao X-Q. 2016. Global dynamics of zooplankton and harmful algae in owing habitats. J. Differ. Equ. 255, 265–297. ( 10.1016/j.jde.2013.04.006) [DOI] [Google Scholar]
  • 16.Diekmann O, Heesterbeek JAP. 2000. Mathematical epidemiology of infectious diseases: model building, analysis and interpretation. New York, NY: Wiley. [Google Scholar]
  • 17.Heffernan JM, Smith RJ, Wahl LM. 2005. Perspectives on the basic reproductive ratio. J. R. Soc. Interface 2, 281–293. ( 10.1098/rsif.2005.0042) [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 18.Anderson RM, May RM. 1991. Infectious diseases of humans: dynamics and control. Oxford, UK: Oxford University Press. [Google Scholar]
  • 19.Diekmann O, Heesterbeek JAP, Metz JAJ. 1990. On the definition and the computation of the basic reproduction ratio R0 in models for infectious diseases in heterogeneous populations. J. Math. Biol. 28, 365–382. ( 10.1007/BF00178324) [DOI] [PubMed] [Google Scholar]
  • 20.Costin O, Tanveer S. 2014. Analytical approximation of Blasius’ similarity solution with rigorous error bounds. SIAM J. Math. Anal. 46, 3782–3813. ( 10.1137/13091470X) [DOI] [Google Scholar]
  • 21.Wang X, Posny D, Wang J. 2016. A reaction-convection-diffusion model for cholera spatial dynamics. Discrete Continuous Dyn. Syst. Ser. B 21, 2785–2809. ( 10.3934/dcdsb.2016073) [DOI] [Google Scholar]
  • 22.Yamazaki K, Wang X. 2016. Global well-posedness and asymptotic behavior of solutions to a reaction-convection-diffusion cholera epidemic model. Discrete Continuous Dyn. Syst. Ser. B 21, 1297–1316. ( 10.3934/dcdsb.2016.21.1297) [DOI] [Google Scholar]
  • 23.Yamazaki K, Wang X. 2017. Global stability and uniform persistence of the reaction-convection-diffusion cholera epidemic model. Math. Biosci. Eng. 14, 559–579. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supporting information
rspa20190673supp1.pdf (376.8KB, pdf)

Data Availability Statement

The main numerical codes used are available at http://www.math.wsu.edu/faculty/xueying/publications/public/.


Articles from Proceedings. Mathematical, Physical, and Engineering Sciences are provided here courtesy of The Royal Society

RESOURCES