01.05.2013 Views

Modélisation, analyse mathématique et simulations numériques de ...

Modélisation, analyse mathématique et simulations numériques de ...

Modélisation, analyse mathématique et simulations numériques de ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

tel-00656013, version 1 - 3 Jan 2012<br />

2.3 Well-posedness of the multilayer mo<strong>de</strong>l 63<br />

where C5 = C ′ 2 +C4. Finally, we add (2.3.10) and (2.3.16), and control the exponentials<br />

to obtain (2.3.14).<br />

This gives the uniqueness for the solution. L<strong>et</strong> us now prove the existence of solution.<br />

On the one hand, the existence ofUfollows from Proposition 3.4, and we have the regularity<br />

which gives<br />

U ∈ C(0,T;H 2 (R))∩C 1 (0,T;L 2 (R))∩L 2 (0,T;H 3 (R)),<br />

f ∈ C(0,T;H 1 (R))∩C 1 (0,T;L 2 (R))∩L 2 (0,T;H 2 (R)).<br />

So we can apply Proposition 3.5 for k = 1 to obtain the existence of h in C(0,T;H 1 (R)).<br />

To g<strong>et</strong> more regularity in space, we differentiate the problem with respect to x:<br />

⎧<br />

∂t(∂xU)−µ∂xx(∂xU) = ∂x<br />

⎪⎨<br />

˜ S,<br />

∂t(∂xh)+ũN ∂x(∂xh) = ∂xf −∂xũN ∂xh,<br />

Noticing that<br />

⎪⎩<br />

∂xU 0 , ∂xh 0 ∈ H 1 (R).<br />

∂xf 1 CE∂xU1,<br />

we can solve this problem by the same iteration process as in the lattest part of Proposition<br />

3.5, this conclu<strong>de</strong>s the proof.<br />

In or<strong>de</strong>r to obtain the solution to the nonlinear initial value problem (2.3.2), we will build<br />

a convergent sequence, this is the last part of the proof of Theorem 2.3.<br />

2.3.3 Iterative scheme<br />

We construct a recursive sequence (U (j) ,h (j) ) = (u (j)<br />

1 ,...,u(j)<br />

N ,h(j) )j∈N as follows.<br />

∀(t,x) ∈ [0,T]×R, (U (0) ,h (0) )(t,x) = (U 0 ,h 0 )(x) ∈ H 2 (R),<br />

and for all j ∈ N, (U (j+1) ,h (j+1) ) solves the initial value problem:<br />

⎧<br />

⎪⎨<br />

⎪⎩<br />

(∂t −µ∂xx)<br />

L u (j)<br />

N<br />

<br />

U (j+1)<br />

= S (j) ,<br />

<br />

h (j+1)<br />

= F (j,j+1) ,<br />

(U (j+1) ,h (j+1) )(t = 0) = (U 0 ,h 0 ),<br />

where the sequence of source terms is given by, for any j ∈ N:<br />

⎧<br />

S<br />

⎪⎨<br />

⎪⎩<br />

(j) = S U (j) ,h (j) ,∂xU (j) ,∂xh (j) ,<br />

F (j,j+1) N−1 <br />

= − ∂x hiu (j+1)<br />

<br />

i −∂xu (j+1)<br />

N h (j) .<br />

i=1<br />

(Pj+1)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!