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 [1–5]). There are however a few instances [6–9] 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 [1–5], 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. [11–15]).
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 , a most important threshold parameter for disease extinction in mathematical epidemiology [16–19], 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 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)
| 2.1 |
where , is a constant matrix1 of size n with ajj ≥ 0 for (j = 1, 2, …, n), and are constant diagonal matrices of size n with non-negative entries, and for , an open bounded set, where D2 f is assumed bounded. We choose a smooth quasi-solution U0 ∈ C2 [0, 1] so that for each τ ∈ [0, 1] and , while errors ϵR and ϵB, defined in (2.6), are each small.2 We allow to depend on some parameter ρ ∈ [ − 1, 1], though this dependence is suppressed, except when needed.
(a). Notations
-
(i)
for any vector .
-
(ii)
is the L2 compatible matrix norm for an n × n real matrix M.
-
(iii)
denotes the Banach space of continuous real-valued vector functions on [0, 1] equipped with supremum norm , for any .
-
(iv)
L0 = D f (U0) denotes the n × n matrix (Jacobian) function f at U0.
-
(v)For , with small enough to ensure for each τ ∈ [0, 1], we define operators and as follows
2.2 -
(vi)Define functional of any real-valued vector or matrix function :
2.3 Remark 2.1. —
It follows from above that2.4 -
(vii)We define operator such that
where satisfies with .2.5
(b). Definitions
-
(i)ϵR and ϵB denote upper-bounds as follows:
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
2.7 Remark 2.2. —
From the ordinary differential equation (ODE) theory, is a vector function consisting of the last n components of the 2n-component vector2.8 -
(iii)For convenience, it is useful to define a fundamental matrix n × n matrix Φ related to Ψ as the unique solution to:
A quasi-fundamental matrix Φ0 is chosen to satisfy to be small, while satisfying the same initial conditions as Φ.2.9 -
(iv)Define n × n matrices , , depending on ρ alone, so that
2.10 When is invertible, we define bound satisfying2.11 -
(v)We define constants M and to be upper-bounds as follows
2.12 -
(vi)For , a closed ball of some radius ρ0 centred at the origin that ensures , for each τ ∈ [0, 1], we define CN 3 so that
and2.13 2.14
Remark 2.3. —
From (2.10), (2.4), (2.5) and (2.12), and the definition of Φ0, it follows that , and hence when calculations show to be invertible, then will be invertible with
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, is invertible and satisfies (2.15), and ϵR and ϵB are each small enough so that satisfies
2.16 then, there is a unique solution U to the two-point BVP (2.1) in a neighbourhood of quasi-solution U0 with
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:
| 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)
| 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 norm, when |δ | is sufficiently small, and there is a unique δ in some ball of 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 and
Let . Clearly, with . Hence, it follows from the ODE theory and definition of operator in (2.5) that the initial value problem (IVP) (2.19) is equivalent to the nonlinear integral equation
| 2.20 |
where E is considered known in terms of E′ through the relation
| 2.21 |
Equation (2.21) implies
| 2.22 |
Now, consider the boundary condition on the right end; i.e. , which from definition of functional becomes
| 2.23 |
Substituting (2.20) into (2.23) and using functional and matrix in (2.3) and (2.10), (2.23) becomes
| 2.24 |
When is invertible, as is ensured when (2.15) holds, (2.24) is equivalent to
| 2.25 |
where
| 2.26 |
as far as nonlinear On substituting the right-hand side of (2.25) in (2.20), we obtain
| 2.27 |
where
| 2.28 |
Equation (2.27) and (2.25) determine as shall be seen shortly. It is clear from the derivation that as long as 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 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
2.29
Proof. —
The proof follows from the expression in (2.26) using bounds on , , , and (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
2.30
Proof. —
From expression (2.28), the proof follows from bounds in δ(0) in lemma (2.6), and the bounds on and Φ′ in (2.6) and (2.11), respectively. ▪
Definition 2.8. —
We define and define a norm in this space
2.31 We define an operator so that
2.32
Then, by above definition, equations (2.27) and (2.25) for (E′, δ) can be written abstractly as .
Proof of theorem 2.4. —
It suffices to show that is contractive. For that purpose, applying bounds for Φ′, , , and (see (2.14)) and using (2.30) and (2.16), (2.27) lead to
where the last inequality is obtained from assumption (2.16). Likewise, using definition (2.25), we find that
2.33 which immediately implies from definition of that . Now, consider two different and in . We first note that
and
It then follows from (2.14) that
Therefore, from (2.27), we have
whereas from (2.25), we have
2.34 It follows immediately from definition of norm in that
2.35 and hence is contractive. Theorem 2.4 follows from the Banach Contraction Theorem. ▪
3. Determining quasi-solution, ϵR, ϵB, M, and
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
| 3.1 |
where 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 in the representation
| 3.2 |
Using boundary conditions (3.2) and , 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
from which it follows that
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 . The same process may be followed to find bound for . 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 on Φ′ and operator respectively. This is crucial in checking that the conditions of theorem 2.4 apply.
Here we seek to determine bounds for Φ′ and operator . For that purpose, we pose the IVP:
| 3.3 |
with initial value Taking inner-product of (3.3) with E′, we obtain
| 3.4 |
Write E′ = (ϵ1, ϵ2, …, ϵn)T. Then (3.4) can be written as
| 3.5 |
Integration of (3.4) results in
| 3.6 |
Since aii ≥ 0 for all 1 ≤ i ≤ n, we have
| 3.7 |
where the last inequality is obtained from Cauchy–Schwartz inequality. Note we can determine E in terms of E′ through integration
| 3.8 |
In what follows, we will determine constants and M, which are an upper bound for the operators and Φ′ defined in (2.9) and (2.5), respectively.
(a). Finding bound
In this case, we have zero boundary conditions on the left and so (3.7) implies
| 3.9 |
Define
| 3.10 |
We notice
| 3.11 |
Then, using (3.8) in (3.9), we obtain
| 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
| 3.13 |
Gronwall’s Lemma immediately implies that
| 3.14 |
implying
| 3.15 |
Therefore, it follows from (2.12) that
| 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
| 3.17 |
for 0 ≤ τ ≤ τ′. It follows that
| 3.18 |
where
| 3.19 |
From Gronwall’s leads to
| 3.20 |
On integration by parts, and using definition of α, β we obtain
| 3.21 |
It follows that
| 3.22 |
Remark 3.1. —
In estimating , M in (3.16) and (3.22), if L0 = p(s)/q(s) for polynomial p, q with scalar q > 0, we note
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
Recall expression of in (2.15). However, to apply this we need bounds on . Since quasi-solution procedure leaves us with a polynomial in ρ, directly determining uniform bounds on becomes more difficult. Instead, using numerical inverse at a finite set of ρ values in [ − 1, 1] and using polynomial fit, we determine empirically a matrix polynomial for which multiplication confirms that is small through a Chebyshev representation of each entry and addition of absolute value of coefficients. Then, it follows that
| 3.24 |
Using (3.24) in (2.15), we determine invertibility of and bound . In principle, this procedure will work for any ρ ∈ [ − 1, 1], except at bifurcation point(s) where 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].
| 4.1 |
with no flux boundary condition
and the initial condition S(x, 0), I(x, 0), R(x, 0), .
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 §2–3 to find accurate analytic approximations to the steady-state solution of cholera model (4.1). Consider the steady-state solution of model (4.1). With and scaling as follows:
| 4.2 |
the steady-state equations reduce to
| 4.3 |
with the two-point boundary conditions S ′(τ) = I′ (τ) = R′ (τ) = B′ (τ) + c7 B(τ) = 0 for τ = 0, 1. where
| 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
| 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 and are also the same as A. The vector function f(U) in this case is given by
| 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
and we have
| 4.7 |
We also have for any U, the following expression that is useful in estimating CN in (2.13)–(2.14)
| 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:
| 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
| 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 6 chosen to be
Demonstrating 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 was more than sufficient to ensure for each τ ∈ [0, 1].
Using procedures described in the previous section, also we determined ϵR ≤ 1.29 × 10−11, ϵB ≤ 5.35 × 10−13, and ϵ ≤ 1.324 × 10−6. We calculated the bounds M and 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 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], 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 is an important threshold quantity for disease extinction and persistence. By [10], of our model can be characterized as the principal eigenvalue of the following problem.
| 5.1 |
where N = Λ/d.
We rescale (5.1) by introducing non-dimensional parameters as follows: p1 = (d + γ)/(D2/L2); p2 = Nβ1/(D2/L2); p3 = Nβ2/(D2K/L2); p4 = ν/(D4/L2); p5 = δ/(D4/L2); p6 = ξ/(D4/L2); p7 = g/(D4/L2); τ = 1 − x/L. Then equation (5.1) becomes
| 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 , the right half complex plane. (2) The eigenvalue with the smallest real part . (3) Furthermore, for , the corresponding basic reproduction number is within 10−8 of the computed values , where 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 that interpolates between these point values.
Figure 1.
The basic reproduction number 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,
and then with any γ > 0 chosen small enough to assure
any eigenvalue is restricted to the region:
5.3 where
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 , equation (5.2) can be written as a system of first-order ODE
| 5.4 |
where
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
| 5.5 |
where Ej,k are the (j, k)-th entry of eM.
Lemma 5.4. (A priori bound on ) —
For any and r > 0, if |λ − λc | ≤ r and , we have the following a priori bound
where are the (i, j)th entry of the matrix with
Proof. —
Since the 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, and therefore,
5.6 Using this bound in (5.5), lemma 5.4 follows. ▪
Lemma 5.5. (A priori bound on det G) —
For any and r > 0, if |λ − λc | ≤ r and p7 ∈ I7 : = [p7,m, p7,M], we have the following a priori bound
5.7 where .
Proof. —
We first note that
where S = (Sij)4×4 with Sij = 1 for (i, j) = (4, 3) and zero otherwise.
It follows that
5.8 and hence
5.9 Since [M0]i,j ≥ | Mi,j | and , it follows that
5.10 where , Therefore, our assertion follows by using (5.10) in obtained from (5.5). ▪
Corollary 5.6. —
If |λ − λc | ≤ q r for 0 < q < 1, and p7 ∈ I7, then for any integer k ≥ 0,
5.11 In particular
5.12
Proof. —
The first result follows from Cauchy integral formula for derivatives of analytic function . 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,
5.13 In particular
5.14
Proof. —
Recognizing the analyticity of 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 based on the convergent Taylor expansion
| 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 and 0 < q < 1. Define zj = λc + q r ei2πj/N.
Define polynomial
5.16 Then, for |λ − λc | ≤ q r,
Proof. —
Using (5.15) in (5.4), calculation shows that . The rest follows from using expressions for 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 , then triangular inequality implies .
Lemma 5.10. —
If on the circle |λ − λc | ≤ q r for some 0 < q < 1, at some p7,0 ∈ I7,
Then, for p7 ∈ I7 satisfying ,
5.17
Proof. —
By using corollary 5.7, and applying condition, from the mean value inequality,
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 on the real axis, we identified smallest positive real eigenvalues to within 10−8 accuracy for , uniformly spaced out points in the interval , with other parameter values shown in table 2. The eigenvalues and their accuracy are justified through intermediate value theorem through evaluation of , 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 , 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
5.19 We choose a sequence of circles centred at so that its union contains , with . We also ensured that there is one and only one circle with centre contained computed λ0,j. For each Ij, a priori bounds on on gives bounds on on from (5.11); together with evaluation of on uniformly spaced out points on this circle, we get bounds on . We use this in lemma 5.8 to identify low-order (at most 10) polynomials PN(λ;p7,j) that approximates at p7,j on or inside . Bounds on on this circle for each Ij was also calculated from lemma 5.5. We formed polynomial by using numerical roots of PN; but expanding and finding l1 bounds of all coefficients helped determine rigorous bounds on on for each p7,j. For , we checked to conclude from Rouche’s theorem that and have the same number of zeros for any p7 ∈ Ij, where the roots and lower bounds of is manifest in in the product form. The number of zeros was found to be exactly one when λ0,j was inside the particular 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 when the circle centred on real axis contained λ0,j and none otherwise, it follows that this root is real. This is because complex roots of come in conjugate pairs, and this root is not repeated either as Rouche’s theorem counts multiplicity. Therefore, at the root inside 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
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
Table 1.
The base values of dimensionless parameters in model (4.3), with .
| c1 | c2 | c3 | c4 | c5 | c6 | n1 | n2 | n3 | n4 |
|---|---|---|---|---|---|---|---|---|---|
Table 2.
The base values of dimensionless parameters in (5.2), with .
| p1 | p2 | p3 | p4 | p5 | p6 |
|---|---|---|---|---|---|
| 7 |
Appendix B. Coefficients of analytical representation of the Quasi-solution (4.10)
Table 3.
Definition of , and from top to bottom.
| j | k = 0 | k = 1 | k = 2 | k = 3 | k = 4 | k = 5 | k = 6 |
|---|---|---|---|---|---|---|---|
| 0 | |||||||
| 1 | |||||||
| 2 | |||||||
| 3 | |||||||
| 4 | |||||||
| 5 | |||||||
| 6 | |||||||
| 7 | |||||||
| 0 | |||||||
| 1 | |||||||
| 2 | |||||||
| 3 | |||||||
| 4 | |||||||
| 5 | |||||||
| 6 | |||||||
| 7 | |||||||
| 0 | |||||||
| 1 | |||||||
| 2 | |||||||
| 3 | |||||||
| 4 | |||||||
| 5 | |||||||
| 6 | |||||||
| 7 |
Table 4.
Definition of and from top to bottom.
| j | k = 0 | k = 1 | k = 2 | k = 3 | k = 4 | k = 5 |
|---|---|---|---|---|---|---|
| 0 | ||||||
| 1 | ||||||
| 2 | ||||||
| 3 | ||||||
| 4 | ||||||
| 5 | ||||||
| 6 | ||||||
| 7 | ||||||
| 8 | ||||||
| 9 | ||||||
| 10 |
| j | k = 6 | k = 7 | k = 8 | k = 9 | k = 10 |
|---|---|---|---|---|---|
| 0 | |||||
| 1 | |||||
| 2 | |||||
| 3 | |||||
| 4 | |||||
| 5 | |||||
| 6 | |||||
| 7 | |||||
| 8 | |||||
| 9 | |||||
| 10 |
Footnotes
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.
Smallness criteria is set in theorem 2.4.
Since CN is only a property of f and the set , it does not depend on τ.
Every smooth function in bounded domain can approximate by a rational function.
Since by assumption f is smooth in , it is clear that when it is rational in U, we can choose non-zero denominators, which without loss of generality will be positive.
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
Data Availability Statement
The main numerical codes used are available at http://www.math.wsu.edu/faculty/xueying/publications/public/.

