• Aucun résultat trouvé

Discrete coagulation-fragmentation system with transport and diffusion

N/A
N/A
Protected

Academic year: 2022

Partager "Discrete coagulation-fragmentation system with transport and diffusion"

Copied!
23
0
0

Texte intégral

(1)

ANNALES

DE LA FACULTÉ DES SCIENCES

Mathématiques

STÉPHANEBRULL

Discrete coagulation-fragmentation system with transport and diffusion

Tome XVII, no3 (2008), p. 439-460.

<http://afst.cedram.org/item?id=AFST_2008_6_17_3_439_0>

© Université Paul Sabatier, Toulouse, 2008, tous droits réservés.

L’accès aux articles de la revue « Annales de la faculté des sci- ences de Toulouse Mathématiques » (http://afst.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://afst.cedram.

org/legal/). Toute reproduction en tout ou partie cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation à fin strictement personnelle du copiste est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.

cedram

Article mis en ligne dans le cadre du

Centre de diffusion des revues académiques de mathématiques

(2)

Annales de la Facult´e des Sciences de Toulouse Vol. XVII, n3, 2008 pp. 439–460

Discrete coagulation-fragmentation system with transport and diffusion

()

St´ephane Brull(1)

ABSTRACT.—We prove the existence of solutions to two infinite sys- tems of equations obtained by adding a transport term to the classical discrete coagulation-fragmentation system and in a second case by adding transport and spacial diffusion. In both case, the particles have the same velocity as the fluid and in the second case the diffusion coefficients are equal. First a truncated system in size is solved and after we pass to the limit by using compactness properties.

