• No results found

Regularization of a unilateral obstacle problem on the boundary

N/A
N/A
Protected

Academic year: 2020

Share "Regularization of a unilateral obstacle problem on the boundary"

Copied!
10
0
0

Loading.... (view fulltext now)

Full text

(1)

PII. S0161171203110319 http://ijmms.hindawi.com © Hindawi Publishing Corp.

REGULARIZATION OF A UNILATERAL OBSTACLE

PROBLEM ON THE BOUNDARY

A. ADDOU and J. ZAHI

Received 28 October 2001

We give a regularization method for a unilateral obstacle problem with obstacle on the boundary and second memberf.

2000 Mathematics Subject Classification: 35J85.

1. Introduction. LetΩbe a bounded domain ofRnwith smooth boundary Γ=∂Ω. We consider the variational inequality problem—called obstacle prob-lem: find

u∈H1() (1.1)

such that

∇u∇(v−u)+

u(v−u)+

Γv

u+f , vu0 vH1(),

(1.2)

wheref∈L2(); it is well known that problems (1.1) and (1.2) admit a unique solution (see [3]).

The aim of this paper is to develop a regularization method for solving a nondifferentiable minimization problem that is equivalent to problems (1.1) and (1.2).

The idea of the regularization method is to approximate the nondifferen-tiable term by a sequence of differennondifferen-tiable ones depending on(ε≥0, ε→0).

We give three forms of regularization for which we establish the convergence result and a priori error estimates.

Next, by duality method of conjugate functions (see [1]), we provide a poste-riori error estimates desired for the numerical computation. And as an appli-cation, we develop a regularization method for solving a sequence of penalised problem.

2. Formulation and regularization method. LetΩbe a bounded domain of Rnwith smooth boundaryΓ=and letfL2().

(2)

Consider the following variational inequality problem:

Findu∈H1(),

a(u, v−u)+

Γv

u+f , vu0 vH1(), (2.1)

wherea(·,·)is defined by

a(u, v)=

∇u·∇v+

u·v, u, v∈H

1(). (2.2)

It is well known that problem (2.1) admit a unique solution (see [3]). For allz∈L2(), we denote

z+=max{z,0}, z−=max{0,−z}. (2.3)

Ifv∈H1(), then we havev+, vH1()and

av+, v−=0. (2.4)

Definition2.1. Letϕbe the following functional:

ϕ(v)=

Γv

, vH1(). (2.5)

The functionalϕ, being nondifferentiable onH1(), is approximated by a sequence of differentiable functionals

ϕε(v)=

Γφε(v)dx, (ε≥0, ε→0). (2.6)

The regularized problem is

Finduε∈H1(),

auε, v−uε+ϕε(v)−ϕεuε+f , v−uε≥0 ∀v∈H1(). (2.7)

Problems (2.1) and (2.7), respectively, are equivalent to

u∈H1(): a(u, v−u)+

Γ

v−−u−dx

+

f (v−u)dx≥0 ∀v∈H 1(),

(2.8)

uε∈H1(): auε, v−uε+ϕε(v)−ϕεuε

+

f

(3)

There are many methods to construct sequences of differentiable approxima-tions. In this paper, we take the sequenceφε verifying one of the following choices:

φ1

ε(t)=

            

0 ift≥0, t2

2ε if−ε≤t≤0, −t−ε2 ift≤ −ε,

φ2

ε(t)=

              

ε

2 ift≥0,

1 2

t2

ε

if −ε≤t≤0,

−t ift≤ −ε,

φ3

ε(t)=

  

ε ift≥0,

t2+ε2 ift0.

(2.10)

With these choices, problem (2.7) admits a unique solution. To establish the convergence of the sequence(uε), we need the following results (see [2]).

Lemma2.2. LetV be a Hilbert space,a:V×V→Ra continuous,V-elliptic

bilinear, j:V Rproper, nonnegative, convex, weakly continuous function,

andf a linear continuous onV. Assume thatjε:V R,ε >0, is a family of nonnegative convex weakly lower semicontinuous (l.s.c.) functions verifying

jε(v) →j(v) ∀v∈V ,

ifuε →uweakly inV ,thenj(u)≤lim

ε→0inf

