BOLTZMANN AND B.G.K. EQUATIONS
Laurent Desvillettes UNIVERSITE D'ORLEANS Departement de Mathematiques
BP 6759
45067 Orleans Cedex 2 Stephane Mischler UNIVERSITE PARIS 6 Laboratoire d'Analyse Numerique
4, Place Jussieu 75005 Paris January 6, 2004
Abstract
We prove the convergence of splitting algorithmsfor Boltzmann and B.G.K. equations. The proof in the case of the Boltzmann equation is made in the framework of renormalized solutions.
1 Introduction
A rareed gas is usually described by the Boltzmann equation (Cf. [Ce], [Ch, Co], [Tr, Mu]). In this model, the dynamics of the gas is given by the nonnegative density f(t;x;v) of particles which at timet2[0;T] and point
x2IR
3, move with velocity v2IR3, where T is a stricly positive number.
Such a density satises the Boltzmann equation,
@f
@t
+vrxf =Q(f); (1:1)
f(0;x;v) =f0(x;v); (1:2) whereQis a quadratic collision kernel acting only on velocities and dened (with the notations of [DP, L]) by
Q(f) =Q+(f) Q (f); (1:3)
Q
+(f)(v) =Zv
2IR3
Z
!2S2f(v0)f(v0)B(v v;!)d!dv; (1:4)
A(z) =Z!
2S2B(z;!)d!; (1:5)
L(f) =Avf; (1:6)
Q (f)(v) =f(v)L(f)(v): (1:7) In formula (1.4), the post{collisional velocities v0 and v0 are parametrized by
v
0=v+ ((v v)!)!; (1:8)
v 0
=v ((v v)!)!; (1:9) where! is a unit vector varying in the sphere S2.
Finally, the nonnegative cross sectionB is assumed to satisfy the follow- ing properties, rst introduced in [DP, L]:
Assumption 1
: The function B(z;!) belongs to L1loc(IR3 S2) and depends only on jzjand jz!j.Moreover, the function A satises for all R>0, (1 +jzj2) 1Zv
2BRA(z+v)dv !
jzj!10; (1:10) where BR (orBRv) is the set fv2IR3;jvj<Rg.
Finally, we assume that the nonnegative initial datum f0 satises the following physically relevant assumption:
Assumption 2
: The function f0 is such thatZ
x2IR3
Z
v2IR3f0(x;v)f1 +jxj2+jvj2+jlogf0(x;v)jgdvdx<+1: (1:11) R.J. DiPerna and P-L. Lions proved in [DP, L] that under assumptions 1 and 2, the Boltzmann equation (1.1) { (1.9) admits a nonnegative renor- malized solution in C([0;T];L1(IR3IR3)).
The proof uses the averaging lemmas introduced by F. Golse, B. Perthame and R. Sentis in [G, P, S], and developed by F. Golse, P-L. Lions, B.
Perthame and R. Sentis in [G, L, P, S] and by R.J. DiPerna, P-L. Lions and Y. Meyer in [DP, L, M].
Note that a new and simpler proof was given by P-L. Lions in [L 1].
We shall also consider in the sequel a simpler model of rareed gases, namely the B.G.K. model, rst introduced in [Bh, Gr, Kr].
The gas is still described by a nonnegative density f(t;x;v), but the equation satised byf now becomes
@f
@t
+vrxf =M[f] f; (1:12)
f(0;x;v) =f0(x;v); (1:13) whereM[f](t;x;v) is a Maxwellian function of v:
M[f](t;x;v) = (t;x)
(2T(t;x))3=2exp jv u(t;x)j2 2T(t;x)
; (1:14) and;u;T are the respective density, global velocity and temperature of the gas. More precisely,
(t;x) =Zv
2IR3f(t;x;v)dv ; (1:15)
(t;x)u(t;x) =Zv
2IR3vf(t;x;v)dv; (1:16)
(t;x)fju(t;x)j2+ 3T(t;x)g=Zv
2IR3jvj
2
f(t;x;v)dv : (1:17)
Note that the previous quantities are not well{dened when= 0, therefore we deneM[0] = 0.
The existence of a global nonnegative solution for the B.G.K. system (1.12) { (1.17) under assumption 2 on the initial datum was proved by B. Perthame in [Pe]. The proof was based on a dispersion lemma. Another proof was given by E. Ringeissen in [Ri], allowing to take into account a gas in a bounded domain with boundary conditions.
Equation (1.1) { (1.9) as well as (1.12) { (1.17) can be written in the form
@f
@t
=Af +B f; (1:18)
f(t= 0) =f0; (1:19)
where
A= vrx; (1:20)
and Bis a nonlinear operator acting only on the variable v.
Therefore, in order to compute numerically their solution, it is usual to solve equations
@f
@t
=Af (1:21)
and
@f
@t
=B f (1:22)
one after another and to apply Trotter's formula
et(A+B )= limn
!+1
(entAentB)n: (1:23) This procedure is known as a splitting method for system (1.18), (1.19) and it is said to converge if Trotter's formula (1.23) holds whenAandBare the operators introduced in (1.18). A large amount of splitting algorithms involving discretization in time can be found in [L, M].
We intend to prove that the splitting method converges for the Boltz- mann and B.G.K. equations in the cases described earlier.
Note that this method is actually used in the numerical computation of both equations (Cf. [De, Pr]).
Note also that we proved in an earlier work the convergence of the split- ting algorithm in the simpler cases of the \grey" radiative transfer equation and of Vlasov{Maxwell system (Cf. [De 1] and [De 2]). The proofs of exis- tence of global solutions for the Boltzmann equation (Cf. [DP, L]) and for
the B.G.K. model (Cf. [Pe]) were already known at that time, but it seemed dicult to prove the convergence of the splitting algorithm in the context of those works. Namely, the analysis of sub- and supersolutions in [DP, L] did not seem well{adapted to the splitting algorithm, and the dispersion lemma of [Pe] seemed also inoperant in this context.
However, the new proof of existence for the Boltzmann equation of [L 1], and the proof of existence for the B.G.K. model of [Ri] are better{adapted to the method of splitting and can therefore be followed, as will be seen in the sequel.
Therefore, in section 2, we prove the convergence of Trotter's formula for the Boltzmann equation, and the corresponding result for B.G.K. model in section 3.
2 Splitting for Boltzmann equation
2.1 Introduction and main result
In this section, we introduce the splitting algorithm for equation (1.1){ (1.9).
We dene
Af = vrxf; (2:1:1)
B f =Q(f); (2:1:2) and we intend to prove Trotter's formula (1.23) in this context.
Therefore, we dene for every nin IN andk in [0;n 1] two sequences
fkn andgkn by the following procedure:
we note
T = T
n
; tk =kT; (2:1:3) and the functionsfkn and gkn are dened on [tk;tk+1] by induction onk:
f
n0(0) =f0; (2:1:4)
@fkn
@t
=Afkn; (2:1:5)
fkn(tk) =gnk 1(tk) whenk>0; (2:1:6)
@gkn
@t
=B gkn; (2:1:7)
gkn(tk) = fkn(tk+1): (2:1:8)
This denition is meaningful because the solutions of equations (2.1.5), (2.1.6) and (2.1.7), (2.1.8) belong toC([tk;tk+1];L1(IR3IR3)).
Then, we dene
fn(t) =fkn(t); (2:1:9)
gn(t) =gkn(t); (2:1:10) for everytlying in [tk;tk+1[.
The functions fn andgn are therefore piecewise continuous with respect to the time variable on [0;T] with values inL1(IR3IR3), and their discon- tinuities appear at pointstk for eachk in [1;n].
The main result of this section is the following:
Theorem 1
: Under assumptions 1 and 2 on the cross section and ini- tial datum, the sequences fn and gn dened in (2.1.4) { (2.1.10) converge up to extraction to the same nonnegative limitf inL1([0;T];L1(IR3IR3)) weak *, and this limit satises equation (1.1) { (1.9) in the sense of renor- malized solutions. More precisely,Q (f)
1 +f 2L1loc([0;T]IR3IR3); (2:1:11) and
f
@
@t
+vrxglog(1 +f) = Q(f)
1 +f (2:1:12) in the sense of distributions.
Remark
: This property exactly means that Trotter's formula (1.23) holds forAand B dened in (2.1.1), (2.1.2).The proof of this theorem is given in subsections 2.2 to 2.7.
2.2 Equation satised by
fnand
gnFor all nonnegative and smooth function such that
(0) = 0; j0(s)j 1
1 +s; (2:2:1) we compute:
@(fn)
@t
=Xn
i=1
@(fn)
@t
1](i 1)T;iT[+Xn
i=1
(fin)(iT) (fni 1)(iT)iT
=Xn
i=1
vrx(fn) 1](i 1)T;iT[
+Xn
i=1
(gni 1)(iT) (gin 1)((i 1)T)iT
= vrx(fn) +Xn
i=1
Z iT
(i 1)T
@(gn)
@t
(s)dsiT
= vrx(fn) +Xn
i=1
Z iT
(i 1)T
0(gn)(s)Q(gn)(s)ds
iT:
Therefore, we obtain the following equation forfnand gn:
@(fn)
@t
+vrx(fn) =Xn
i=1
Z iT
(i 1)T
0(gn)(s)Q(gn)(s)ds
!
iT: (2:2:2) In order to pass to the limit in equation (2.2.2), we need estimates for the sequences fn and gn.
2.3 Estimates on
fnand
gnLemma 1
: The sequencesfn andgndened in Theorem 1 are nonnegative and satisfy for some nonnegative constantCT:t2[0sup;T]
Z
x2IR3
Z
v2IR3fn(t;x;v)f1 +jxj2+jvj2+jlogfn(t;x;v)jgdxdvCT;
(2:3:1)
t2[0sup;T]
Z
x2IR3
Z
v2IR3gn(t;x;v)f1 +jxj2+jvj2+jloggn(t;x;v)jgdxdvCT:
(2:3:2) Moreover, the quantitye(gn) dened by
e(gn)(t;x;v) =Zv
2IR3
Z
!2S2fgn(t;x;v0)gn(t;x;v0) gn(t;x;v)gn(t;x;v)g
loggn(t;x;v0)gn(t;x;v0)
gn(t;x;v)gn(t;x;v)
B(v v;!)d!dv (2:3:3) satises the following estimate:
Z T
0 Z
x2IR3
Z
v2IR3e(gn)(t;x;v)dvdxdtCT: (2:3:4)
Proof
: The total density and total energy are conserved in the two steps of the splitting algorithm, thereforeZ Z
IR3IR3fn(t)(1 +jvj2)dxdv=Z ZIR
3
IR3gn(t)(1 +jvj2)dxdv
=Z ZIR
3
IR3f0(1 +jvj2)dxdv: (2:3:5) During the rst step we also get
Z Z
IR3IR3jx vtj
2
fkn(t)dxdv=Z ZIR
3
IR3jx vtkj2fkn(tk)dxdv (2:3:6) for all t2[tk;tk+1[, whereas during the second step we have
Z Z
IR3IR3jx vtkj2gkn(t)dxdv=Z ZIR
3
IR3jx vtkj2gkn(tk)dxdv (2:3:7) for all t2[tk;tk+1[. Therefore,
Z Z
IR3IR3jx vtj
2
fn(t)dxdv=Z ZIR
3
IR3jxj
2
f
0
dxdv (2:3:8) for all t2[0;T[, and
t2[0sup;T]
Z Z
IR3IR3gn(t)jxj2dxdv sup
t2[0;T]
Z Z
IR3IR3fn(t)jxj2dxdv
Z Z
IR3IR32f0(jxj2+T2jvj2)dxdv: (2:3:9) Finally, we prove the estimate on the entropy production:
d
dt Z Z
IR3IR3fkn logfkndxdv= 0; and
d
dt Z Z
IR3IR3gkn loggkndxdv= 14Z ZIR3IR3e(gkn)dxdv0 for all t2[tk;tk+1[. Therefore,
Z Z
IR3IR3fn logfndxdv(t)Z ZIR
3
IR3f0 logf0dxdv; (2:3:10)
and Z Z
IR3IR3gn loggndxdv(t) Z ZIR
3
IR3f0 logf0dxdv
14
Z T
0 Z
IR3IR3e(gn)dxdvdt (2:3:11) for all t 2 [0;T[. Finally, it is now classical (Cf. [DP, L]) that estimates (2.3.5) and (2.3.9) { (2.3.11) ensure the existence of a constant CT such
that sup
t2[0;T]
Z Z
IR3IR3fnjlogfnjdxdvCT; (2:3:12)
t2[0sup;T]
Z Z
IR3IR3gnjloggnjdxdvCT; (2:3:13)
and Z T
0 Z
IR3IR3e(gn)dxdvdtCT; (2:3:14) which ends the proof of lemma 1.
According to lemma 1, we can extract from the sequences fn and gn
subsequences still denoted by fn and gn, which converge respectively to f and gin L1([0;T];L1(IR3IR3)) weak *.
2.4 Weak compactness of the renormalized collision terms
We present here the main estimate on the collision term:
Lemma 2
: The sequences Q1+(ggnn) and 1+Q+L((ggn)n) belong to a weakly compact set ofL1([0;T]IR3xBRv), for all R>0.Proof
: We only prove here that the sequences are bounded in L1. The reader will nd in [DP, L] the proof of weak compactness.For all R>0, we compute
Z
x2IR3
Z
v2BR
Q (gn)
1 +gn dvdx
Z
x2IR3
Z
v2BRL(gn)dvdx
Z
x2IR3
Z
v2IR3gn(v)Zv
2BRA(v v)dvdvdx
sup
z2IR3
(1 +jzj2) 1Zv
2BRA(v z)dv
Z
x2IR3
Z
v2IR3gn(v)(1+jvj2)dvdx; (2:4:1) which is bounded because of assumption 1 and estimate (2.3.2).
Then, the boundedness of Q1++(ggnn) and 1+Q+L((ggnn)) comes out of the bound- edness of Q1+(ggnn) and of estimate (2.3.4).
More precisely, we recall that for all K>0,
Q
+(gn)KQ (gn) + e(gn)
logK: (2:4:2)
2.5 The sequences
fnand
gnconverge to the same limit
In order to pass to the limit in equation (2.2.2) we need to know that(gn) and (fn) converge to the same limit, and that the same holds for fn and
gn.
lemma 3
: Up to extraction, the sequencesfnandgnsatisfy the following properties:i) For all nonnegative and smooth function such that (2.2.1) holds,
(fn) and (gn) converge to the same limit in L1([0;T]IR3 IR3) weak.
ii) the sequencesfnandgn have the same limitf inL1([0;T]IR3IR3) weak.
Proof
:Step 1 : We prove i). Because of lemma 1, we just have to show that
(fn) and(gn) converge to the same limit in the sense of distributions. Let
'belong toD(]0;T[IR3IR3) and K be its compact support.
We compute
j Z T
0 Z
x2IR3
Z
v2IR3((fn) (gn))(t;x;v)'(t;x;v)dvdxdtj
nX1 j=0
j Z
(j+1)T jT
Z
x2IR3
Z
v2IR3((fn)(t;x;v)
(fjn)((j+ 1)T; x;v))'(t;x;v)dvdxdtj
+ nX1
j=0
j Z
(j+1)T jT
Z
x2IR3
Z
v2IR3((gn)(t;x;v)
(gjn)(jT; x;v))'(t;x;v)dxdvjdt
nX1 j=0
Z
(j+1)T jT
Z
x2IR3
Z
v2IR3
Z
(j+1)T
t vrx(fn)(s;x;v)ds
'(t;x;v)dxdvjdt + nX1
j=0
Z
(j+1)T jT
Z
x2IR3
Z
v2IR3j
Z t jT
0(gn)(s)Q(gn)(s)dsdxdvjdt
Tkvrx'kL1(K)k(fn)kL1([0;T]IR3IR3)
+ Tk'kL1(K)k0(gn)Q(gn)kL1(K); (2:5:1) which clearly tends to 0 when T = Tn tends to 0.
Step 2 : We prove ii). Taking (s) = 1+ss, we note that
0s (s)Rs+s1s>R: (2:5:2) Therefore,
0gn (gn)Rgn+gnjloggnj
logR ; (2:5:3) and the same estimate holds for fn. Using then estimates (2.3.12) and (2.3.13), we get
nsup2INtsup
2[0;T]kfn (fn)kL1(IR3IR3)!
!0
0; (2:5:4)
and nsup
2INtsup
2[0;T]kgn (gn)kL1(IR3IR3)!0!0: (2:5:5) According to step 1 and estimates (2.5.4), (2.5.5), we get ii).
2.6 Strong compactness for velocity averages
In this section we get some informations on the limits of the sequenceQ(gn) which follow from the strong compactness of the velocity averages ofgn.
lemma 4
: For all ' in L1([0;T]IR3IR3), the sequencejn(t;x) =Zv
2IR3gn(t;x;v) (t;x;v)dv (2:6:1) lies in a strongly compact set of L1([0;T]IR3).
Proof
: The proof is divided in six steps. During the ve rst steps, we x a function inL1c (IR3), a nonnegative and smooth function satisfying (2.2.1). Denoting for every functionh in L1loc([0;T]IR3IR3),~
h(t;x) =ZIR
3
h(t;x;v) (v)dv (2:6:2) we prove thatg(gn) lies in a strongly compact set of L1([0;T]IR3).
Step 1 : We compute
@
@t
(gn) = 0(gn)Q(gn) +nX1
j=1
n
(gjn)(jT) (gnj 1)(jT)ojT(t)
=0(gn)Q(gn) +nX1
j=1
n
(fjn)((j+ 1)T) (fjn)(jT)ojT(t)
=0(gn)Q(gn) +nX1
j=1
(
Z
(j+1)T
jT vrx(fn)(s;x;v)ds
)
jT(t): (2:6:3) Therefore, for all function in Cc1(IR3x), we have
d
dt Z
x2IR3
g
(gn)'(x)dx=Z ZIR
3
IR3
0(gn)Q(gn) (v)(x)dvdx +nX1
j=1
Z
(j+1)T jT
Z
x2IR3
Z
v2IR3(fn) (v)vrx(x)dxdvdsjT(t); (2:6:4)
which is a bounded sequence of measures in [0;T], thanks to (2.3.1) and lemma 2.
Thus, the quantity
an(t) = Zx
2IR3
g
(gn)(t;x)'(x)dx (2:6:5) is bounded in BV([0;T]).
Considering now a sequence of (compactly supported) molliers "(x), the previous statement implies that for every xed " > 0, the sequence
g
(gn)x" is strongly compact in L1([0;T]IR3).
Thanks to the identity
g
(gn) =g(gn)x"+ng(gn) g(gn)x"
o
; (2:6:6) we only need to prove that the second term is uniformly (in n) small in
L
1([0;T]IR3) when"tends to 0 to get the strong compactness inL1([0;T]
IR
3) of g(gn).
This will in turn be true if we prove that
Ih = supn
2IN
Z T
0 Z
IR3j
g
(gn)(t;x+h) g(gn)(t;x)jdxdt (2:6:7) tends to 0 when h tends to 0. Steps 2 to 5 are devoted to the proof of this estimate.
Step 2 : We compute
Ih nsup
2IN nX1
j=0
Z
IR3
Z
(j+1)T jT j
g
(gn)(t;x+h) g(gjn)(jT;x+h)jdxdt + supn
2IN nX1 j=0
Z
IR3
Z
(j+1)T jT j
g
(gjn)(jT;x+h) g(gjn)(jT;x)jdxdt + supn
2IN nX1 j=0
Z
IR3
Z
(j+1)T jT j
g
(gjn)(jT;x) g(gn)(t;x)jdxdt
2Tjj jjL1(IR3v) nsup
2IN jj
0(gn)Q(gn)jjL1([0;T]IR3Supp )+Jh; (2:6:8)