A Stochastic Model of Crystallization in an Emulsion - Laboratoire de ...
A Stochastic Model of Crystallization in an Emulsion - Laboratoire de ...
A Stochastic Model of Crystallization in an Emulsion - Laboratoire de ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Remark 1 For technical reasons (lost <strong>of</strong> the maximum pr<strong>in</strong>ciple for ( ϕn)<br />
), we need to use<br />
J( un) (1 ϕn) <strong>in</strong>stead <strong>of</strong> J( un) (1 ϕ n)<br />
. We then have to prove that, at the limit when N goes<br />
to <strong>in</strong>nity, the solution ϕ obta<strong>in</strong>ed satises 0 ϕ 1.<br />
Proposition 1 There exists a sequence ( u n, ϕn) n∈ , ( u n, ϕn)<br />
Ϝnt<br />
-measurable, with values <strong>in</strong><br />
V H,<br />
satisfy<strong>in</strong>g (6) <strong>an</strong>d (7).<br />
Pro<strong>of</strong>. The result leads from a classical xed po<strong>in</strong>t argument (see Grecksch et al [8] for example<br />
<strong>in</strong> the context <strong>of</strong> stochastic calculus). <br />
5.2 A priori estimates<br />
Lemma 2<br />
N<br />
2<br />
2<br />
∀n ∈ { 0, 1, .., N } , E|| ϕ || M so t<br />
E|| ϕ || M,<br />
N<br />
1<br />
Pro<strong>of</strong>. S<strong>in</strong>ce [( ϕ ) ( ϕ ) + ( ϕ ϕ ) ] = ( ϕ ϕ ) ϕ ,<br />
tJ( un) (1 ϕn) ϕn+1 + ϕn+1 b( u n, ϕn)( wn+1 w n)<br />
.<br />
<br />
As, ϕ b( u , ϕ ) is Ϝ -measurable, E ϕ b( u , ϕ )( w w ) =<br />
<br />
E ( ϕ ϕ ) b( u , ϕ )( w w ) + E { ϕ b( u , ϕ )( w w ) } =<br />
<br />
E ( ϕ ϕ ) b( u , ϕ )( w w ) <br />
1<br />
2<br />
E( ϕn+1 ϕn) + Ct. 4<br />
<br />
S<strong>in</strong>ce, E tJ( u ) (1 ϕ ) ϕ C t E( ϕ ) + 1 ,<br />
<br />
2 2<br />
2<br />
E( ϕ ) E( ϕ ) + E( ϕ ϕ ) C t E( ϕ ) + 1 .<br />
n n<br />
2<br />
E( ϕ ) + E( ϕ ϕ ) C t E( ϕ ) + C <br />
n<br />
2<br />
C t E( ϕ ) + C + C tE( ϕ ) .<br />
n<br />
2<br />
Whereas t 0,<br />
∃M > 0, ∀n ∈ { 0, 1, .., N 1}<br />
,<br />
n<br />
<strong>an</strong>d E|| ϕ ϕ || M.<br />
n=0<br />
1 2 2<br />
2<br />
[( ϕn+1) ( ϕn) + ( ϕn+1 ϕn)<br />
] =<br />
2<br />
∀ n, E|| ϕ || Ce Ce<br />
E|| ϕ ϕ || M t.<br />
n=0<br />
1 2 2<br />
2<br />
2 n+1 n n+1 n n+1 n n+1<br />
n n n n t n+1 n n n+1 n<br />
Whereafter,<br />
n+1 n n n n+1 n n n n n+1 n<br />
n+1 n n n n+1 n<br />
n n n+1 n+1<br />
2<br />
n+1 n n+1 n n+1<br />
2<br />
n+1<br />
2<br />
n+1<br />
2<br />
k=0<br />
k=0<br />
Gronwall lemma (cf. Ba<strong>in</strong>ov [1]) s<strong>in</strong>ce :<br />
k+1 k<br />
k=0<br />
2<br />
n+1 n<br />
k=0<br />
k n+1<br />
2<br />
k<br />
2 Cnt CT<br />
n+1<br />
2<br />
n+1 n<br />
6<br />
<br />
n<br />
k+1<br />
2