uε. (2.11)

Letuanduεbe the solutions of the following variational inequalities:

a(u, v−u)+j(v)−j(u)+f , v−u ≥0 ∀v∈V ,

auε, v−uε+jε(v)−jεuε+f , v−uε≥0 ∀v∈V , (2.12)

respectively. Then,uε→uinV whenε→0.

Lemma2.3. Assume that

j(v)=

φ(v)dx, jε(v)=

φε(v)dx (2.13)

andjis weakly l.s.c. If

φε(t) →φ(t)uniformly int, asε 0, (2.14)

(4)

We notice that if

φε(t)−φ(t)≤cε ∀t∈R, (2.15)

then (2.14) is verified. Since the functionsφjε,j=1,2,3, verify inequality (2.15),

then we have the convergenceuε→uwhenε→0 inH1().

Takingv=uε(resp.,v=u) in the inequality of problem (2.1) (resp., (2.7)), we obtain

au−uε, u−uε≤ϕuε−ϕεuε+ϕε(u)−ϕ(u). (2.16)

Consequently, we obtain the following a priori error estimates:

u−H1(

)≤(2c)1/2

ε. (2.17)

3. A posteriori error estimates. In this section, we use the duality method by conjugating functions in order to derive the a posteriori error estimates of the solution of approximate problem. We need the preliminary results (see [1]). LetV andV∗ (resp.,Y andY∗) be two topological vector spaces and·,·V

(resp.,·,·Y) denote the duality pairing betweenV andV∗(resp.,Y andY∗). Letϕbe a function fromVtoR=R∪{−∞,+∞}, and let its conjugate function be defined by

ϕ∗v∗=sup

v∈V

v∗, vV−ϕ(v), (3.1)

wherev∗is inV∗.

Assume that there exists a continuous linear operatorLfromV toY,L∈

(V , Y ), with transposeL∗∈(Y∗, V∗). LetJbe a function fromV×Y toR. We consider the following minimization problem:

u∈V , J(u, Lu)=inf

v∈VJ(v, Lv), (3.2)

where the conjugate function ofJis given by

J∗y∗, v∗= sup

v∈V , y∈Y

v∗, vV+

y∗, yY−J(v, y)

. (3.3)

(5)

(i) there existsu0∈Vsuch thatJ(u0, Lu0) <∞andy→J(u0, y)is

contin-uous atLu0;

(ii) J(v, Lv)→ +∞asvV→ +∞,v∈V. Then, problem (3.2) admits a unique solution, and

J(u, Lu)=inf

v∈VJ(v, Lv)= −ysupY∗

J∗−y∗, L∗y∗. (3.4)

LetΩ be an open subset ofRn, andg:×RnRbe the Carathéodory

function, that is, for alls∈Rn,xg(x, s)is a measurable function, and, for

almost allx∈Ω, the functions→g(x, s)is continuous. Then, the conjugate function of

G(v)=

g

x, v(x)dx (3.5)

(assumingGis well defined over some function spaceV) is

G∗v∗=

g

x, v∗(x)dx ∀v∗∈V∗, (3.6)

where

g∗(x, y)=sup

s∈RN

ys−g(x, s). (3.7)

For problem (2.1), we take

V=H1(), Y=Y∗=L2()n×L2(),

Lv=(∇v, v), J(v, Lv)=H(v)+G(Lv),

H(v)=

  

0 ifv≥0 on, +∞ otherwise,

G(y)=

Ω 1 2y1

2

+1

2y2 2

+f y2,

(3.8)

wherey=(y1, y2)withy1∈(L2())n andy2∈L2(); a similar notation is used fory∗∈Y∗. So, the obstacle problem (2.1) can be rewritten in the form (3.2).

To applyTheorem 3.1, we compute the conjugate of the functional J. We have

(6)

where

H∗L∗y∗= sup

v∈H1()

Lv, y−H(v)

= sup

{v∈H1(), v≥0 inΓ}

∇vy1∗+vy2∗dx

=

  

0 ifdivy1∗+y2∗=0 inΩ, otherwise,

G∗−y∗=sup

y∈Y

−y∗, y−G(y)

=sup

y∈Y

−y1∗y1−y2∗y2 1 2y1

