
Citation: Paulo Amorim, Bruno Telch, Luis M. Villada. A reaction-diffusion predator-prey model with pursuit, evasion, and nonlocal sensing[J]. Mathematical Biosciences and Engineering, 2019, 16(5): 5114-5145. doi: 10.3934/mbe.2019257
[1] | Swadesh Pal, Malay Banerjee, Vitaly Volpert . Spatio-temporal Bazykin’s model with space-time nonlocality. Mathematical Biosciences and Engineering, 2020, 17(5): 4801-4824. doi: 10.3934/mbe.2020262 |
[2] | Nazanin Zaker, Christina A. Cobbold, Frithjof Lutscher . The effect of landscape fragmentation on Turing-pattern formation. Mathematical Biosciences and Engineering, 2022, 19(3): 2506-2537. doi: 10.3934/mbe.2022116 |
[3] | Raimund Bürger, Gerardo Chowell, Elvis Gavilán, Pep Mulet, Luis M. Villada . Numerical solution of a spatio-temporal predator-prey model with infected prey. Mathematical Biosciences and Engineering, 2019, 16(1): 438-473. doi: 10.3934/mbe.2019021 |
[4] | Xiaoying Wang, Xingfu Zou . Pattern formation of a predator-prey model with the cost of anti-predator behaviors. Mathematical Biosciences and Engineering, 2018, 15(3): 775-805. doi: 10.3934/mbe.2018035 |
[5] | Chichia Chiu, Jui-Ling Yu . An optimal adaptive time-stepping scheme for solving reaction-diffusion-chemotaxis systems. Mathematical Biosciences and Engineering, 2007, 4(2): 187-203. doi: 10.3934/mbe.2007.4.187 |
[6] | Muhammad Shoaib Arif, Kamaleldin Abodayeh, Asad Ejaz . On the stability of the diffusive and non-diffusive predator-prey system with consuming resources and disease in prey species. Mathematical Biosciences and Engineering, 2023, 20(3): 5066-5093. doi: 10.3934/mbe.2023235 |
[7] | Tingting Ma, Xinzhu Meng . Global analysis and Hopf-bifurcation in a cross-diffusion prey-predator system with fear effect and predator cannibalism. Mathematical Biosciences and Engineering, 2022, 19(6): 6040-6071. doi: 10.3934/mbe.2022282 |
[8] | Honghua Bin, Daifeng Duan, Junjie Wei . Bifurcation analysis of a reaction-diffusion-advection predator-prey system with delay. Mathematical Biosciences and Engineering, 2023, 20(7): 12194-12210. doi: 10.3934/mbe.2023543 |
[9] | Saheb Pal, Nikhil Pal, Sudip Samanta, Joydev Chattopadhyay . Fear effect in prey and hunting cooperation among predators in a Leslie-Gower model. Mathematical Biosciences and Engineering, 2019, 16(5): 5146-5179. doi: 10.3934/mbe.2019258 |
[10] | Meiling Zhu, Huijun Xu . Dynamics of a delayed reaction-diffusion predator-prey model with the effect of the toxins. Mathematical Biosciences and Engineering, 2023, 20(4): 6894-6911. doi: 10.3934/mbe.2023297 |
The mathematical modeling of predator-prey interactions has a long and rich history. The basic dynamics are given by the system of Lotka–Volterra (here in nondimensional form)
{u′=αuw−uw′=βw(1−w−u), | (1.1) |
where u(t)≥0 represents the predator and w(t)≥0 the prey at time t≥0. According to system (1.1), the predator population decreases exponentially in the absence of prey, while the prey follows a logistic growth law. Interactions between predators and prey are modeled by a mass-action law benefitting the predator and depleting the prey. The system's main feature is the global asymptotic stability of its only nontrivial steady state (u,w)=(α−1α,1α), which, for α>1, expresses a balance between predation, prey reproduction, and predators' natural death rate.
When spatial movement is expected to influence the dynamics, it is natural to consider predator and prey densities u(t,x) and w(t,x) depending on a spatial variable x in some physical domain Ω⊂R2. Then, one can introduce spatial diffusion and advection to model foraging movement, the spreading of the population in a territory, and/or movement in a preferred direction.
In particular, besides spatial diffusion, a reasonable assumption is that the prey tries to evade the predator, while the predator tries to chase the prey. This can be modeled by introducing advection terms into the equations. Thus, the predators advect towards regions of higher prey density, while prey advects away from regions of higher predator density. Variants of this idea have been considered, for instance, in [1,2,3,4,5,6,7,8,9,10,11,12,13,14].
Recently, indirect prey- and predator-taxis have been introduced as a mechanism allowing pursuit and evasion [3,4,10,15]. This supposes that the advection velocities are mediated by some indirect signal, which may be an odor, a chemical, a field of visual detection, or seen as a potential. In this spirit, following [3,4,10,15], we consider the predator-prey system with pursuit, evasion and non-local sensing (already written in a non-dimensional form)
{∂tu−Δu+∇⋅(u∇p)=αuw−u∂tw−DwΔw−∇⋅(w∇q)=βw(1−w−u)−DpΔp=δww−δpp−DqΔq=δuu−δqq, | (1.2) |
for t>0, x in a bounded, open Ω⊂R2, supplemented with boundary conditions
∇u⋅n=∇w⋅n=∇p⋅n=∇q⋅n=0in ∂Ω | (1.3) |
and initial data u0(x),w0(x). Here, u(t,x) is the predator density, w(t,x) is the prey density, p(t,x) is the odor produced by the prey, q(t,x) is the odor produced by the predator, and α,β,Dw,Dp,Dq,δp,δq are non-negative non-dimensional constants --- see the Appendix for the physical meaning of the constants and details on the non-dimensionalisation procedure. System (1.2) states that the predator is attracted to the odor p of the prey w, which solves a (steady-state) diffusion equation with source proportional to w, while the prey is repelled by the odor q produced by the predator.
Notice that the equations for the odors of the prey and predator are elliptic, rather than parabolic. This is justified in cases where the diffusion of the odor happens in a much faster time scale than the movement of individuals, which is reasonable on a variety of ecological settings.
Note also that we refer to p and q as "odors" but these quantities do not necessarily model chemical odors. They may be more generally interpreted as potentials representing the chance of an animal being detected at a distance by, e.g., visual means.
We remark on the Neumann boundary conditions (1.3). They model the fact that in the time evolution of system (1.2) there is no flow of individuals across the border of the physical domain. Depending on the particular application, this may be a natural assumption, modeling for instance an enclosed area. However, different boundary conditions could be envisaged (e.g., Dirichlet or mixed-type) reflecting distinct natural settings. Here we limit ourselves to the analisys with (1.3). Still, in the numerical experiments presented below, we show an example with Dirichlet boundary conditions.
In light of the recent mathematical results in [4,15], our main contributions are the introduction of the predator-prey Lotka-Volterra dynamics and the numerical simulations. As we will see, the interaction terms on the right-hand side make the analysis more involved, in particular with respect to the derivation of L∞ estimates. Indeed, while it is shown in the above-mentioned works that the system with no population or interaction dynamics does not originate finite time blow-up of the solutions, the predator equation dynamics introduces a quadratic term uw so it is not obvious that the boundedness property remains valid. We shall see that the attractive-repulsive nature of the advection terms continues to ensure boundedness of the solutions. Moreover, the property of instantaneous boundedness of the solution even for unbounded initial data, observed already in [4], remains valid in this setting.
An outline of the paper follows. In Section 2, we present our main well-posedness result. Next, in Section 3 we derive our main a priori estimates in Lγ spaces, for γ∈[1,∞]. This will allow us, in Section 4, to construct strong and then weak solutions to the system (1.2), completing the proof of our well-posedness result. Finally, in Section 5 we detail an implicit-explicit two-step finite volume method for the approximation of system (1.2) and present some numerical experiments.
The main results of this paper are concerned with the well-posedness and Lebesgue integrability of weak solutions of the system (1.2). We follow a strategy similar to [4,16], making use of fine a priori estimates in Lebesgue spaces, and a De Giorgi level-set method [17] to obtain boundedness of the solutions. Still, the character of the present system introduces several changes in the analysis with respect to the results in [4,16].
The system (1.2) is, mathematically, of chemotaxis type [18,19]. As is well known, such systems may exhibit blow-up of solutions in finite time, see for example the review [20]. Therefore, it is not obvious at first glance whether solutions might also possess blow-up behavior. As we shall see in the following analysis, the indirect nature of the sensing, as well as the attraction-repulsion behavior, prevent the densities from becoming infinite in finite time.
We say that the quadruple (u,w,p,q) is a weak solution of the system (1.2) if it satisfies:
1. (u,w)∈L2(0,T;H1(Ω)) and (∂tu,∂tw)∈L2(0,T,[H1(Ω)]∗), and
2. For any test function ξ∈C∞([0,∞)×Ω) compactly supported in [0,T)ׯΩ, we have
∫T0∫Ω(−u∂tξ+(∇u−u∇p)⋅∇ξ)(t,x)dxdt=∫Ωu0(x)ξ(0,x)dx+∫T0∫Ω(uw−u)ξ(t,x)dxdt,∫T0∫Ω(−w∂tξ+(∇w+w∇q)⋅∇ξ)(t,x)dxdt=∫Ωw0(x)ξ(0,x)dx+∫T0∫Ωw(1−w−u)ξ(t,x)dxdt, |
∫Ω∇q⋅∇ξdx=∫Ω(u−q)ξ(t,x)dx |
and
∫Ω∇p⋅∇ξdx=∫Ω(w−p)ξ(t,x)dx. |
Note that while the biologically relevant regime is when α>1, the value of α>0 does not change the results, so we present most of our analysis with α, as well as all the remaining constants in system (1.2), set to 1.
We will suppose throughout the paper that the initial data (u0,w0) is non-negative and has finite mass
∫Ωu0+w0dx=M<∞. |
and that Ω⊂R2 is a bounded domain of class C2. The main results regarding the system (1.2) are collected here:
Theorem 2.1. Let the initial data u0,w0 be in Lα(Ω) for some α>2. Then, the system (1.2) has a unique non-negative weak solution. The following estimates are satisfied by the solutions for any 0≤t≤T<∞,
(ⅰ) For any γ∈[1,α], it holds
‖u(t)‖α+‖w(t)‖α≤C(α,M,‖u0‖α,‖w0‖α). |
In particular, if u0,w0∈L∞(Ω), then
‖u(t)‖∞+‖w(t)‖∞≤C(M,‖u0‖∞,‖w0‖∞). |
(ⅱ) Lγ−integrability: for any γ∈(α,∞], it holds
‖u(t)‖γ+‖w(t)‖γ≤C(γ,M)(1+1t1/2γ′). |
In particular, we have the L∞-integrability property
‖u(t)‖∞+‖w(t)‖∞≤C(1+1√t). |
for some C independent of t>0.
In this section we provide a priori estimates which will be used in the well-posedness results. To establish the existence of a weak solution, we must first prove that strong, or classical, solutions exist. We say that (u,w,p,q) is a classical solution of the system (1.2) if it satisfies:
1. (u,w,p,q)∈C([0,T];L2(Ω)) and each of the terms in the system (1.2) are well defined functions in L2((0,T)×Ω),
2. The equations on (1.2) are satisfied almost everywhere, and
3. The initial data (u,w)|t=0=(u0,w0) and boundary conditions (1.3) are satisfied almost everywhere.
An essential feature of solutions of (1.2) is the following mass estimate:
Proposition 3.1 (Mass estimate). Let (u,w,p,q) be sufficiently smooth non-negative solutions of the system (1.2) with the boundary conditions (1.3). Then there exists a constant M depending on ‖u0‖1, ‖w0‖1, α, β and |Ω|, but not on t, such that for all t>0,
∫Ωw(t)+u(t)dx≤M. | (3.1) |
Proof. Integrating the first and second equations of (1.2) and using the Neumann boundary conditions (1.3), we find
ddt∫Ωw+βαudx≤β∫Ωwdx−β∫Ωw2dx−βα∫Ωudx. |
From β(w−w2)≤(β+1)24β−w we get, with ζ(t):=∫Ωw+βαudx,
ddtζ(t)+ζ(t)≤C|Ω|⇒ddt(etζ(t))≤etC|Ω|⇒ζ(t)≤e−tζ(0)+(1−e−t)C|Ω|. |
The conclusion of the proposition readily follows.
In this section we prove that data (u0,w0)∈L1(Ω) generate instantaneous Lγ-integrability, with γ>1, for classical non-negative solutions of (1.2).
Proposition 3.2 (A priori estimates in Lγ). Let (u,w,p,q) be sufficiently smooth nonnegative solutions of the system (1.2) with boundary condition (1.3) and integrable initial data, and let t>0 be arbitrary. Then, for any γ∈(1,∞), ϵ>0, we have the estimate
‖u(t)‖γ+‖w(t)‖γ≤C(γ,M)(1+1t(1/γ′)+ϵ). | (3.2) |
Moreover, if u0,w0∈Lγ(Ω), then actually
‖u(t)‖γ+‖w(t)‖γ≤C(γ,M,‖u0‖γ,‖w0‖γ), | (3.3) |
for some C>0 depending on M and Lγ−norms of the data, but independent of t.
Proof. We will frequently use the Gagliardo–Nirenberg–Sobolev (GNS) inequality in two dimensions (see e.g. [21]), holding for any α≥1,
∫Ωξα+1dx≤C(Ω,α)‖ξ‖1‖ξα/2‖2H1≤C(Ω,α)∫Ωξdx(∫Ωξαdx+∫Ω|∇(ξα/2)|2dx), | (3.4) |
as well as the interpolation inequality
‖u‖γ≤‖u‖1−θ1‖u‖θγ+1,θ=γ2−1γ2∈(0,1). | (3.5) |
We start by multiplying the second equation of (1.2) by wγ−1 and integrating, to find (discarding a nonpositive term)
ddt1γ∫Ωwγdx+γ−1γ∫Ω∇q⋅∇(wγ)dx+(γ−1)∫Ωwγ−2|∇w|2dx≤∫Ωwγdx−∫Ωuwγdx. |
Now multiply the fourth equation of (1.2) by wγ and integrate by parts to get
−∫Ω∇q⋅∇(wγ)dx≤∫Ωqwγdx. | (3.6) |
Also using
∫Ωwγ−2|∇w|2dx=4γ−1γ2∫Ω|∇wγ/2|2dx, |
we find, discarding nonpositive terms,
ddt∫Ωwγdx+4γ−1γ∫Ω|∇wγ/2|2dx≤γ∫Ωwγdx+(γ−1)∫Ωqwγdx | (3.7) |
Let us consider the terms on the right-hand side of the previous inequality. Take a small ϵ>0 to be specified later. We use the following consequence of Young's inequality, qwγ≤ϵwγ+1+ϵ−γqγ+1, and also the inequality
∫Ωwγdx≤C‖w‖γ2−1γγ+1≤C+ϵ‖w‖γ+1γ+1, |
which is obtained from Young's inequality, the mass estimate (3.1), and the interpolation inequality (3.5). Therefore, for some constant C depending on γ, M, and ϵ,
γ∫Ωwγdx+(γ−1)∫Ωqwγdx≤C+Cϵ∫Ωwγ+1dx+C∫Ωqγ+1dx. |
This way, we find
ddt∫Ωwγdx+4γ−1γ∫Ω|∇wγ/2|2dx≤C+Cϵ∫Ωwγ+1dx+C∫Ωqγ+1dx |
and from the GNS inequality (3.4) and ϵ sufficiently small,
ddt∫Ωwγdx+C∫Ωwγ+1dx≤C+C∫Ωwγdx+C∫Ωqγ+1dx. |
Again, from ∫Ωwγdx≤C+ε∫Ωwγ+1dx, we get
ddt∫Ωwγdx+C∫Ωwγ+1dx≤C+C∫Ωqγ+1dx. | (3.8) |
for some C depending on γ, M, the GNS constant, and the parameters of the system.
To deal with the last term on the right-hand side of (3.8), multiply the fourth equation of (1.2) by qγ−1 to get
∫Ω|∇qγ/2|2dx≤∫Ωuqγ−1dx≤C∫Ωuγdx+C∫Ωqγdx. |
From the GNS inequality (3.4) we deduce that
∫Ωqγ+1dx≤C∫Ωuγdx+C∫Ωqγdx≤C∫Ωuγdx+Cϵ∫Ωqγ+1dx+C. |
Choosing ϵ small, we find
∫Ωqγ+1dx≤C∫Ωuγdx+C. | (3.9) |
In view of (3.9), the estimate (3.8) becomes
ddt∫Ωwγdx+C∫Ωwγ+1dx≤C+C∫Ωuγdx. | (3.10) |
Note that the gain from w being the prey population, and thus having a repulsive behavior, is reflected in the lower power uγ.
In contrast, performing very similar computations using the first and third equations of the system (1.2), so that instead of (3.6) only
∫Ω∇p⋅∇(uγ)dx≤∫Ωwuγdx. |
is valid, we find that for α≥2
ddt∫Ωuαdx+C∫Ωuα+1dx≤C+C∫Ωwα+1dx. | (3.11) |
Adding (3.10) and (3.11) gives
ddt∫Ωwγ+uαdx+C∫Ωwγ+1+uα+1dx≤C|Ω|+C∫Ωwα+1+∫Ωuγdx. |
It is clear that to conveniently bound the terms on the right-hand side using the left-hand side, we should take α<γ<α+1.
Now, we make use of the interpolation inequalities
‖u‖γ≤‖u‖1−θ11‖u‖θ1α+1,θ1=(γ−1)(α+1)γα∈(0,1),‖w‖α+1≤‖w‖1−θ21‖w‖θ2γ+1,θ2=α(γ+1)γ(α+1)∈(0,1). |
Recalling the mass estimate (3.1), we get
ddt(‖w‖γγ+‖u‖αα)+C(‖w‖γ+1γ+1+‖u‖α+1α+1)≤C+C(‖w‖θ2(α+1)γ+1+‖u‖θ1γα+1), |
for C depending on γ,α, and M. Now, θ2(α+1)<γ+1 and θ1γ<α+1, so using Young's inequality with a sufficiently small ϵ allows the terms on the right-hand side to be absorbed into the left-hand side. This gives
ddt(‖w‖γγ+‖u‖αα)+C(‖w‖γ+1γ+1+‖u‖α+1α+1)≤C |
for C depending on γ,α, and M. Next, use the inequality (3.5) to find
ddt(‖w‖γγ+‖u‖αα)+C((‖w‖γγ)γγ−1+(‖u‖αα)αα−1)≤C |
and so, from (‖u‖αα)αα−1≤(‖u‖αα)γγ−1 and convexity of the power function, we find, setting
η(t):=‖w‖γγ+‖u‖αα, |
that
η′(t)+Cη(t)γγ−1≤C. |
Now use the ODE comparison result from [16, Corollary A.2] to conclude
η(t)≤C(1+t1−γ). |
In view of the definition of η, one finds
‖w‖γ≤C(1+t1−γγ)=C(1+1t1/γ′) |
and, taking γ=α+ϵ,
‖u‖α≤C(1+t1−γα)=C(1+1t(1/α′)+ϵ), |
for C depending on γ,α, and M. This proves the estimate (3.2). The uniform estimate (3.3) follows from the afore-mentioned ODE comparison results in [16]. This concludes the proof of Proposition 3.2.
In this section we prove two boundedness results adopting De Giorgi's energy method (see [17] and [4,16,22,23,24] for related applications of the method). Throughout this section, we will use the notation γ+ to denote an arbitrary fixed number in (γ,+∞).
First, we consider initial data u0 and w0 only in L1(Ω), and obtain an estimate of the type
‖u(t)‖∞+‖w(t)‖∞≤C(M)(1+1t1+), | (3.12) |
for some constant C>0 depending on M, but not on T>0. Then, we will suppose that the initial data u0 and w0 are in L∞(Ω). Then we can upgrade the estimates above to
max{‖u(t)‖∞,‖w(t)‖∞}≤C(M,‖u0‖∞,‖w0‖∞),t≥0, |
where C now depends also on the L∞ norms of initial data.
To further clarify the notation, let us spell out that, for instance, the estimate (3.12) precisely means that for any ϵ>0, it holds
‖u(t)‖∞+‖w(t)‖∞≤C(M)(1+1t1+ϵ), |
with a constant C that may, however, depend on ϵ.
The main result in this section is the following:
Proposition 3.3. Let (u,w,p,q) be a sufficiently smooth non-negative solution of the system (1.2) with boundary conditions (1.3) and integrable, nonnegative initial data, and let T>0 be arbitrary. Then, for all t∈(0,T], we have the estimate
‖u(t)‖∞+‖w(t)‖∞≤C(M)(1+1t1+), |
where the constant C is independent of T>0.
Let us begin by recording here the following L∞ estimates, which are a consequence of elliptic regularity for the last two equations of the system (1.2) and Proposition 3.2.
‖∇p(t)‖∞≤C(Ω)‖p(t)‖W2,2+≤C(Ω)‖u(t)‖2+≤C(1+1t(1/2)+), | (3.13) |
and
‖∇q(t)‖∞≤C(Ω)‖q(t)‖W2,2+≤C(Ω)‖w(t)‖2+≤C(1+1t(1/2)+). | (3.14) |
The first step in the proof of Proposition 3.3 is a boundedness result valid on each interval (t∗,T) with t∗>0.
Lemma 3.4. Let (u,w,p,q) be as in Proposition 3.3, and let t∗>0. Then, there exist constants M,N>0 depending on t∗,T, and u(t∗),w(t∗) such that 0≤u(t,x)≤M and 0≤w(t,x)≤N almost everywhere on (t∗,T)×Ω.
Proof. Although the structure of the proof is the similar to corresponding results in [4,16], we show the details since the rather involved calculations depend heavily on the structure of the system. Consider (u,p) a non-negative, sufficiently smooth solution to the general problem
∂tu−Δu+∇⋅(u∇p)=f−Δp=w−p | (3.15) |
in [0,T]×Ω with the boundary conditions
∇u⋅n|∂Ω=∇p⋅n|∂Ω=0, | (3.16) |
where n is the outward unit normal vector to ∂Ω, f and w are known, and w satisfies
‖w(t)‖γ≤C(1+1t(1/γ′)+),γ>1. |
Similarly, take a non-negative solution (w,q) to the problem
∂tw−Δw−∇⋅(w∇q)=g−Δq=w−q | (3.17) |
[0,T]×Ω with boundary conditions
∇w⋅n|∂Ω=∇q⋅n|∂Ω=0, | (3.18) |
g and u given and u satisfying
‖u(t)‖γ≤C(1+1t(1/γ′)+),γ>1. |
We denote Vλ={(t,x)∈Ω×[0,T],u(t,x)>λ} and define
uλ=(u−λ)1Vλ. |
Multiplying the first equation of (3.15) by uλ, integrating in space and using (3.16), we obtain
ddt∫Ωu2λdx+2∫Ω|∇uλ|2dx≤−2∫Ωu∇p⋅∇uλdx+2∫Ωf+uλdx. |
For the first term on the right-hand side note that using Young's inequality, we find
−2∫Ωu∇p⋅∇uλdx≤∫Ω|u∇p|21Vλdx+∫Ω|∇uλ|2dx. |
Thus,
ddt∫Ωu2λdx+∫Ω|∇uλ|2dx≤∫Ω|u∇p|21Vλdx+2∫Ωf+uλdx. | (3.19) |
Let M>0 be a constant to be defined later, let t∗>0, and set
λk=(1−12k)M,tk=(1−12k+1)t∗ |
for k=0,1,2,…. Define the energy functional
Uk:=supt∈[tk,T]∫Ωu2kdx+∫Ttk∫Ω|∇uk|2dxdt, | (3.20) |
where we use the notation uk=uλk. Similarly, we define for w the energy functional
Wk:=supt∈[tk,T]∫Ωw2k(t)dx+∫Ttk|∇wk|2dxdt | (3.21) |
with the same definitions of λk (with N instead M) and tk, for some N>0 to be chosen later.
With λ=λk on (3.19), integrating over [s,t], we obtain
∫Ωu2k(t)dx+∫ts∫Ω|∇uk|2dxds≤∫Ωu2k(s)dx+∫ts∫Ω|u∇p|21Vkdxdt+2∫ts∫Ωf+ukdxds. |
We use this relation with tk−1≤s≤tk≤t≤T to check that
Uk2≤∫Ωu2k(s)dx+∫Ttk−1∫Ω|u∇p|21Vkdxdt+2∫Ttk−1∫Ωf+ukdxdt. |
Integrating with respect to s over [tk−1,tk], bearing in mind that tk−tk−1=t∗/2k and only the first term on the right-hand side of this inequality depends on s, we obtain
Uk≤2k+1t∗∫Ttk−1∫Ωu2k(s)dxds+2∫Ttk−1∫Ω|u∇p|21Vkdxdt+4∫Ttk−1∫Ωf+ukdxdt=:I1+I2+I3. |
Now, we are going to introduce a series of estimates for I1, I2 and I3. For this, we will use the Gagliardo-Nirenberg interpolation inequality in Rn (see e.g. [25]) and a key estimate for 1Vk. Note that we are temporarily performing the analysis in n dimensions. We have
‖u‖pp≤C‖u‖αpH1‖u‖(1−α)p2with1=(12−1n)αp+1−α2p. | (3.22) |
which holds for any α∈[0,1] and 1≤p≤∞. Choosing the parameter α∈[0,1] such that αp=2, it follows that p=2n+2n and
‖u‖pp≤C‖u‖2H1‖u‖p−22. | (3.23) |
Observe also that uk>0 implies u>λk, therefore u−λk−1>λk−λk−1=M2k. We also have u−λk<u−λk−1, thus, which a simple computation,
1Vk≤(2kMuk−1)a. | (3.24) |
holds for all a≥0.
● Estimate for I1
First, note that for a≥0 we have
I1=2k+1t∗∫Ttk−1∫Ωu2k1Vkdxds≤2k+1t∗2kaMa∫Ttk−1∫Ωu2+ak−1dxds. |
We choose a in (3.24) such that 2+a=p=2n+2n, so a=4n. Thus,
I1≤224+nnkM4nt∗∫Ttk−1∫Ωu2n+2nk−1dxds≤2C(Ω,n)24+nnkM4nt∗∫Ttk−1(‖uk−1‖22+‖∇uk−1‖22)‖uk−1‖2n+2n−22ds≤2C(Ω,n)24+nnkM4nt∗Un+2n−1k−1∫Ttk−1(‖uk−1‖22+‖∇uk−1‖22)ds. |
Note that ∫Ttk−1(‖uk−1‖22+‖∇uk−1‖22)ds≤(T+1)Uk−1, which leads to
I1≤C(1+T)24+nnkM4nt∗Un+2nk−1. | (3.25) |
● Estimate for I2
We have that
I2=2∫Ttk−1∫Ω|u∇p|21Vkdxdt≤(supt≥t∗2‖u∇p‖22q′)∫Ttk−1[∫Ω1Vkdx]1qdt. |
Now, choosing a=p in (3.24), we obtain
∫Ttk−1[∫Ω1Vkdx]1qdt≤2pkqMpq∫Ttk−1[∫Ωupk−1dx]1qdt(3.23)≤C2pkqMpq∫Ttk−1‖uk−1‖pqαH1‖uk−1‖(1−α)pq2dt, |
where we need q>1. Thus,
I2≤C2pkqMpq(supt≥t∗2‖u∇p‖22q′)∫Ttk−1‖uk−1‖pqαH1‖uk−1‖(1−α)pq2dt, |
where we used (3.23) with the relation (3.22). We choose α∈(0,1) satisfying αpq=2 to find
1q=p2q−2n⇒p=2(n+2qn). |
Observe that α=2qp implies α=qnn+2q, then
0<α<1⇒0≤2≤pq⇒0<2q<2(n+2qn), |
where q is such that 1<q<nn−2. Thus,
I2≤C22kαM2α(supt≥t∗2‖u∇p‖22q′)∫Ttk−1‖uk−1‖2H1‖uk−1‖2α−22dt≤C22kαM2α(supt≥t∗2‖u∇p‖22q′)(1+T)U1αk−1, |
where in this last step we proceeded as in the estimate for I1. Therefore
I2≤C(1+T)22kαM2α(supt≥t∗2‖u∇p‖22q′)U1αk−1. | (3.26) |
● Estimates for I3
Proceeding as we did for the estimate of I2, using that uk≤u1Vk, we have
I3a=p≤4(supt≥t∗2‖f+u‖q′)2kpqMpq∫Ttk−1‖uk−1‖pqpds≤C(supt≥t∗2‖f+u‖q′)2kpqMpq∫Ttk−1‖uk−1‖pαqH1‖uk−1‖(1−α)pq2ds≤C(supt≥t∗2‖f+u‖q′)22kαM2α(1+T)U1αk−1, |
where α, p and q are the same of the estimate for I2. Since supt≥t∗2‖f+u‖q′≤supt≥t∗2{‖f+‖2q′‖u‖2q′}, we find
I3≤C(1+T)(supt≥t∗2‖f+‖2q′‖u‖2q′)22kαM2αU1αk−1. | (3.27) |
Combining (3.25), (3.26) e (3.27), we obtain
Uk≤C(1+T)××[24+nnkM4nt∗Un+2nk−1+22kαM2α(supt≥t∗2‖u∇p‖22q′+supt≥t∗2{‖f+‖2q′‖u‖2q′})U1αk−1]. | (3.28) |
Now we are going to restrict our reasoning to the case n=2, where we have α=qq+1 and the advantage that we can take 1<q<∞, since 1<q<nn−2=∞. Using Proposition 3.2, we have
‖u∇p‖22q′≤‖∇p‖2∞‖u‖22q′≤C(1+1t(2q+1q)+). |
Likewise,
‖f+‖2q′‖u‖2q′≤C‖f+‖2q′(1+1t(q+12q)+) | (3.29) |
and particularizing to f+=uw,
‖f+‖2q′=(∫Ω[uw]2q′dx)12q′≤‖u‖4q′‖w‖4q′≤C(1+1t(3q+12q)+). |
Therefore,
supt≥t∗2{‖∇p‖2∞‖u‖22q′+‖f+‖2q′‖u‖2q′}≤C(1+1t(2q+1q)+∗) | (3.30) |
Now, substituting these results in (3.28), we obtain
Uk≤C(1+T)[23kM2t∗U2k−1+(1+1t(2q+1q)+∗)22(q+1)qkM2(q+1)qUq+1qk−1]. | (3.31) |
We are going to prove that there exists a constant a∈(0,1) depending only on q such that Uk≤akU0 for all k∈N. First, set Vk=akU0. Then applying the recurrence relation defined by the right-hand side of (3.31) to Vk gives
C(1+T)[23kM2t∗V2k−1+(1+1t(2q+1q)+∗)22(q+1)qkM2(q+1)qVq+1qk−1]=C(1+T)[(23a)kM2t∗a2U0+(1+1t(2q+1q)+∗)(22(q+1)qa1q)kM2(q+1)qaq+1qU1q0]Vk. | (3.32) |
Now we choose a such that max{23a,22(q+1)qa1q}<1. So, the last line of (3.32) is bounded by
(3.32)≤C(1+T)[U0M2t∗a2+(1+1t(2q+1q)+∗)U1q0M2(q+1)qaq+1q]Vk. |
Now, choosing M so that
max{CU0a2M2t∗,CU1q0aq+1qM2(q+1)q(1+1t(2q+1q)+∗)}≤12C(1+T), |
we find that
(3.32)≤Vk. |
In other words, Vk is a supersolution of the recurrence relation defined by (3.31). By a comparison principle, we have Uk≤akU0⟶k→+∞0. Thus, we obtain
∫Tt∗/2∫Ωu2(t,x)1{u(t,x)≥M(1−1/2k)}dxdt≤Ukk→+∞→0. |
Fatou's lemma implies
1T−t∗/2∫Tt∗/2∫Ωu2(t,x)1{u(t,x)≥M}dxdt=0, |
which in turn implies 0≤u(t,x)≤M almost everywhere on (t∗/2,T)×Ω. For t∗/2<1 we can determine M explicitly via
M=max{√2C(1+T)U0a2t∗,√(2C(1+T))qq+1U1q+10a2t(2q+12(q+1))+∗}. |
Taking q↘1, we have
M=max{√2C(1+T)U0a2t∗,√(2C(1+T))12U120a2t(3/4)+∗}, | (3.33) |
A very similar computation using (3.17), (3.21), particularizing to g+=w gives
Wk≤C(1+T)[23kN2t∗W2k−1+(1+1t(2q+1q)+∗)22(q+1)qkN2(q+1)qWq+1qk−1]. |
Then, we obtain N>0 as before so that 0≤w(t,x)≤N almost everywhere on (t∗/2,T)×Ω and when 0<t∗/2<1, N can be estimated by
N=max{√2C(1+T)W0a2t∗,√(2C(1+T))12Wq20a2t(3/4)+∗}. | (3.34) |
Renaming t∗/2 as t∗ concludes the proof of Lemma 3.4.
Proof of Proposition 3.3. In Lemma 3.4 we found M,N>0 such that 0≤u(t,x)≤M and 0≤w(t,x)≤N almost everywhere on (t∗,T)×Ω. From (3.33) and (3.34) we see that M and N depend directly on U0 and W0, respectively. First, we are going to obtain appropriate estimates for these terms, from which the L∞−bound for w and u in the time interval (t∗,1) follows. After this, we will extend the estimate for general large intervals. Proceeding as we did in (3.19) for the particular case f+=uw, we have
ddt∫Ωu2dx+2∫Ω|∇u|2dx≤2∫Ωu∇u∇pdx+2∫Ωf+udx≤∫Ω∇u2∇pdx+2∫Ωu2wdx≤3∫Ωu2wdx, | (3.35) |
where, in the last step, we used
∫Ω∇u2∇pdx≤∫Ωu2wdx−∫Ωpu2dx≤∫Ωu2wdx, |
which follows from the first equation of (3.15). Observe that
∫Ωu2wdx≤‖u‖33+‖w‖33≤C(1+1t2). |
Substituting this in (3.35), we obtain
ddt∫Ωu2dx+∫Ω|∇u|2dx≤C(1+1t2). | (3.36) |
Integrating over [s,t], we find
∫Ωu2(t)dx+∫ts∫Ω|∇u(t′)|2dxdt′≤∫Ωu2(s)dx+C∫ts(1+1t′2+)dt′≤C(1+1s1+). |
Observe that from this inequality we conclude
U0≤C(1+1t1+∗). |
Now, via (3.33), using the estimates made previously, we get for t≥t∗
‖u(t)‖∞≤M≤Ct1+∗ | (3.37) |
where we remember that 0<t∗<1. For W0, a similar computation with (3.17) and particularizing g=w leads to
W0≤C(T+1)(1+1t1+∗). |
Now, via (3.34), we conclude for t≥t∗
‖w(t)‖∞≤N≤Ct1+∗, | (3.38) |
where we recall that 0<t∗<1.
These estimates are valid whenever 0<t∗≤t≤T=1, but the same reasoning can be applied for any T>0 and it would provide a bound depending on T. In order to justify that the same L∞-estimate can be made uniform with respect to T, we proceeding by extending this estimate in a similar way as was done in [16]: let t1∈(t∗,T−t∗) and note that the shifted functions wt1(t,x)=w(t+t1,x) and ut1(t,x)=u(t+t1,x) are still solutions of the same problem with initial data wt1(0,x)=w(t1,x) and ut1(0,x)=u(t1,x), and the appropriate right-hand side. Since the constant C doesn't change due to the Proposition 3.1, we pick t1∈(0,T) and repeat the same arguments to wt1 and ut1, which leads the same L∞-bounds (3.37) and (3.38) for w and u on the interval [t∗,T]. It means that (3.37) and (3.38) happen for [t∗+t1,T+t1], that is, we extend (3.37) and (3.38) over [t∗,T+t1]. We can repeat this procedure, completing the proof of Proposition 3.3.
We suppose now we have initial data u0 and w0 in Lα(Ω), for some α>2. We will slightly modify the previous analysis in order to obtain better versions of the estimates in Propositions 3.2 and 3.3, as well as a uniform estimate in L∞ in the case of bounded initial data.
Proposition 3.5. Let u0 and w0 be initial data in Lα(Ω), for some α∈(2,∞]. The estimates (3.2) of Propositions 3.2 and 3.3 can be upgraded by adding to the constant C the dependence of Lα-norms on the initial data: for any γ>α, we have
‖u(t)‖γ+‖w(t)‖γ≤C(1+1t1/2γ′). | (3.39) |
and, in particular,
‖u(t)‖∞+‖w(t)‖∞≤C(1+1√t). | (3.40) |
If u0,w0∈L∞(Ω), then we have the uniform estimate
max{‖u(t)‖∞,‖w(t)‖∞}≤C(M,‖u0‖∞,‖w0‖∞),t≥0, |
where the constant C>0 is independent of T>0.
Proof. First of all, by Proposition 3.2, there exist a constant A>0 such that
A:={sups≥0‖u(s)‖α,sups≥0‖w(s)‖α}<∞. |
We change the definition tk=(1−1/2k)t∗, and observe now that t0=0. Note first that (3.30) becomes
supt≥t∗2{‖∇p‖2∞‖u‖22q′+‖f+‖2q′‖u‖2q′}≤C, | (3.41) |
since ‖∇p(t)‖∞≤‖u(t)‖α≤A<∞. In this way, (3.31) becomes
Uk≤C[23kM2t∗U2k−1+22(q+1)qkM2(q+1)qUq+1qk−1], | (3.42) |
with a constant C depending on M, A and T, but independent of t∗ and k. We are going to proceed as we did after (3.31), but now with (3.42), relying on the fact that here we have
U0≤C(1+T)≤˜C, |
where the constant ˜C depends on M, A and T. Let us now see that there exist a∈(0,1), M>0, so that Uk≤akU0, for all k. So, taking the right-hand side of (3.42) applied to Vk:=akU0, we find
C[23kM2t∗V2k−1+22(q+1)qkM2(q+1)qVq+1qk−1]≤C[(23a)kM2t∗a2U0+(22a)q+1qkM2(q+1)qa2(q+1)qU1q0]Vk. | (3.43) |
Then, taking a so that 23a<1,
(3.43)≤C[U0M2t∗a2+U1q0M2(q+1)qa2(q+1)q]akU0. |
Choosing M>0 so that
0<max{CU0t∗a2,(CU1q0a2(q+1)q)qq+1}≤M22, |
we get that Vk is a supersolution of the recurrence defined by (3.42), and so Uk≤akU0⟶k→+∞0. Observe also that for t<1
max{(CU0t∗a2)1/2,(CU1q0a2(q+1)q)q2(q+1)}≤C(1+1√t∗)=:M. |
Thus, we have 0≤u(t,x)≤M, whence it follows that
0≤u(t,x)≤C(1+1√t). | (3.44) |
We get the same estimate for w proceeding exactly in the same way for Wk, which leads to
0≤w(t,x)≤C(1+1√t). | (3.45) |
This proves (3.40). Estimate (3.39) follows by Lebesgue interpolation between estimates (3.44) and (3.45) and mass conservation.} From this point, the deduction of the uniform estimate of Proposition 3.5 using (3.44) and (3.45) is very similar to [16,Prop.3.2], so we refer the reader to that work for details.
The a priori estimates of the previous sections will now allow us to prove the global well-posedness of the system (1.2). The first step is to prove existence and uniqueness of classical solutions with smooth initial data. For this, we will use the Banach fixed-point theorem. A stability result for such solutions will be obtained and the existence of a weak solution follows as a consequence.
Let w0∈C∞c(Ω) and define the set
Υ={ξ∈C([0,T];L2(Ω))∩L2(0,T;H1(Ω)),0≤ξ(t,x)≤2‖w0‖∞}, |
equipped with the norm
‖u‖Υ=sup0≤t≤T‖u(t,⋅)‖L2. |
Note that Υ with the metric induced by ‖⋅‖Υ is a complete metric space. In this section we prove the following theorem:
Theorem 4.1. Let u0 and w0∈C∞c(Ω) be non-negative initial dada. Then, for all T>0 the system (1.2) supplemented with the boundary condition (1.3) admits a unique non-negative classical solution. This solution satisfies the estimates obtained in Propositions 3.2, 3.3 and 3.5.
The main step to prove this theorem is the use of the following lemma, whose proof is standard and can be found in [16,Thm. 3.1].:
Lemma 4.2. Let ψ be a smooth solution of
∂tψ−Δψ+∇⋅(Bψ)+bψ=0∇ψ⋅n=B⋅n=0,ψ(0)=ψ0≥0 | (4.1) |
with b,B,∇⋅B∈L∞. Then,
0≤ψ(t,x)≤‖w0‖∞e(‖b‖∞+‖∇⋅B‖∞)t. | (4.2) |
Now let ϕ∈Υ and let p=p[ϕ] be the solution of
{p−Δp=ϕ∇p⋅n=0. |
Linear theory guarantees that there exists a unique solution p∈H1(Ω), and, since ϕ(t)∈L∞(Ω) and Ω is smooth, we have p(t)∈H2(Ω) with ‖p(t)‖H2≤C‖ϕ(t)‖L2 almost everywhere in time. Therefore we have p(t),∇p(t) and Δp(t)∈L∞(Ω). Now we associate u=u[ϕ] the solution of
{∂tu−Δu+∇⋅(u∇p)+(1−ϕ)u=0inΩ,∇u⋅n=0in∂Ωu(0)=u0. |
By linear theory, u is unique and such that u∈L2(0,T;H1(Ω))∩C([0,T],L2(Ω)). Linear theory still guarantees that there exists some constant C>0 depending on T and Ω such that ‖u‖L∞(0,T;H1(Ω))≤C‖u0‖H1(Ω). Now, we associate q=q[ϕ] the solution of
{q−Δq=u[ϕ]∇q⋅n=0. |
The same arguments lead to the existence of a unique solution q∈H1(Ω), which satisfies q(t)∈H2(Ω) with ‖q(t)‖H2≤C‖u(t)‖L2, then q(t),∇q(t),Δq(t)∈L∞(Ω). Finally, we associate w=w[ϕ] the solution of
{∂tw−Δw−∇⋅(w∇q)+βw(u+ϕ−1)=0inΩ,∇w⋅n=0in∂Ω,w(0)=w0, |
where w[ϕ] is the only weak solution and such that w∈L2(0,T;H1(Ω))∩C([0,T],L2(Ω)).
Lemma 4.3. For T>0 small enough, w[ϕ]∈Υ.
Proof. Applying Lemma 4.2 for w[ϕ],
0≤w(t,x)≤‖w0‖∞e(‖u+ϕ−1‖∞+‖Δq‖∞)t. |
Note that all terms in the exponential can be bounded by C‖ϕ‖∞, with C>0 depending on the data of the problem. Thus, for T>0 small enough we have 0≤w(t,x)≤2‖w0‖∞, which means w[ϕ]∈Υ.
Lemma 4.4. Φ:ϕ∈Υ↦w[ϕ]∈Υ is a contraction on [0,T] for some T>0.
Proof. Let ϕ1,ϕ2∈Υ and define ¯w=w1−w2, where w1 and w2 are the respective associated solutions, and so forth. It's easy to check that
∂t¯w−Δ¯w−∇⋅(w2∇¯p)−∇⋅(¯w∇p2)=¯w−w1¯ϕ−¯wϕ2−w1¯u−¯wu2. |
Multiplying by ¯w and integrating in space, we obtain
12ddt∫Ω¯w2dx+∫Ω|∇¯w|2dx+∫Ω∇¯w⋅w2∇¯pdx+∫Ω∇¯w⋅¯w∇p2dx≤C(‖¯w(t)‖22+‖¯u(t)‖22+‖¯ϕ(t)‖22), | (4.3) |
where we used the estimates for wi, ui and ϕi guaranteed by Lemma 4.2 and by the definition of Υ, respectively. Substituting
|∫Ωw2∇¯w∇¯pdx|≤12‖∇¯w‖22+C‖¯ϕ(t)‖22 |
and
|∫Ω¯w∇¯w∇p2dx|≤12‖∇¯w‖22+C‖¯w(t)‖22 |
in (4.3), we find
ddt∫Ω¯w2dx≤C(‖¯w(t)‖22+‖¯u(t)‖22+‖¯ϕ(t)‖22). |
By Gronwall's lemma, it follows that
∫Ω¯w2dx≤eKt∫t0∫Ω|¯u(s)|2+|¯ϕ(s)|2dxds≤eKt∫t0∫Ω|¯u(s)|2dxds+[sup0≤s≤t∫Ω|¯ϕ(s)|2dx]teKt. | (4.4) |
for some constant K>0 which may change from line to line. Likewise, for ¯u=u1−u2, we get
∫Ω|¯u(t)|2dx≤CeKt∫t0∫Ω|¯ϕ(s)|2dxds. | (4.5) |
Note that
eKt∫t0∫Ω|¯u(s)|2dxds≤CeK′tt22[sup0≤s≤t∫Ω|¯ϕ(s)|2dx]. | (4.6) |
Combining (4.5) and (4.6) with (4.4), we conclude that
∫Ω|¯w(t)|2dx≤MeKt(t22+t)sup0≤s≤t∫Ω|¯ϕ(s)|2dx, |
for all t∈[0,T]. Thus, for T>0 small enough, Φ is a contraction.
This is enough to prove Theorem 4.1. We take ˜T>0 being the smallest guaranteed by Lemma 4.3 and Lemma 4.4. By the fixed point theorem, the result follows for small time. Extension to [0,T] is done in a standard way.
Let α>2. We say that the system of equations (1.2) is stable on L∞(0,T;Lα(Ω)) when, given two pairs of initial data u0,i,w0,i∈Lα(Ω), the respective classical solutions ui and wi admit C>0 depending only on M and on Lα−norms of the data such that
‖u1(t)−u2(t)‖2+‖w1(t)−w2(t)‖2≤C(‖u1,0(t)−u2,0(t)‖2+‖w1,0(t)−w2,0(t)‖2)eC(M)t,t≥0. | (4.7) |
Proposition 4.5. Let α>2. The system (1.2) is stable (in the sense of (4.7)) on L∞(0,T;Lα(Ω)).
Proof. Let ¯u=u1−u2 and similarly for the other differences. The system for the differences reads
∂t¯u−Δ¯u+∇⋅(¯u∇p1)+∇⋅(u2∇¯p)=u1¯w+¯uw2−¯u∂t¯w−Δ¯w−∇⋅(¯w∇q1)−∇⋅(w2∇¯q)=¯w−u1¯w−¯uw2−(w1+w2)¯w−Δ¯p=¯w−¯p−Δ¯q=¯u−¯q. | (4.8) |
Multiplying (4.8) by ¯u and integrating in space, we get
12ddt‖¯u‖22+‖∇¯u‖22≤∫Ω¯u∇p1∇¯udx+∫Ωu2∇¯p∇¯udx+∫Ωu1¯w¯udx+∫Ω¯u2w2dx−∫Ω¯u2dx. | (4.9) |
It is easy to check using (3.40) that
∫Ω¯u∇p1∇¯udx+∫Ωu1¯w¯udx+∫Ω¯u2w2≤12‖∇¯u‖22+C(1+1√t)(‖¯u‖22+‖¯w‖22). |
Hölder inequality guarantees that
∫Ωu2∇¯p∇¯udx≤12‖∇¯u‖22+12‖u2(t)∇¯p(t)‖22 |
Observe that using
‖u2(t)∇¯p(t)‖22≤‖∇¯p(t)‖22q‖u2(t)‖22q′ |
for q∈(1,∞), with ‖∇¯p(t)‖22q≤C‖¯p(t)‖2H2≤C‖¯w(t)‖22 and ‖u2(t)‖22q′≤‖u2(t)‖1+1q∞‖u2(t)‖1q′1 and (3.40), we find
‖u2(t)∇¯p(t)‖22≤C(1+1tq+12q)‖¯w(t)‖22. |
Then,
‖u2(t)∇¯p(t)‖22≤C(1+1tq+12q)‖¯p(t)‖2H2≤C(1+1tq+12q)‖w(t)‖22. |
Choosing q big enough, we have from (4.9) and the previous estimates that
ddt‖¯u‖22≤C(1+1t(1/2)+ϵ)(‖¯u‖22+‖¯w‖22), |
for some small ϵ. A similar result is obtained for ¯w using the same arguments, where we get
ddt{‖¯u‖22+‖¯w‖22}≤C(1+1t(1/2)+ϵ)(‖¯u‖22+‖¯w‖22). |
Defining Z(t)=‖¯u‖22+‖¯w‖22, we have
Z′(t)≤C(1+1t(1/2)+ϵ)Z(t). |
Integration of this differential equation leads to the result.
Now we are ready to state and prove a well-posedness result for weak solutions:
Theorem 4.6. Fix an arbitrary T>0 and assume non-negative initial data u0,w0∈Lα(Ω), for some α>2. Then, there exists a unique non-negative weak solution for the system (1.2). This solution satisfies the estimates of Proposition 3.2 and 3.3–3.5.
Proof. Take a sequence of non-negative initial data u0,k,w0,k∈C∞c(Ω) with u0,k→u0 and w0,k→w0 both strongly in Lα(Ω). Theorem 4.1 guarantees sequences uk,wk,pk and qk in C([0,T],L2(Ω)) strong solutions of the system (1.2) for each pair of data u0,k,w0,k∈C∞c(Ω),
{∂tuk−Δuk+∇⋅(uk∇pk)=ukwk−uk∂twk−Δwk−∇⋅(wk∇qk)=wk(1−wk−uk)−Δpk=wk−pk−Δqk=uk−qk | (4.10) |
k∈N. The following convergence properties hold:
ⅰ) uk→u and wk→w strongly in L∞(0,T;L2(Ω)).
ⅱ) pk→p and qk→q strongly in L∞(0,T;H1(Ω)).
ⅲ) uk⇀u and wk⇀w weakly in L2(0,T;H1(Ω)).
ⅳ) ∂tuk→∂tu and ∂twk→∂tw weakly in L2(0,T;[H1(Ω)]∗).
ⅴ) uk∇pk→u∇p and wk∇qk→w∇q strongly in L1((0,T)×Ω).
In fact, estimate (3.3) guarantees that uk and wk are uniformly bounded in L∞(0,T;Lα(Ω)) with respect to k≥1. Therefore, Proposition 4.5 applied to the Cauchy differences uk−ul, wk−wl, k,l∈N guarantees that uk and wk are Cauchy sequences in L∞(0,T;L2(Ω)), giving ⅰ). Now, let ¯p=pk−pl with k,l∈N, and denote ¯w=wk−wl. Multiplying by ¯p the difference of the third equations of (1.2) and integrating in space, we get
∫Ω¯p2dx+∫Ω|∇¯p|2dx≤∫Ω¯w2dx |
Similarly, with the fourth equation we compute
∫Ω¯q2dx+∫Ω|∇¯q|2dx≤∫Ω¯u2dx. |
Thus, using Proposition 4.5, we have
‖¯p(t)‖H1+‖¯q(t)‖H1≤C(‖u0,k(t)−u0,l(t)‖2+‖w0,k(t)−w0,l(t)‖2)eC(M)T. | (4.11) |
This means that pk and qk are Cauchy sequences in L∞(0,T;H1(Ω)), so we get ii). Next, multiply the first and second lines of (1.2) by uk and wk, respectively, and integrate in space. Using (3.13), (3.14), we find
12ddt∫Ωu2kdx+∫Ω|∇uk|2dx≤12∫Ω|∇uk|2dx+C∫Ωu2kdx,12ddt∫Ωw2kdx+∫Ω|∇wk|2dx≤C∫Ωw2kdx. |
Integrating in time gives that ∇uk,∇wk are in L2(0,T;L2(Ω)) uniformly in k. From this we find iii).
It is classical to check that ∂tuk(t)=∇⋅(∇uk−uk∇pk)+ukwk−uk∈(H1)∗ and ∂twk(t)=∇⋅(∇wk+wk∇qk)+wk−w2k−ukwk∈(H1)∗. For instance, if φ∈L2(0,T;H1), then we find (to take just the term involving ∇uk, and using that ∇uk is in L2(0,T;L2(Ω)) uniformly in k)
|∫T0∫Ω∇uk⋅∇φdxdt|≤(∫T0∫Ω|∇uk|2dxdt)1/2(∫T0∫Ω|∇φ|2dxdt)1/2≤C‖φ‖L2(0,T;H1(Ω)). |
Treating the other terms similarly, we get that ∂tuk and ∂twk are bounded in L2(0,T;[H1(Ω)]∗), so iv) holds. The last convergence follows from the previous ones.
Thus, we can pass to the limit k→∞ in (4.10) to find that (u,w,p,q) is a weak solution of (1.2). The condition (u(0),w(0))=(u0,w0) is satisfied by continuity at t=0 which follows from the estimate on the time derivatives. Finally, using the approximating by classical solutions we can check that the stability result from Proposition 4.5 and estimate (4.11) hold for weak solutions. This can be used to prove uniqueness: using the notations in Proposition 4.5, if (ui,wi,pi,qi), i=1,2 are two weak solutions associated to the same initial data, then (4.7) proves that (u1,w1)=(u2,w2) a.e. on [0,T]×Ω. In turn, the estimate (4.11) (which, since it is a direct consequence of Proposition 4.5, also holds for weak solutions) gives uniqueness of p and q.
In order to show some of the relevant features of the system, we provide in this section the details of a numerical simulation of (1.2). Our goal is to present an implicit-explicit finite volume scheme and showcase some numerical results exhibiting the system's main features, namely, evasive behavior of the prey, and chasing by the predator.
We consider the system (1.2) in a rectangular domain Ω=[0,Lx]×[0,Ly], where we introduce a cartesian mesh consisting of the cells Ii,j:=[xi−12,xi+12]×[yj−12,yj+12], which for the sake of simplicity, are assumed square with uniform size, so |Ii,j|:=h2 for all i and j. Consider a step size Δt>0 to discretize the time interval (0,T). Let N>0 the smallest integer such that NΔt≤T and set tn:=nΔt for n∈{0,N}. The cell average of a quantity v at time t is defined by
¯vi,j(t):=1h2∫Ii,jv(t,x)dx, |
and define ¯vni,j:=¯vi,j(tn). Note that in this section we use x=(x,y) to denote the spatial variable. Let fk(u,w), k=1,2, be the reactive terms in the right-hand side of the first two equations in (1.2). Then, the terms
1h2∫Ii,jfk(u(t,x),w(t,x))dx,k=1,2 |
are approximated by fk,i,j:=fk(¯ui,j,¯wi,j),k=1,2. The Laplacian on a Cartesian grid is discretized via
Δi,ju:=1h(Fi+12,j−Fi−12,j)+1h(Fi,j+12−Fi,j−12),Fi+12,j:=1h(¯ui+1,j−¯ui,j),Fi,j+12:=1h(¯ui,j+1−¯ui,j). |
The numerical fluxes in the x- and y- directions are respectively
F1i+12,j(p)={¯ui,j¯pi+12,jif ¯pi+12,j>0¯ui+1,j¯pi+12,jif ¯pi+12,j<0,¯pi+12,j=¯pi+1,j−¯pi,jh, | (5.1) |
and
F1i,j+12(p)={¯ui,j¯pi,j+12if ¯pi,j+12>0¯ui,j+1¯pi,j+12if ¯pi,j+12<0,¯pi,j+12=¯pi,j+1−¯pi,jh, | (5.2) |
and in a similar way for F2i+12,j(q) and F2i,j+12(q). Finally we incorporate a first-order Euler time integration for the u and w components. The diffusive terms are treated in an implicit form and an explicit form is used for the convective and reactive terms. The initial data are approximated by their cell averages,
¯u0i,j:=1h2∫Ii,ju0(x)dx,¯w0i,j:=1h2∫Ii,jw0(x)dx. |
To advance the numerical solution from tn to tn+1=tn+Δt, we use the following finite volume scheme: given un=(¯uni,j) and wn=(¯wni,j) for all cells Ii,j at time t=tn, the unknown values un+1 and wn+1 are determined by the following two steps implicit-explicit scheme:
Step 1 solve for p=(¯pi,j) and q=(¯qi,j)
−DpΔhp+δpIp=δwIwn | (5.3a) |
−DqΔhq+δqIq=δuIun. | (5.3b) |
Step 2 solve for un+1=(¯un+1i,j) and wn+1=(¯wn+1i,j)
¯un+1i,j−ΔtΔi,jun+1=¯uni,j+Δtfn1,i,j+Δt(F1i+12,j(p)−F1i−12,j(p)h+F1i,j+12(p)−F1i,j−12(p)h) | (5.4a) |
¯wn+1i,j−ΔtDwΔi,jwn+1=¯wni,j+Δtfn2,i,j+Δt(F2i+12,j(q)−F2i−12,j(q)h+F2i,j+12(q)−F2i,j−12(q)h) | (5.4b) |
where we have used the notation Δh=(Δi,j) to indicate the matrix of the discrete Laplacian operator, and I is the identity matrix.
Theorem 5.1. Suposse that f1(u,w)=u(αw−1) and f2(u,w)=βw(1−u−w) Then the solutions ¯pi,j, ¯qi,j and ¯un+1i,j, ¯wn+1i,j of the finite volume scheme (5.3a)–(5.3b) and (5.4a)–(5.4b) respectively, are nonnegatives for all i,j provided ¯uni,j, ¯wni,j are nonnegative for all i,j, and the following CFL-like condition is satisfied:
Δth≤min{12a,12b,1K}, | (5.5) |
where
a=maxi,j{|¯pi+12,j|,|¯qi+12,j|},b=maxi,j{|¯pi,j+12|,|¯qi,j+12|}, |
K=‖f1,u‖∞+‖f1,w‖∞+‖f2,u‖∞+‖f2,w‖∞. |
Proof. In (5.3a)–(5.3b), we have a linear system of algebraic equations for ¯pi,j and ¯qi,j which need to be solve in each time step tn. However, observe that the matrix of these linear systems are diagonally dominant, which guarantee the existence of solution and the positivity of pi,j and qi,j. Each system of equations (5.4a)–(5.4b) can be seen as a linear system for ¯un+1i,j and ¯wn+1i,j respectively, where the right side is positive according with the CFL condition (5.5) (see [26,27,28]) which guarantees the positivity of ¯un+1i,j and ¯wn+1i,j.
Each system of linear algebraic equations for ¯pi,j, ¯qi,j and ¯un+1i,j, ¯wn+1i,j can be solved by using an accurate and efficient linear algebraic solver.
In this numerical test, shown in Figure 1, we suppress the terms on the right-hand side of (1.2), to ignore the population dynamics and emphasize the effect of the pursuit and evasion. We can see that the predator starts to chase the prey even though at first any direct contact with it would be very small (due to diffusion only). The prey takes evasive action immediately. Note that by choosing large δu,δw in this example, we see from Tables 1 and 2 that this may be interpreted as saying that the chemical sensitivity of the predator and prey are large compared to their diffusion rates. Therefore, we expect that the movement observed in Figure 1 is due to the attraction and repulsion terms and not so much to the diffusion. The numerical parameters are a 400 by 400 spatial cell grid, and a time step of 0.01.
Parameter | Units | Physical meaning |
αu,αw | ℓ2/t | Diffusion rate of predators and prey |
αp,αq | ℓ2/t | Diffusion rate of prey and predator odor |
¯α | (biot)−1 | Predator growth rate from predation |
¯β | t−1 | Predator death rate |
γ | t−1 | Prey growth rate |
Kw | bioℓ2 | Prey carrying capacity |
δ | (biot)−1 | Prey death rate from predation |
βu,βw | ℓ4t⋅odor | Predator (resp. prey) odor sensitivity |
¯δw,¯δu | odort⋅bio | Prey (resp. predator) odor production rate |
¯δp,¯δq | t−1 | Prey (resp. predator) odor degradation rate |
Dimensionless parameter | Physical meaning |
Dw=αw/αu | Prey diffusion rate relative to predator diffusion rate |
α=¯αKw/¯β | Predator efficiency relative to death rate |
β=γ/¯β | Prey growth rate relative to predator death rate |
Dp=αp/αu | Prey odor diffusion rate relative to predator diffusion rate |
Dq=αq/αu | Predator odor diffusion rate relative to predator diffusion rate |
δw=βuKw¯δw/(αu¯β) | Normalized prey odor production rate |
δu=βwγ¯δu/(αu¯β¯δ) | Normalized prey odor production rate |
δp=¯δp/¯β | Prey odor degradation rate relative to predator death rate |
δq=¯δq/¯β | Predator odor degradation rate relative to predator death rate |
In this test, shown in Figure 2, we set some generic parameters in the system (1.2) in order to observe the full behavior. We can see now the predator-prey interaction taking place, as the densities of the two species fluctuate more widely in relation to the previous example, due to the predator's population growth from predation. After some time, the solution seems to exhibit wave-like interaction patterns with decreasing amplitudes, stabilizing around the values predicted by the equilibrium point (α−1α,1α)=(0.9,0.1). Although here we show the solution only until t=10, computation up to larger times, not shown here, confirm this behavior. The numerical parameters are a 400 by 400 spatial cell grid, and a time step of 0.01.
This test, which we show in Figure 3, implements a variant of the proposed method for system (1.2) with Dirichlet boundary conditions instead of the conditions (1.3). The parameters are the same as in Test 1. We can see that although the general dynamics remains similar, the boundary behavior affects the solution, in particular making the maximum density smaller. This in natural, since a Dirichlet condition corresponds, physically, to an absorption, or death, at the boundary.
One can also see, especially on the prey column, the formation of steep gradients along the border (boundary layers). This, again, is natural, since with the parameters of the simulation, the evasion dynamics of the prey should be dominant. Since evasion corresponds in (1.2) to an advection term, the formation of boundary layers when considering Dirichlet conditions is to be expected.
In this work, we have studied analytically and numerically a system of parabolic-elliptic PDEs modeling predator-prey dynamics including prey- and predator-taxis, indirect detection by means of a "potential" or odor, diffusion, and Lotka–Volterra dynamics. We have seen that the system is well posed and established boundedness properties of the solution in Lebesgue spaces. Although these purely mathematical properties may not be of immediate biological relevancy, the reasonings and results establish that the model does not lead to non-biological phenomena such as blow-up in finite time – this being by no means a given property of systems of parabolic equations.
The Lotka–Volterra dynamics with logistic term featured in the right-hand side of our system was chosen since it is the simplest model not leading to unrealistic population explosions. Therefore, possible extensions of our work include the question of whether the results still hold for more realistic population dynamics, namely Holling-type, or after the inclusion of Allee effects, prey handling time, etc.
One other obvious extension to the system (1.2) would be to consider a fully parabolic system where the odor diffusion time scale is of the same order than the population diffusion time scale. In that case, the analysis is more involved. We plan to address this question in future work.
P.A. was partially supported by Faperj "Jovem Cientista do Nosso Estado" grant no. 202.867/2015, Capes by PRONEX, and CNPq grant no. 442960/2014-0. B.T. acknowledges the support from Capes via a doctoral grant from the Institute of Mathematics of UFRJ. L.M.V. was supported by CONICYT/PIA/Concurso Apoyo a Centros Científicos y Tecnológicos de Excelencia con Financiamiento Basal AFB170001. The authors would also like to thank the anonymous referee for their insightful comments.
The authors declare there is no confict of interest.
The dimensional version of system (1.2) reads as follows:
{∂tu−αuΔu+∇⋅(uβu∇p)=¯αwu−¯βu∂tw−αwΔw−∇⋅(wβw∇q)=γw(1−w/Kw)−δwu−αpΔp=¯δww−¯δpp−αqΔq=¯δuu−¯δqq, | (6.1) |
supplemented with appropriate no-flux boundary conditions similar to (1.3).
In Table 1 we present the physical meaning of the parameters appearing in (6.1), and in Table 2 we show the dimensionless parameters appearing in system (1.2), obtained after a standard non-dimensionalization procedure applied to the system (6.1).
[1] | B. Ainseba, M. Bendahmane and A. Noussair, A reaction-diffusion system modeling predator-prey with prey-taxis, Nonlinear Anal- Real., 9 (2008), 2086–2105. |
[2] | A. Chakraborty, M. Singh, D. Lucy, et.al., Predator-prey model with prey-taxis and diffusion, Math. Comput. Model., 46 (2007), 482–498. |
[3] | T. Goudon, B. Nkonga, M. Rascle, et. al., Self-organized populations interacting under pursuit- evasion dynamics, Physica D: Nonlinear Phenomena, 304–305 (2015), 1–22. |
[4] | T. Goudon and L. Urrutia, Analysis of kinetic and macroscopic models of pursuit-evasion dynamics, Commun. Math. Sci., 14 (2016), 2253–2286. |
[5] | X. He and S. Zheng, Global boundedness of solutions in a reaction-diffusion system of predator- prey model with prey-taxis, Appl. Math. Lett., 49 (2015), 73–77. |
[6] | H. Jin and Z. Wang, Global stability of prey-taxis systems, J. Differ. Equations, 262 (2017), 1257– 1290. |
[7] | J. M. Lee, T. Hillen and M. A. Lewis, Continuous traveling waves for prey-taxis. Bull. Math. Biol., 70 (2008), 654. |
[8] | J. M. Lee, T. Hillen and M. A. Lewis, Pattern formation in prey-taxis systems, J. Biol. Dyn., 3 (2009), 551–573. |
[9] | Y. Tao, Global existence of classical solutions to a predator-prey model with nonlinear prey-taxis Nonlinear Anal. Real World Appl., 11 (2010), 2056–2064. |
[10] | Y. Tyutyunov, L. Titova and R. Arditi, A Minimal Model of Pursuit-Evasion in a Predator-Prey System.Math. Model. Nat. Pheno., 2 (2007), 122–134. |
[11] | Ke Wang, Qi Wang and Feng Yu, Stationary and time-periodic patterns of two-predator and one- prey systems with prey-taxis, Discrete Contin. Dyn. S., 37 (2016), 505–543. |
[12] | X. Wang, W. Wang and G. Zhang, Global bifurcation of solutions for a predator-prey model with prey-taxis,Math. Method. Appl. Sci., 38 (2015), 431–443. |
[13] | S. Wu, J. Shi and B. Wu, Global existence of solutions and uniform persistence of a diffusive predator–prey model with prey-taxis, J. Differ. Equations, 260, (2016). |
[14] | T.Xiang, Global dynamicsfora diffusive predator-preymodelwith prey-taxisand classicalLotka– Volterra kinetics, Nonlinear Anal. Real World Appl., 39 (2018), 278–299. |
[15] | Y. Tao and M. Winkler. Boundedness vs. blow-up in a two-species chemotaxis system with two chemicals. Discrete Contin. Dyn. S., 20 (2015), 3165–3183. |
[16] | R. Alonso, P. Amorim and T. Goudon, Analysis of a chemotaxis system modeling ant foraging, Math. Models Methods Appl. Sci., 26 (2016),1785–1824. |
[17] | E. De Giorgi, Sulla differenciabilità e l'analiticità delle estremali degli integrali multipli regolari, Mem. Acccad. Sci. Torino. Cl. Sci. Fis. Mat. Nat., 3 (1957), 25–43. |
[18] | E. Keller and L. Segel, Initiation of slide mold aggregation viewed as an instability, J. Theor. Biol., 26 (1970), 399–415. |
[19] | E. Keller and L. Segel, Model for Chemotaxis, J. theor. Biol., 30 (1971), 225–234. |
[20] | T. Hillen and K. J. Painter, A user's guide to PDE models for chemotaxis, J. Math. Biol., 58 (2009), 183–217. |
[21] | B. Perthame, Transport Equations in Biology. Birkhäuser Verlag, Basel - Boston - Berlin. |
[22] | L. Caffarelli and A. Vasseur, Drift diffusion equations with fractional diffusion and the quasi- geostrophic equation, Ann. Math., 171 (2010), 1903–1930. |
[23] | L. Caffarelli and A. Vasseur, The De Giorgi method for nonlocal fluid dynamics, in Nonlinear Partial Differential Equations, Advanced Courses in Mathematics–CRM Barcelona (Birhäuser, 2012), 1–38. |
[24] | B. Perthame and A. Vasseur, Regularization in Keller–Segel type systems and the De Giorgi method, Commun. Math. Sci., 10 (2012), 463–476. |
[25] | H. Brézis, Analyse Fonctionnelle, Théorie et Applications (Masson, 1987). |
[26] | A. Chertock and A. Kurganov, A second-order positivity preserving central-upwind scheme for chemotaxis and haptotaxis models, Numer. Math., 111 (208), 169–205. |
[27] | H. Holden, K. H. Karlsen and N. H. Risebro, On uniqueness and existence of entropy solutions of weakly coupled systems of nonlinear degenerate parabolic equations, Electron. J. Differential Equations, 46 (2003), 1–31. |
[28] | R. Bürger, R. Ruiz-Baier and K. Schneider, Adaptive multiresolution methods for the simulation of waves in excitable media, J. Sci. Comput., 43 (2010), 261–290. |
1. | Paulo Amorim, Bruno Telch, A chemotaxis predator-prey model with indirect pursuit-evasion dynamics and parabolic signal, 2021, 500, 0022247X, 125128, 10.1016/j.jmaa.2021.125128 | |
2. | Bruno Telch, Global boundedness in a chemotaxis quasilinear parabolic predator–prey system with pursuit-evasion, 2021, 59, 14681218, 103269, 10.1016/j.nonrwa.2020.103269 | |
3. | Raimund Bürger, Rafael Ordoñez, Mauricio Sepúlveda, Luis Miguel Villada, Numerical analysis of a three-species chemotaxis model, 2020, 80, 08981221, 183, 10.1016/j.camwa.2020.03.008 | |
4. | Paulo Amorim, Raimund Bürger, Rafael Ordoñez, Luis Miguel Villada, Global existence in a food chain model consisting of two competitive preys, one predator and chemotaxis, 2023, 69, 14681218, 103703, 10.1016/j.nonrwa.2022.103703 | |
5. | Jiashan Zheng, Pengmei Zhang, Blow-up prevention by logistic source an N-dimensional parabolic-elliptic predator-prey system with indirect pursuit-evasion interaction, 2023, 519, 0022247X, 126741, 10.1016/j.jmaa.2022.126741 | |
6. | Shuyan Qiu, Chunlai Mu, Hong Yi, Boundedness and Asymptotic Stability in a Predator-Prey Chemotaxis System with Indirect Pursuit-Evasion Dynamics, 2022, 42, 0252-9602, 1035, 10.1007/s10473-022-0313-7 | |
7. | Xu Liu, Jiashan Zheng, Convergence rates of solutions in apredator-preysystem withindirect pursuit-evasion interaction in domains of arbitrary dimension, 2023, 28, 1531-3492, 2269, 10.3934/dcdsb.2022168 | |
8. | Purnedu Mishra, Dariusz Wrzosek, Repulsive chemotaxis and predator evasion in predator–prey models with diffusion and prey-taxis, 2022, 32, 0218-2025, 1, 10.1142/S0218202522500014 | |
9. | Ailing Xiang, Liangchen Wang, Boundedness of solutions in a predator–prey system with density-dependent motilities and indirect pursuit–evasion interaction, 2023, 71, 14681218, 103797, 10.1016/j.nonrwa.2022.103797 | |
10. | Purnedu Mishra, Dariusz Wrzosek, Pursuit-evasion dynamics for Bazykin-type predator-prey model with indirect predator taxis, 2023, 361, 00220396, 391, 10.1016/j.jde.2023.02.063 | |
11. | Dayong Qi, Yuanyuan Ke, Large time behavior in a predator-prey system with pursuit-evasion interaction, 2022, 27, 1531-3492, 4531, 10.3934/dcdsb.2021240 | |
12. | Qian Cao, Jianhua Wu, Pattern formation of reaction–diffusion system with chemotaxis terms, 2021, 31, 1054-1500, 113118, 10.1063/5.0054708 | |
13. | Bruno Telch, A parabolic-quasilinear predator-prey model under pursuit-evasion dynamics, 2022, 514, 0022247X, 126276, 10.1016/j.jmaa.2022.126276 | |
14. | Haotian Tang, Jiashan Zheng, Kaiqiang Li, Global and bounded solution to a quasilinear parabolic-elliptic pursuit-evasion system in N-dimensional domains, 2023, 527, 0022247X, 127406, 10.1016/j.jmaa.2023.127406 | |
15. | Zhangsheng Zhu, Asymptotic stability in a predator-prey system with density-dependent diffusion and indirect pursuit-evasion interaction in 2D, 2024, 2024, 1687-2770, 10.1186/s13661-024-01960-1 | |
16. | Zhoumeng Xie, Yuxiang Li, Classical solutions to a pursuit‐evasion model with prey‐taxis and indirect predator‐taxis, 2024, 0170-4214, 10.1002/mma.10536 | |
17. | M. Bendahmane, H. Nzeti, J. Tagoudjeu, M. Zagour, Stochastic reaction–diffusion system modeling predator–prey interactions with prey-taxis and noises, 2023, 33, 1054-1500, 10.1063/5.0140102 | |
18. | Chuanjia Wan, Pan Zheng, Boundedness and stabilization in an indirect pursuit-evasion model with nonlinear signal-dependent diffusion and sensitivity, 2025, 82, 14681218, 104234, 10.1016/j.nonrwa.2024.104234 | |
19. | Zi-Han Zheng, Li-Ming Cai, Global boundedness for a predator-prey model with nonlinear indirect pursuit-evasion effect, 2024, 0, 2163-2480, 0, 10.3934/eect.2024059 | |
20. | Chang-Jian Wang, Zi-Han Zheng, The effects of cross-diffusion and logistic source on the boundedness of solutions to a pursuit-evasion model, 2023, 31, 2688-1594, 3362, 10.3934/era.2023170 | |
21. | Kevin J. Painter, Valeria Giunta, Jonathan R. Potts, Sara Bernardi, Variations in non-local interaction range lead to emergent chase-and-run in heterogeneous populations, 2024, 21, 1742-5689, 10.1098/rsif.2024.0409 |
Parameter | Units | Physical meaning |
αu,αw | ℓ2/t | Diffusion rate of predators and prey |
αp,αq | ℓ2/t | Diffusion rate of prey and predator odor |
¯α | (biot)−1 | Predator growth rate from predation |
¯β | t−1 | Predator death rate |
γ | t−1 | Prey growth rate |
Kw | bioℓ2 | Prey carrying capacity |
δ | (biot)−1 | Prey death rate from predation |
βu,βw | ℓ4t⋅odor | Predator (resp. prey) odor sensitivity |
¯δw,¯δu | odort⋅bio | Prey (resp. predator) odor production rate |
¯δp,¯δq | t−1 | Prey (resp. predator) odor degradation rate |
Dimensionless parameter | Physical meaning |
Dw=αw/αu | Prey diffusion rate relative to predator diffusion rate |
α=¯αKw/¯β | Predator efficiency relative to death rate |
β=γ/¯β | Prey growth rate relative to predator death rate |
Dp=αp/αu | Prey odor diffusion rate relative to predator diffusion rate |
Dq=αq/αu | Predator odor diffusion rate relative to predator diffusion rate |
δw=βuKw¯δw/(αu¯β) | Normalized prey odor production rate |
δu=βwγ¯δu/(αu¯β¯δ) | Normalized prey odor production rate |
δp=¯δp/¯β | Prey odor degradation rate relative to predator death rate |
δq=¯δq/¯β | Predator odor degradation rate relative to predator death rate |
Parameter | Units | Physical meaning |
αu,αw | ℓ2/t | Diffusion rate of predators and prey |
αp,αq | ℓ2/t | Diffusion rate of prey and predator odor |
¯α | (biot)−1 | Predator growth rate from predation |
¯β | t−1 | Predator death rate |
γ | t−1 | Prey growth rate |
Kw | bioℓ2 | Prey carrying capacity |
δ | (biot)−1 | Prey death rate from predation |
βu,βw | ℓ4t⋅odor | Predator (resp. prey) odor sensitivity |
¯δw,¯δu | odort⋅bio | Prey (resp. predator) odor production rate |
¯δp,¯δq | t−1 | Prey (resp. predator) odor degradation rate |
Dimensionless parameter | Physical meaning |
Dw=αw/αu | Prey diffusion rate relative to predator diffusion rate |
α=¯αKw/¯β | Predator efficiency relative to death rate |
β=γ/¯β | Prey growth rate relative to predator death rate |
Dp=αp/αu | Prey odor diffusion rate relative to predator diffusion rate |
Dq=αq/αu | Predator odor diffusion rate relative to predator diffusion rate |
δw=βuKw¯δw/(αu¯β) | Normalized prey odor production rate |
δu=βwγ¯δu/(αu¯β¯δ) | Normalized prey odor production rate |
δp=¯δp/¯β | Prey odor degradation rate relative to predator death rate |
δq=¯δq/¯β | Predator odor degradation rate relative to predator death rate |