R´ESUM ´E.—On d´emontre l’existence de solutions pour deux syst`emes infinis d’´equations de coagulation-fragmentation. Dans un premier cas, on rajoute un terme de transport au syst`eme classique de coagulation- fragmentation et dans un second cas on rajoute un terme de transport et un terme de diffusion. Dans les deux cas les particules poss`edent la mˆeme vitesse que le fluide et dans le second cas les coefficients de diffusion sont

´egaux. On r´esout dans un premier temps un probl`eme tronqu´e en taille puis on passe `a la limite en utilisant des lemmes de compacit´e.

1. Introduction

Coagulation and fragmentation processes describe the mecanism by which clusters can coalesce with other clusters to form a larger cluster and can fragment to form two smaller pieces. The clusters are usually identified to their size which can be a positive number in the case of a continous model or an integer in the case of a discrete model. In this paper, only discrete models will be considered.ci(t, x) will denote the concentration of clusters containing i particles (i-mers, denoted by Pi in the sequel) at time t and positionx.iwill be called the size variable. More precisely, the coagulation corresponds to the chemical reaction

Pi+Pj →Pi+j.

() Re¸cu le 2 mars 2007, accept´e le 10 avril 2008

(1) ANLA, University of Toulon, avenue de l’universit´e, 83957 La Garde, France.

(3)

Two clusters of sizeiandjwill give a bigger cluster of sizei+j. The velocity of this reaction is equal to ai,jcicj, where (ai,j)(i,j)N×N is called the coagulation kernel. The fragmentation corresponds to the inverse reaction

Pi+j→Pi+Pj.

One cluster containing i+j particles gives two clusters containing respec- tively i and j particles. The velocity of this reaction is equal to bi,jci+j, where (bi,j)(i,j)N×N is called the fragmentation kernel.

When the two equations are in competition, we obtain the equilibrium Pi+Pj−→←Pi+j.

The velocity vi,j of this reaction is vi,j = ai,jcicj −bi,jci+j. As a math- ematical point of view, this problem has been widely studied in ([1], [2], [3]).

In the same time, these particles are in a mouving fluid and the Fick law reads ([9], [1])

tci+div(ji) =Qi(c), (1.1) where ji is the flux due to the motion of the clusters of sizei. The flux is decomposed into two terms as ji =uici−di∇ci. ui is the velocity of the clusters of sizeianddi is the velocity of diffusion of the particles of sizei.

The termuici is due to the displacement of the fluid and the termdi∇ci

is due to the diffusion of the particles in the fluid. These two terms depend on the geometry and on the velocity of the flow.

If the fluid is viscous enough, the diffusion term of the flux is prepon- derant compared to the term due to the transport, (1.1) becomes

tci−d(i)∆ci=Qi(c).

This case has been investigated in ([6], [7], [10]). An existence theorem is proved in ([7]) when the diffusion coefficients d(i) are equal and in ([6]), the asymptotic behaviour of the solutions in time is studied. In ([11]) an existence theorem is established when the size variable is continous.

When the transport term is preponderant compared to the diffusion term, one obtains

tci+div(uci) =Qi(c). (1.2) This case has been studied in ([4], [8]) for continous models.

(4)

When both phenomena are comparable, the equation (1.1) reads

tci+div(uci)−d(i)∆ci=Qi(c). (1.3) Qi(c) is a source term coming from the velocity of the reaction defined by Qi(c) =

i1

k=1

ak,ikckcik+ 2 k=1

bk,ici+k2 k=1

ak,ickci

i1

k=1

bk,ikci.(1.4)

The term

i1

k=1

ak,ikckcik accounts the formation of clustersPi by coales- cence of two smaller clusters. 2

k=1

bk,ici+k represents the gain of clustersPi

by fragmentation of larger clusters. 2 k=1

ak,ickci accounts the depletion of clustersPi by coagulation with another cluster, and

i1

k=1

bk,ikci represents the fragmentation of clustersPi into two smaller clusters.

In this paper, we will assume that the coefficientsai,k andbi,kfulfill the conditions

ai,k=ak,i>0, bi,k=bk,i >0, ai,k=o(k)bi,k =o(k), sup

k

ai,k

k <∞, sup

k

bi,k

k <∞. (1.5) u(t, x) is the velocity of the fluid in which are the clusters. All the clus- ters are supposed to have the velocity of the fluid which is assumed to be incompressible.

This paper is organized as follows. The second section is devoted to the case 1.2. An existence theorem is proved when all the clusters have the velocity of the fluid. The third section deals with the case 1.3 where an existence theorem is established.

(5)

2. The case of pure transport 2.1. Setting of the problem

Consider the equation for any i∈N,

tci(t, x) +div(uci)(t, x) =Qi(c)(t, x), t >0, xRD, (2.6)

ci(0, x) =c0i(x), xRD. (2.7)

whereQi has been defined in (1.4). We will consider weak solutions to the problem (2.6-2.7) in the following sense

Definition 2.1. —(ci)iN is a weak solution to the problem (2.6-2.7) if for anyi∈N,ci∈ C0(R+×RD)and

RDc0i(x)ϕ(0, x)dx

R+

RDu ci(t, x)∇xϕdsdx

R+

RDci(t, x)∂tϕdsdx=

R+

RDQi(c)(t, x)ϕ(t, x)dxds, for each ϕ∈ C1(R+×RD) with compact support inR+×RD.

In this section the main result is,

Theorem 2.2. — Assume that the coefficients ai,k and bi,k satisfy the assumptions (1.5), that the initial data satifies for anyi∈N

c0i 0, c0i ∈C1(RD), (i, x) →∂xc0i(x)∈L(RD×N), ρ0=

+

i=1

ic0i ∈L(RD), and that the velocityu∈C1(R+×RD)is bounded, fulfills the incompress- ibility conditiondiv(u) = 0, and is such that∂xuis bounded.

Then, the system (2.6-2.7) has a weak solution (ci)iN in the sense of Definition 2.1.

As in ([7]-[14]), we shall proceed into two steps. First, a truncated prob- lem in size will be solved by a fix point argument and in a second step we will pass to the limit.

2.2. Resolution of a truncated problem

LetN Nbe given. In this part, the sizes greater thanN are neglected by considering the following problem fori∈ {1· · ·N}.

tcNi (t, x) +div(ucNi )(t, x) = (GNi −PiN)(cN)(t, x), t >0, xRD, (2.8)

(6)

cNi (0;x) =c0,Ni (x), xRD, (2.9) where

c0,Ni =c0i if iN c0,Ni = 0 else

GNi (c) =

i1

k=1

ak,ikckcik+ 2

Ni k=1

bk,ici+k and PiN(c) =νiN(c)ci (2.10)

with

νiN =

i1

k=1

bk,ik+ 2

Ni

k=1

ak,ick,i.

Proposition 2.3. — Under the hypotheses of Theorem 2.2, the system (2.8-2.9) possesses a unique solution on R+×RD.

The solution of the truncated problem (2.8-2.9) will be the fix point of a mapping Γ. First, the following Lemma whose proof is given in ([7]) will be used.

Lemma 2.4. — For all N-uple{c1...cN} such that, for all i,ci 0, it holds that

νiN(c)0, GNi (c)0, iN|AN sup

i=1..N

ci+BN,

|GNi (c)|( sup

i=1..N

cNi )2AN +BN sup

i=1..N

cNi .

Consider YN the solution to the Cauchy problem dYN

dt =ANYN2+BNYN (2.11)

YN(0) =R0 t >0 (2.12)

Let TN be the time of existence of the solution and T ∈]0, TN[. Consider the space

E={c∈[C0([0;T]×RD)]N(L([0, T]×Rd))N;c0;

c(t, .)[L(Rd)]N YN(t), t[0, T]}. Consider the following iteration

tdn+1i (t, x) +u(t, x).∇xdn+1i (t, x) = [GNi (dni)−ν(dni)dn+1i ](t, x), (2.13)

(7)

dn+1i (0, x) =c0i(x).

(2.14) Let Γ be the map defining this iteration.

Lemma 2.5. — For the same assumptions as for Lemma 2.4,E is stable by Γ.

Proof of Lemma 2.5. — The system (2.8-2.9) is solved on a caracteristic.

Consider the vector fieldX(s, t, x) satisfying

sX(s, t, x) = u(s, X(s, t, x)), (2.15)

X(t, t, x) = x. (2.16)

Then, the solution to the system (2.8-2.9) writes for anyi∈ {1· · ·N}. cNi (s, X(s, t, x)) =c0i(X(0, t, x)) +

t 0

[GNi (cN)−νiNcNi ](s, X(s, t, x))ds.

(2.17) So, by considering the quantity

dn+1i (τ, X(τ, t, x)) exp

τ

0

νiN(dn)(s, X(s, t, x))ds

, the solution to the system (2.13-2.14) reads for anyi∈ {1· · ·N}

dn+1i (t, x) =c0i(X(0, t, x)) exp( t

0

νiN(dn)(s, X(s, t, x))ds +

t 0

exp(−

t s

νiN(dn)(σ, X(σ, t, x))dσ))GNi (dni(s, X(s, t, x))ds.(2.18) Then, by continuity of dni, dn+1i is also continous. Moreover, the nonneg- ativity of c0i and GNi (dn) implies according to (2.18) the nonnegativity of dn+1i . On the other hand, asνiN 0, (2.18) leads to

dn+1i (t, x)c0i(X(0, t, x)) + t

0

GNi (dn)(s, X(s, t, x))ds.

But, asdn∈E and by using Lemma 2.4, it holds that dn+1i (t, x)c0i(X(0, t, x)) +

t 0

d

dsYN(s)ds.

So, finally, we get thatdn+1i (t, x)YN(t).

(8)

We are going to show that this map is a contraction for the norm

|c|= sup

s[0,T]

eωNs|c(s,)[L(Rd)]N

where ωN is a constant which shall be chosen big enough so that Γ is a contraction and whose the choice shall be precized during the proof of the following Lemma.

Lemma 2.6. — There is a nonnegative constant ωN depending only on N such that the mappingΓ is a contraction fromE into itself for the norm

| |.

Proof of lemma 2.6. — By considering two consecutive terms of the it- eration (2.13-2.14) and by substracting them, it holds that

t[dn+1i −dni](t, x)+u(t, x).X(dn+1i −dni)(t, x)+νN(dni)(t, x)(dn+1i −dni)(t, x)

= [GNi (dn)−GNi (dn1)](t, x) +dni(t, x)(νiN(dni1)−νiN(dni))(t, x).

So, (dn+1i −dni)(t, x) writes (dn+1i −dni)(t, x) =

t 0

[GNi (dn)−GNi (dn1)](τ, X(τ, t, x))dτ

+ t

0

dni(τ, X(τ, t, x))[νiN(dn1)−νiN(dn)](τ, X(τ, t, x)) exp(−

t τ

νiN(dn)(s, X(s, t, x))dsdτ.

According to the expression of GNi and PiN, there exists a nonnegative constantC(N, T) such that

|GNi (c)−GNi (d)|C(N, T)c−d[L(Ω)]N,

|PiN(c)−PiN(d)|C(N, T)c−d[L(Ω)]N. (2.19) So,

|(dn+1i −dni)|C(N, T)|dni −dni1|[1−eωNt ωN

].

Hence, by choosingωN big enough such thatk=2C(N,T)ω

N <1, the result is

proved.

(9)

For the proof of Proposition 2.3, the following Lemma will be used

Lemma 2.7. — ForGNi andPiN defined in (2.10), it holds that N

i=1

[iGNi (c)−

iPiN(c)] = 0.

For the proof, see ([7]).

Proof of Proposition 2.3. — From previously, (dni)nN is a converging sequence inE and Γ is a contraction. Therefore the problem (2.8-2.9) has a unique solution on [0, T]×Rd forT∈]0;TN[.

In order to get a global solution onR+×Rd, consider ρN =

N

i=1

icNi , ρ=

+

i=1

ici (2.20)

which represents total mass of particles which react.

Multiply in (2.8-2.9), the equation numberibyi, sum oniuntilN and use Lemma 2.7, leads to

tρN(t, x) +u(t, x).∇xρN(t, x) = 0, (2.21) ρN(0, x) =ρN0(x) =

N i=1

ic0i(x). (2.22)

So, by considering the vector field X(s, t, x) defined by the system (2.15- 2.16), it holds that

0ρN(t, x) =ρN0(X(0, t, x))ρ0(X(0, t, x))ρ0L(RD). (2.23) Hence, (∀i∈ {1;N}), cNi ρ0L(RD).Next, we chooseR0=ρ0L(RD)

and we solve the equation (2.6) for any i ∈ {1....N} on [T,2T] with the Cauchy data equal toci(T,·). Then, a reiteration of this process gives global existence of the solution onR+×RD.

2.3. Solution of the problem

The aim is now to pass to the limit whenN tends to +∞in the system (2.8-2.9).

Proposition 2.8. — For any compact set [0;T]×K of R+×RD and for anyi∈N, the sequence(cNi )NNis strongly compact inC0([0;T]×K).

(10)

Proof of Proposition 2.8. — In order to apply the Ascoli theorem, we shall control tcNi and xcNi . Consider BR the closed ball of RD with a radius equal to R > 0. Hence, by differentiating the relation (2.17) with respect to the space variablexj, it holds that

xj(cNi )(t, x) = X[c0i(X(0, t, x))]

+ t

0

xj[QNi (c)](s, X(s, t, x))∂xjX(s, t, x)ds. (2.24) Now, in order to estimate tX(s, t, x) and xX(s, t, x), let us show the following Lemma.

Lemma 2.9. — Ifu∈C1is bounded on[0;T]×RDand if∂xuis bounded on [0;T]×RD then∂xX and∂tX are bounded on[0;T]2×RD.

Proof of Lemma 2.9. — By integrating (2.15),X writes X(s, t, x) =x+

s t

u(σ, X(σ, t, x))dσ. (2.25) So by differentiating (2.25) with respect to the space variablexand by using that xuis bounded on [0, T]×RD, there existsM >0 such that

|∂xX(s, t, x)|1 +M( t

s

|∂xX(σ, t, x)|dσ).

So, according to the Gronwall lemma, xX(s, t, x) is bounded on [0;T]2× RD. Analogously, the same result holds fortX(s, t, x).

End of the proof Proposition 2.8. — In order to control the term∂xjQi

consider the quantity

x[GNi (cN)] =

i1

k=1

ak,ik

xcNk cNik+cNk xcNik

+ 2 N k=1

bk,ixcNi+k. (2.26)

A bound oncNi independent ofN is first researched inL((0, T);RD).

AsρN0 = N i=1

ic0i andρ0=

i=1

ic0i, withρ0∈L(RD), it holds that

cNi ρN0 L(RD)ρ0L(RD)M0. (2.27)

(11)

Now, let us control the term

i1

k=1

ak,ikxcNk(t, x)cNik(t, x) of the right-hand side of the equation (2.26).

i1

k=1

ak,ikxcNk(t, x)cNik(t, x)

i1

k=1

ak,ik

i−k |∂xcNk(t, x)|(i−k)cNik(t, x) From assumption (1.5), there is A >0 such that

sup

k∈{1,i1}|ak,ik

i−k|A.

Hence,

i1

k=1

ak,ikxcNk(t, x)cNik(t, x)Asup

iN sup

xRD|∂xcNk(t, x)|

i1

k=1

(i−k)cNik. But, by definition ofρN, it comes that

|

i1

k=1

(i−k)cNikN. Then (2.23) leads to

|

i1

k=1

(i−k)cNikL(RD). Therefore, by using (2.27), we get the estimate

i1

k=1

ak,ikxcNk(t, x)cNik(t, x)AM0

sup

iN sup

xRD|∂xcNi (t, x)| .

whereM0is a nonnegative constant. In the same way, we obtain

|

i1

k=1

ak,ikxcNik(t, x)cNk (t, x)|AM0(sup

iN sup

xRD|∂xcNi (t, x)|),

|

N1

k=1

bk,ix(cNi+k(t, x))|B(sup

iN sup

xRD|∂xcNi (t, x)|),

whereBis a constant independent of the variablesk, i, t, x. So finally, there exists a constantC independent of the variablest, x, i, N such that

|∂x[GNi (cN)](t, x)|C(sup

iN sup

xRD|∂xcNi (t, x)|).

(12)

The same result holds forPiN(cN). So, sup

xRDx[cNi (t, x)]L(RD)C+α t

0

sup

xRDx[cNi (s, x)]L(RD)ds, where α and C are nonnegative constants independent of the variables t, x, N. From the Gronwall lemma, it holds that

(∀i∈N),(∀t∈[0;T]),xcNi (t, x)L(RD)Ceαt.

By reasonning in the same way, we can prove that tcNi is also controled.

Then, by using the Ascoli Theorem, the sequence (cNi )NNis strongly com- pact inC0([0;T]×BR) for anyi.

Proof of Theorem 2.2. — By using a diagonal process, there is a subse- quence cφ(N) of cN such that (∀i∈N), cφ(Ni ) is converging to a continous functionci uniformly on all compact set of the form [0;T]×BR. By arguing as in ([7]), it holds that GNi (cN) (resp.PiN(cN)) converges toGi(c) (resp.

Pi(c)) uniformly on [0;T]×BR. So, we can pass to the limit in the weak form of (2.6-2.7).

3. The case of transport and diffusion 3.1. Setting of the problem

In this section, consider the problem

tci(t, x) +div(uci)(t, x)∆ci(t, x) =Qi(c)(t, x) (3.28)

ci(0;x) =c0i(x), xΩ, (3.29)

∂ci

∂η(t, σ) = 0 t >0, σ∈∂Ω, (3.30)

where Ω is an open bounded set of class C1 with ∂Ω as boundary and whereQ(c)ihas been defined in (1.4). It corresponds to the case (1.3) when the diffusion coefficients d(i) are taken equal to one. The solutions of the problem (3.28-3.29-3.30) will be considered in the following sense.

Definition 3.1. — (ci)iNis a weak solution to the problem (3.28-3.29- 3.30) if for anyi∈N and anyT >0,ci∈L2([0, T]×Ω)and

RDc0i(x)ϕ(0, x)dx

R+

RDci(t, x)∂tϕ(t, x)dx

(13)

R+

RDci(s, x)u· ∇xϕ(s, x)dxds−

R+

RDxci(s, x)· ∇xϕ(s, x)dxds

=

R+

RDQi(c)ϕ(s, x)dxds for allϕ∈ C1(R+×RD)with compact support in R+×RD.

The main result of this part is

Theorem 3.2. — Letbe an open and bounded set of class C1. As- sume that the kinetic coefficients (a)(i,j)N×N and (b)(i,j)N×N satisfy the assumptions (1.5), that the initial data satisfies

c0i 0, iN, c0i ∈L2(R+×Ω), ρ0=

+

i=1

ic0i ∈L(Ω).

and that the velocity of the fluid u∈ H1(R+;H01(Ω)∩L(Ω)) fulfills the incompressibility condition div(u) = 0.

Therefore the system (3.28-3.29-3.30) has a weak solution onR+×RD in the sense of Definition 3.1.

As previously, we shall proceed into two parts. First, we shall solve a truncated problem and after we will pass to the limit.

3.2. Resolution of a truncated problem

LetN Nbe given. The sizes greater thanN are removed, by consid- ering the following problem for anyi∈ {1· · ·N},

tcNi +u· ∇xcNi ∆cNi =Qi(cN), (3.31) cNi (0;x) =c0,Ni (x) i∈N, t >0, x∈Ω, (3.32)

∂ηcNi (t, σ) = 0, t >0, σ∈∂Ω. (3.33)

Proposition 3.3. — Under the assumptions of Theorem 3.2, the prob- lem (3.31-3.32-3.33) has a unique solution defined onR+×RD.

Consider the following iteration for anyi∈ {1· · ·N},

tdn+1i ∆dn+1i +u(t, x)· ∇xdn+1i +νiN(dni)dn+1i =GNi (dn), (3.34)

dn+1i (0;x) =c0i(x), (3.35)

∂ηdn+1i (t, σ) = 0, t >0, σ∈∂Ω. (3.36) LetS be the mapping defining this iteration.

(14)

Lemma 3.4. — If for any i∈ {1...N},ci0, then S(c)i0.

Proof of Lemma 3.4. — Consider ci 0 and put di = S(c)i. Consider f ∈C1(R) such thatf is nondecreasing on ]0; +[ andf(t) = 0 fort∈R. Multiply the equation (3.34) satisfied by di by f(−di) and integrate on [0;t]×Ω leads to (∀t∈[0;T]),

t 0

(∂tdi)f(−di)dxdt− t

0

∆dif(−di)dxds+

t 0

u·∇xdif(−di)dxdt

+ t

0

νiN(c)dif(−di) = t

0

GNi (c)f(−di)dxds. (3.37) But, from the Green formula and by using (3.36), it holds that

t

0

∆dif(−di)dxdt= t

0

xdi· ∇xf(−di)dxdt.

Let F be the primitive function of f such thatF(0) = 0. So,F is nonde- creasing on ]0; +[ and is identically 0 on ]− ∞; 0]. Hence, we get

t 0

uj(s, x)∂xjdi(s, x)f(−di)(s, x)dxds= t

0

uj(s, x)∂xjF(−di)(s, x)dsdx.

So, by using the Green formula, it comes that

uj(s, x)∂xjdi(s, x)f(−di)(s, x)dxds =

Γ

uj(s, σ)F(−di)(s, σ)dσ +

∂uj

∂xj

F(−di)(s, x)dx.

But, asu∈H01(Ω) anddiv(u) = 0, we get t

0

u· ∇xdif(−di)dxdt= 0.

So, (3.37) gives the inequality,

F(−di)(x, v)dx

F(−di)(0, v)dx+ t

0

f(−di)|∇xdi|2dxdt +

t 0

νiN(−di)(s, x) (−d)f(−di)(s, x)dxds0. (3.38)

(15)

But, asdi(0;x) =c0i(x),F is identically 0 on ]− ∞; 0] andF(−d)(0;x) = 0.

Moreover,νiN(c) andK(x) =xf(x) are nonnegative quantities. So, t

0

νN(−d)(s, x)(−d)f(−d)(s, x)dxds0.

f being nondecreasingf(−di)0, we get from (3.38),

F(−di)(t, x)dx0.

F(−di) being nonnegative, we obtain thatF(−di) is zeroa.e.F(−di) being continous, F(−di) is zero on [0;T]×RD. So, by definition ofF, d0 on [0;T]×Ω.

A bound inL on the sequencedni is now researched. It is given by the following lemma.

Lemma 3.5. — Letd=S(c). Then for any i∈ {1, N},di satisfies di(t,·)L(Ω) c0iL(Ω)+

t 0

[AN(c(s,·)L(Ω)N)2

+ BNc(s,·)L(Ω)N]ds. (3.39) Proof of lemma 3.5. — Let us put

f(t) = t

0

[AN(c(s,·)L(Ω)N)2+BNc(s,·)L(Ω)N]ds.

Consider now a function Gsuch that G C1(R), G is nondecreasing on ]0; +∞[, (∀s0),G(s) = 0. Let us putKi=c0iL(Ω),H(s) = 0sG(σ)dσ.

For anyi∈ {1, N}, introduce the functionϕi defined by ϕi(t) =

H(di(t, x)−Ki t

0

f(s)ds)dx.

For any i ∈ {1, N} ϕi satisfies ϕi(0) = 0, ϕi C1(]0; +∞[;R) ϕi 0.

Deriveϕi with respect to the time variablet leads to ϕi(t) =

G[di(t, x)−Ki t

0

f(s)ds](∂tdi(t, x)−f(t))dx.

AsνiN(dni)dn+1i 0, it holds that

tdi(t, x)−f(t)∆di(t, x) D j=1

uj(t, x)∂xjdi(t, x).

(16)

So, we get ϕi(t)

G(di(t, x)−Ki t

0

f(s)ds)∆di(t, x)dx

D j=1

uj(t, x)∂xjdi(t, x)G(di(t, x)−Ki t

0

f(s)ds)dx.(3.40)

The definition ofH implies that

xjH

di(t, x)−K− t

0

f(s)ds

=xjdi(t, x)G

di(t, x)−K− t

0

f(s)ds . By using the Green formula, u∈H01(Ω) anddiv(u) = 0, it comes that

D

j=1

uj(t, x)∂xjH[di(t, x)−K− t

0

f(s)ds]dx= 0.

Moreover from the Green formula, it holds that

G(di(t, x)−Ki t

0

f(s)ds)∆di(t, x)dx

=

|∇xdi(t, x)|2G

di(t, x)−K− t

0

f(s)ds dx.

So,G being nondecreasing, (3.40) leads to ϕi(t)

|∇xdi(t, x)|2G((di(t, x)−K− t

0

f(s)ds)dx <0.

Hence, ϕi is nonincreasing on R+. As, ϕi is nonnegative and satisfies ϕi(0) = 0, ϕi yields 0 everywhere. So, by definition of H, (3.39) holds.

We shall use an analogous method as in the previous part. Consider the Cauchy problem

dYN

dt =ANYN2 +BNYN, (3.41) YN(0) =R0, t >0. (3.42) LetTN be the time of existence ofYN and consider T∈[0;TN]. Define the space

E={c∈(L([0, T]×Rd))N;c0;c(t, .)[L(Rd)]N YN(t), t[0, T]}.

(17)

Lemma 3.6. — E is stable byS.

Proof of Lemma 3.6. — Let c∈E and d=S(c). From Lemma 3.4, for any i ∈ {1...N}, di 0. As c E, for any i ∈ {1, N}, ci(t, x) YN(t).

Then, from the maximum principle applied to the equation (3.34), it holds that

di(t,·)L(Ω)c0iL(Ω)+ t

0

[AN(c(s,·)L(Ω)N)2+BNc(s,·)L(Ω)N]ds.

Asc∈E, the equation (3.41) leads to di(t,·)L(Ω)c0iL(Ω)+

t 0

dYN(t) dt (s)ds.

By choosingR0>c0iL(Ω), the result follows.

Eis equipped with the norm

|c|= sup

s[0;T]

|eωNsc(s,·)[L2(Ω)]N

and the constantωN will be chosen so thatSis a contraction for this norm.

Lemma 3.7. — There is a constant ωN depending only onN such that S is a contraction from E into itself for the norm | |.

Proof Lemma 3.7. — Substract two consecutive terms of the iteration, multiply the last equation by (dn+1i −dni)(t, x) and integrate on [0, T]×Ω leads to

t 0

(dn+1i −dni)∂t(dn+1i −dni)dxds t

0

(dn+1i −dni)∆(dn+1i −dni)dxds +

t 0

(dn+1i −dni)u· ∇x(dn+1i −dni)dxds+ t

0

νiN(dni)(dn+1i −dni)dxds

= t

0

(dn+1i −dni)[GNi (dni)−GNi (dni1)]dxds +

t 0

dni (dn+1i −dni)[νN(dn1)−νN(dn))]dxds. (3.43) But, asdn+1i (0, x) =dni(0, x) =c0i(x), it holds that

t 0

(dn+1i −dni)∂t(dn+1i −dni)(s, x)dxds= 1 2

(dn+1i −dni)2(t, x)dx.

Références

Documents relatifs

Abstract The existence of weak solutions to the continuous coagulation equation with mul- tiple fragmentation is shown for a class of unbounded coagulation and fragmentation

The proof requires two steps: a dynamical approach is first used to construct stationary solutions under the additional assumption that the coagulation kernel and the

In this section we test a second order algorithm for the 2-Wasserstein dis- tance, when c is the Euclidean cost. Two problems will be solved: Blue Noise and Stippling. We denote by

In particular, the behaviour of the sequence of the approximating solutions for small and large sizes has to be controlled and the balance between the homogeneity of the

Existence of mass-conserving self-similar solutions with a sufficiently small total mass is proved for a specific class of homogeneous coagulation and fragmentation coefficients..

However, there are few results concerning the convergence analysis of numerical methods for coagulation and fragmentation models (see [17] for quasi Monte-Carlo methods)....

The first term in the fragmentation term (1.1c) involves the overall fragmentation rate a(x) and accounts for the loss of particles of size x due to breakup while the second

Lamb, Existence and uniqueness results for the continuous coagulation and fragmentation equation, Math..