2

1

2y2 2

−f y2

dx =1

2y 1

2

+12y2∗−f 2

dx.

(3.10)

Hence,

J∗−y∗, L∗y∗=

     Ω 1

2y 1

2

+12y2∗−f 2

dx ifdivy1∗+y2∗=0,

otherwise.

(3.11)

We have

Juε, Luε−J(u, Lu)=

Ω 1 2∇uε

2

12|∇u|2+1 2

2

1

2|u|

2+fudx.

(3.12)

Using (2.8) withv=uε, we obtain

Juε, Luε−J(u, Lu)≥12uε−u2H1(). (3.13)

ApplyingTheorem 3.1and using (3.11), we have

Juε, Luε−J(u, Lu)≤

Ω 1 2∇uε

2

+122+f uε

+12y12+12y2∗−f2dx

(3.14)

for ally∗=(y1∗, y2∗)∈Y∗, withdivy1∗+y2∗=0 inΩ.

Sinceφεis differentiable, inequality (2.9) is equivalent touε∈H1()

auε, v+

Γφ

ε

uεv+

(7)

Hence,verifies the following Neumann problem:

uε+uε+f=0 inΩ, ∂uε

∂n = −

Γφ

ε

onΓ. (3.16)

If we take

y1∗= ∇uε, y2∗=uε+fuε, (3.17)

then we have

divy1∗+y2∗=0. (3.18)

Then, we have the a posteriori error estimate

1

2uε−u 2

H1()≤

∇uε2

+uε2+f uε. (3.19)

Takingv=uε∈H1()in (3.15),

auε, uε+

Γφ

ε

uεuε+

f uε=0. (3.20)

Hence,

2+

2+

Γφ

ε

uεuε+

f uε=0. (3.21)

Estimate (3.19) becomes

1

2uε−u 2

H1()≤

Γφ

ε

uεuε. (3.22)

Hence, we obtain the a posteriori error estimates. For the choice (1.1) and (1.2), we have

φε(t)=

          

0 ift≥0, t

ε if −ε≤t≤0, 1 ift≤ −ε.

(3.23)

The a posteriori error estimate is

1

2uε−u 2

H1()

[uε≤−ε]

uε+

[−ε≤uε≤0]

2

(8)

For the choice (2.4), we have

φε(t)=

      

0 ift≥0,

t

t2+ε2 ift≤0.

(3.25)

The a posteriori error estimate is

1

2uε−u 2

H1()≤

[uε≤0] 2

u2

ε+ε2

. (3.26)

4. Application. Consider the following variational inequality problem:

Findu∈K, a(u, v−u)+f , v−u ≥0 ∀v∈K, (4.1)

wherea(·,·)is defined by

a(u, v)=

∇u·∇v+

u·v, u, v∈H 1(),

K=v∈H1():v≥0 onΓ.

(4.2)

It is well known that problem (4.1) admits a unique solution (see [3]). We write the obstacle problem (4.1) in a new form.

Theorem 4.1. Let (uα) (α 0, α→ 0) be the solution of the following problem—called penalised problem:

Finduα∈H1(),

auα, v−uα+ϕα(v)−ϕαuα+f , v−uα≥0 ∀v∈H1(), (4.3)

whereϕαis the functional defined by

ϕα(v)= 1 α

Γv

, vH1(). (4.4)

Problem (4.3) admits a unique solution and(uα)(α0)solution of (4.3) converges tousolution of (4.1) whenα→0.

Proof(see [2]). The functional ϕα, being nondifferentiable onH1(), is approximated by a sequence of differentiable functionals

ϕα,ε(v)= 1 α

(9)

The regularized problem is

Finduα,ε∈H1(),

auα,ε, v−uα,ε+ϕα,ε(v)−ϕα,εuα,ε+f , v−uα,ε≥0 ∀v∈H1(). (4.6)

Problems (4.3) and (4.6) are, respectively, equivalent to

uα∈H1(): auα, v+1

α

Γ

v−−u−αdx

+

f

v−uαdx≥0 ∀v∈H1(),

uα,ε∈H1(): auα,ε, vuα,ε+ϕα,ε(v)ϕα,εuα,ε

+

f

v−uα,εdx≥0 ∀v∈H1().

(4.7)

We can similarly proceed to drive the a posteriori error estimates; then, for the choice (1.1) and (1.2), we have

φε(t)=

          

0 ift≥0, t

ε if −ε≤t≤0, 1 ift≤ −ε.

(4.8)

The a posteriori error estimate is

1

2uα,ε−uα 2

H1() 1

α

[uα,ε≤−ε]

uα,ε+α1

[−ε≤uα,ε≤0]

uα,ε2

ε . (4.9)

For the choice (2.4), the a posteriori error estimate is

1

2uα,ε−uα 2

H1() 1

α

[uα,ε≤0]

uα,ε2

u2α,ε+ε2

. (4.10)

5. A posteriori error estimates for regularized discrete problem. LetVh

be a finite element space approximatingH1(). Then, the finite element solu-tionuh∈Vhfor the obstacle problem (4.1) is determined from the following problem:

Finduh∈Vh, uh≥0 on,

(10)

If we use the penalisation method, then the solutionuhof problem (5.1) is the limit whenαtends to 0 of the solutionuα,hof the following problem:

Finduα,h∈Vh,

auα,h, vh−uα,h+ϕαvh−ϕαuα,h+fh, vh−uα,h≥0 ∀vh∈Vh.

(5.2)

We can similarly proceed as in [2] to prove the convergence of the finite element approximations and to have a priori error estimates.

The regularized problem of (5.2) is

Finduα,h,ε∈Vh,

auα,h,ε, vh−uα,h,ε+ϕα,εvh−ϕα,εuα,h,ε+fh, vh−uα,h,ε≥0 ∀vh∈Vh.

(5.3)

We can similarly prove that (5.3) has unique solution and its solution converges to the corresponding solution of problem (5.2).

By the duality theory on the discrete problems, we prove the following a posteriori error estimates.

For the choice (1.1) and (1.2), the a posteriori error estimate is

1

2uα,h,ε−uα,h 2

H1() 1

α

[uα,h,ε≤−ε]

uα,h,ε+1 α

[−ε≤uα,h,ε≤0]

uα,h,ε2

ε .

(5.4)

For the choice (2.4), the a posteriori error estimate is

1

2uα,h,ε−uα,h 2

H1() 1

α

[uα,h,ε≤0]

uα,h,ε2

u2α,h,ε2. (5.5)

References

[1] I. Ekeland and R. Temam,Analyse Convexe et Problèmes Variationnels, Collection Études Mathématiques, Gauthier-Villars, Paris, 1974 (French).

[2] R. Glowinski, J.-L. Lions, and R. Trémolières,Numerical Analysis of Variational Inequalities, Studies in Mathematics and Its Applications, vol. 8, North-Holland Publishing, Amsterdam, 1981.

[3] D. Kinderlehrer and G. Stampacchia,An Introduction to Variational Inequalities and Their Applications, Pure and Applied Mathematics, vol. 88, Academic Press, New York, 1980.

A. Addou: Department of Mathematics, Faculty of Sciences, Mohammed I University, Oujda, Morocco

J. Zahi: Department of Mathematics, Faculty of Sciences, Mohammed I University, Oujda, Morocco

References

Related documents

Common Project specific Management Documents (i.e. Project Execution Plan, Project Quality Plan, Project HSSE Plan, Project Engineering Plan, Project Construction Plan, …) are

Customer relationship has been regarded as the most important issue of the firms, so that an attempt is made to develop customer relationships and their comments on quality and

In this paper, structural integrity KPIs are classified into leading and lagging KPIs based on Bowtie methodology and the importance degree of the KPIs are

Based on the role played by monitoring in Mogadishu’s formal security plan and in an informal neighbourhood watch scheme in Waberi district, this article uses a policy-

Additionally, the data suggest that the levels of client advocacy do not differ between CPAs and non-CPAs as shown in prior literature, that the clients of National Tax

The objective of this study was to evaluate the feasibility and acceptability of decision coaching guided by the Ottawa Family Decision Guide with children and parents

In this study we have evaluated CD248 expression in the lungs of patients with mild early stage IPF and lung transplant explants. Immunohistochemistry demon- strated intense staining