PARABOLIC PROBLEM
ABDERRAHMANE EL HACHIMI AND MOULAY RCHID SIDI AMMI Received 22 February 2004 and in revised form 16 February 2005
A time discretization technique by Euler forward scheme is proposed to deal with a nonlocal parabolic problem. Existence and uniqueness of the approximate solution are proved.
1. Introduction
In this work, we study the time discretization by Euler forward scheme of the nonlocal initial boundary value problem
∂u
∂t − u=λ f(u)
Ωf(u)dx2 inΩ×]0;T[, u=0 on∂Ω×]0;T[,
u(0)=u0 inΩ,
(1.1)
withΩ⊂Rd(d≥1) a bounded regular domain andλa positive parameter. The hypothe- ses we will assume on f are the same as in [6]. We recall first that (1.1) arises by reducing the following system of two equations modeling the thermistor problem:
ut= ∇·
k(u)∇u+σ(u)∇ϕ2,
∇
σ(u)∇ϕ=0, (1.2)
whereurepresents the temperature generated by the electric current flowing through a conductor,ϕthe electric potential,σ(u) andk(u) are, respectively, the electric and ther- mal conductivities. For more description, we refer to [5,6,7,8,11] among others.
We recall also that the Euler forward method was used by several authors to treat semidiscretization of nonlinear parabolic problems, see [3,4]. Concerning problem (1.1), results of existence and uniqueness of solutions are known under particular forms of f, we refer to [2] and the references therein. On the other hand, little is known about
Copyright©2005 Hindawi Publishing Corporation
International Journal of Mathematics and Mathematical Sciences 2005:10 (2005) 1655–1664 DOI:10.1155/IJMMS.2005.1655
the solutions to the discrete problem
Un−τUn=Un−1+λτ fUn
ΩfUndx2 inΩ, Un=0 on∂Ω,
U0=u0 inΩ.
(1.3)
Whereas, semidiscretization has been involved for the equations of the thermistor problem in [1,9]. Our aim here is to continue the study of problem (1.1) initiated in [6], where an a prioriL∞-estimate is derived. In addition to habitual existence and uniqueness questions concerning the solutions of (1.3), we will prove some results of stability and proceed to error estimates analysis. In [1], the authors derived anL2andH1-norm error by requiring more regularity on the solutionu, for instanceu,utinH2(Ω)∩W1,∞(Ω).
Unfortunately, such smoothness is not always possible since the function f is nonlinear.
2. The semidiscrete problem
2.1. Existence and uniqueness. We consider the Euler scheme (1.3), withNτ=T,T >0 fixed, and 1≤n≤N, under the following hypotheses.
(H1) f :R→Ris a locally Lipschitzian function.
(H2) There exist positive constantsσ,c1,c2, andαsuch thatα <4/(d−2) and for all ξ∈R,
σ≤f(ξ)≤c1ξα+1+c2. (2.1) In the sequel, we will denote the norms in the spacesL∞(Ω),Lk(Ω) by| · |L∞(Ω)and| · |k, respectively, (·,·) will denote the associated inner product inL2(Ω) or the duality product betweenH01(Ω) and its dualH−1(Ω).
Theorem2.1. Let(H1)-(H2)be satisfied. Then, for eachn, there exists a unique solution Unof (1.3) inH01(Ω)∩L∞(Ω)provided thatτis small enough.
Proof. For simplicity, we writeU=Un,h(x)=Un−1. Then (1.3) becomes U−τU=h(x) +λ f(U)
Ωf(U)dx2 inΩ, U=0 on∂Ω.
(2.2)
Existence. Define the mapS(µ,·) byU=S(µ,v),µ∈[0, 1] if and only if U−τU=µg(x,v) inΩ,
U=0 on∂Ω, U0=µu0,
(2.3)
whereg(x,v)=h(x) +λ(f(v)/(Ωf(v)dx)2). For a fixedv∈H01(Ω), (2.3) has a unique solutionU∈H01(Ω). Then, for eachµ∈[0, 1], the operatorS(µ,·) is well defined. More- over,S(µ,·) is compact fromH01(Ω) into it self. Indeed, using (H2), we have the estimate
U22+τ∇U22≤c3. (2.4)
We can easily see thatµ→S(µ,v) is continuous and thatS(0,v)=U, for anyv, if and only ifU=0. From Leray-Schauder fixed point theorem, there exists therefore a fixed pointU
ofS(µ,·).
Now, we derive an a priori estimate.
Lemma2.2. Ifu0∈L∞(Ω), then for alln∈ {1,. . .,N},Un∈L∞(Ω).
Proof. The proof is similar to the one used by De Th´elin in [10] concerning a very differ- ent problem and we will give here only a sketch. Suppose thatd≥2 and define
δ=
2d
d−2 if 2< d, 2(α+ 2) ifd=2.
(2.5)
For eachk∈N∗, we consider the number qk= δ
2 k−1
(δ−γ)−(2−γ) δ
δ−2, k≥2, q1=δ,
(2.6)
we have
qk+1=
qk+ 2−γδ
2 withγ=α+ 2,∀k∈N∗. (2.7) Lemma2.3. For allk∈N∗,Un∈Lqk(Ω), and moreover
Un∞=limUnq
k<+∞. (2.8)
Proof. We prove by recurrence thatU∈Lqk. The property is true fork=1, sinceH01(Ω)⊂ Lδ(Ω). We show now thatU∈Lqk+1. Letm∈N, 1≤m≤k. Multiplying (2.2) by|U|qm−γU, using (H2), and Young’s inequality, we get
qm−γ+ 1
Ω|∇U|2|U|qm−γdx≤c4|U|qqmm+c5. (2.9) On the other hand, we have
|U|qqmm+1+2−γ≤c6
1 +qm−γ 2
2
Ω|∇U|2|U|qm−γdx. (2.10)
Therefore, we obtain
|U|qqmm+1+2−γ≤
c7+c8|U|qqmm
qm+ 2−γ. (2.11)
Thus,
|U|qqk+1k+1
2/δ
≤
c7+c8|U|qqkk
qk+ 2−γ. (2.12)
The rest of the proof follows the same lines as in [10, pages 383-384].
Uniqueness. ConsiderU andV two different solutions of (2.2) and definew=U−V. Then, we have
w−τw= λτ
Ωf(U)dx2
f(U)−f(V)
+λτ
Ωf(U)−f(V)dxΩf(V) +f(U)dx
Ωf(U)dx2Ωf(V)dx2 f(V).
(2.13)
Multiplying (2.13) byw, integrating onΩ, and using theL∞-estimate obtained inLemma 2.2, we get
|w|22+τ|∇w|22≤c9τ|w|22. (2.14)
Therefore,w=0 ifτ≤1/c9.
We address now the question of stability.
3. Stability
Theorem3.1. Assume(H1)-(H2)hold. Then, there existsc(T,u0)>0depending on data but not onNsuch that for anyn∈ {1,. . .,N},
(a)|Un|L∞(Ω)≤c(T,u0);
(b)|Un|22+τnk=1|∇Uk|22≤c(T,u0);
(c)nk=1|Uk−Uk−1|22≤c(T,u0).
Proof. (i) Multiplying (1.3) by|Uk|mUkfor some integerm≥1, usingLemma 2.2, and H¨older’s inequality, we obtain after simplification
Ukm+2≤Uk−1m+2+c10τ. (3.1) By induction and taking the limit in the resulting inequality asm→+∞, we get
UkL∞(Ω)≤cT,u0
. (3.2)
(ii) Multiplying the first equation of (1.3) byUk and using the hypotheses on f, one easily has
Uk−Uk−1,Uk+τ∇Uk22≤c11τUk1. (3.3)
Using the elementary identity 2a(a−b)=a2−b2+ (a−b)2and summing fromk=1 to n, we obtain
Un22+ n k=1
Uk−Uk−122+τ n k=1
∇Uk22≤u02
2+τc12
n k=1
Uk1. (3.4)
Then, the inequalities (b)-(c) hold by using the uniform bound ofUn inL∞ which is
established in part (a).
4. Error estimates for solutions
We will adopt the following notations concerning the time discretization for problem (1.1). We denote the time stepτ=T/N,tn=nτ, andIn=(tn,tn−1) forn=1,. . .,N. Ifz is a continuous function (resp., summable), defined in (0,T) with values inH−1(Ω) or L2(Ω) orH01(Ω), we definezn=z(tn,·),zn=(1/τ)Inz(t,·)dt,z0=z0=z(0,·); the error en=u(t)−Unfor all t∈In and the local errorseunandendefined byeun=un(t)−Un, en=un−Un.
We have the following theorem.
Theorem4.1. Let(H1)-(H2)hold. Then, the following error bounds are satisfied:
(1)en2L∞(0,T,H−1(Ω))+0T|en|2dt≤c13τ, (2)emH−1(Ω)≤c14τ1/2,
(3)|∇T
0 en(t)dt|2≤c15τ1/4.
Proof. For the proof, we consider the following variational formulation of discrete prob- lem (1.3):
Un−Un−1,ϕ+τ∇Un,∇ϕ= λτ
ΩfUndx2
fUn,ϕ, ∀ϕ∈H01(Ω). (4.1)
Integrating the continuous problem (1.1) overIn, we get un−un−1,ϕ+τ∇un,∇ϕ=λτ
fun,ϕ
Ωfundx2, ∀ϕ∈H01(Ω). (4.2) Substracting (4.2) from (4.1) and adding fromn=1 tomwithm≤N, we obtain
m n=1
en−en−1,ϕ+τ m n=1
∇eun,∇ϕ
≤c16τ m n=1
f(u)n−fUn,ϕ+c17τ m n=1
f(Un,ϕ.
(4.3)
Let (−)−1be the green operator satisfying
∇(−)−1ψ,∇ϕ=(ψ,ϕ)H−1(Ω),H10(Ω) (4.4) for allψ∈H−1(Ω),ϕ∈H01(Ω). Choosingϕ=(−)−1(en) as test function, we then ob- tain
I1+I2≤I3+I4, (4.5)
where
I1= m n=1
en−en−1, (−)−1en,
I2=τ m n=1
enu,en,
I3≤c16τ m n=1
f(u)n−fUn, (−)−1en,
I4=c17τ
m n=1
fUn, (−)−1en .
(4.6)
With the aid of the elementary identity 2a(a−b)=a2−b2+ (a−b)2and the property of (−)−1,I1reduces after straightforward calculations to
I1=1
2em2H−1(Ω)+1 2
m n=1
en−en−12H−1(Ω). (4.7)
On the other hand, I2=τ
m n=1
enu,en
= m n=1
In
u(t)−Un,u(t)−Undt+ m n=1
In
u(t)−Un,un−u(t)dt
=I21+I22,
(4.8)
where
I21= m n=1
In
u(t)−Un,u(t)−Undt= m n=1
In
en2
2dt,
I22= m n=1
In
u(t),un−u(t)dt− m n=1
In
Un,un−u(t)dt
=I221 +I222.
(4.9)
We now estimateI221.Using the boundedness of∂u/∂s(see [6]), we have I221=
m n=1
In
u(t),
tn
t
∂u
∂sds
dt
≤ m n=1
In
tn
t
∂u
∂s
H−1(Ω)ds
u(t)H01(Ω)dt
≤τ∂u
∂s
L2(0,tm,H−1(Ω))uL2(0,tm,H10(Ω))
≤c18τ.
(4.10)
In the same manner, we have I222≤τ∂u
∂s
L2(0,tm,H−1(Ω))
τ
m n=1
Un2H01(Ω) 1/2
≤c18τ.
(4.11)
Next, we estimate the first term on the right-hand side of (4.5) by using H¨older’s and Young’s inequalities and (H1),
I3≤
m n=1
In
f(u)−fUndt, (−)−1en
≤c20τ1/2 m n=1
In
f(u)−fUn22dt 1/2
enH−1(Ω)
≤η m n=1
In
f(u)−fUn22dt
+c21
η τ m n=1
en2H−1(Ω)
≤c22η m n=1
In
en2
2dt
+c21
η τ m n=1
en2H−1(Ω).
(4.12)
Moreover, we have
I4≤c23τ+c24τ m n=1
en2H−1(Ω). (4.13)
Choosing suitableη, we conclude that em2H−1(Ω)+
m n=1
en−en−12H−1(Ω)+ m n=1
In
en22dt
≤c25τ+c26τ m n=1
en2H−1(Ω).
(4.14)
On the other hand, settingym=m
n=1en2H−1(Ω), then from (4.14), we get
ym−ym−1≤c25τ+c26τ ym. (4.15)
By applying the discrete Gronwall inequality, we deduce that ym≤c(T). Therefore, we have
emH−1(Ω)≤c27τ1/2. (4.16)
On the other hand, we have sup
t∈(0,tm)
en(t)H−1(Ω)−c27τ1/2≤ max
1≤n≤m
en
tnH−1(Ω)= max
1≤n≤m
enH−1(Ω). (4.17)
Thus, we get
enL∞(0,T,H−1(Ω))−c27τ1/2≤ max
1≤n≤m
enH−1(Ω). (4.18)
From the last inequality, we obtain
en2L∞(0,T,H−1(Ω))+ T
0
en22dt≤c29τ, m
n=1
en−en−12H−1(Ω)≤c29τ.
(4.19)
Choosingϕ=τmn=1(un−Un) in (4.3), we get
τ
Ω
um−Um m
n=1
un−Undx
+τ2 m n=1
∇
un−Un
2
2
≤c30τ2
Ω
m n=1
f(u)n−fUn m
n=1
un−Un
dx +c31τ2
m n=1
fUn,
m n=1
un−Un.
(4.20)
Thus,
τ2 m n=1
∇
un−Un
2
2
= ∇
tm
0 endt
2 2≤τ
Ω
um−Um m
n=1
un−Undx +c30τ2
Ω
m n=1
f(u)n−fUn m
n=1
un−Un
dx +c31τ2
m n=1
fUn,
m n=1
un−Un
≤I+II+III.
(4.21)
Clearly,
I≤emH−1(Ω)
m
n=1
In
u(t)H10(Ω)dt+τ m n=1
UnH10(Ω)
≤c32emH−1(Ω)
≤c33τ1/2.
(4.22)
We also get II≤
Ω
m
n=1
In
f(u)−fUndt 2
dx
1/2
×
Ω
m
n=1
In
u(t)−Undt 2
dx
1/2
≤T2 m
n=1
In
f(u)−fUn22dt 1/2
× m
n=1
In
u(t)−Un22dt 1/2
≤T2 m
n=1
In
f(u)−f(Un22dt 1/2
×
2u2L2(0,T,H01(Ω))+ 2τ m n=1
Un22 1/2
≤c34τ1/2.
(4.23) The last inequality follows by using simultaneously theL∞-estimate ofu(t) (see [6]),Un, and the error bound given in (a). Arguing exactly as in the previous estimate, we get
III≤T2 m
n=1
In
fUn22dt 1/2
×
2u2L2(0,T,H01(Ω))+ 2τ m n=1
Un22 1/2
. (4.24) Using again the hypothesis (H1) and the estimates above, we obtain
III≤c35τ1/2. (4.25)
Finally collecting these results, it follows that ∇
T
0 endt
2
2≤c36τ1/2. (4.26)
This completes the proof.
Corollary4.2. Under hypotheses(H1)-(H2), problem (1.3) generates a continuous semi- groupSτdefined bySτUn−1=Un.
References
[1] W. Allegretto, Y. Lin, and A. Zhou,A box scheme for coupled systems resulting from microsensor thermistor problems, Dynam. Contin. Discrete Impuls. Systems5(1999), no. 1-4, 209–223.
[2] J. W. Bebernes and A. A. Lacey,Global existence and finite-time blow-up for a class of nonlocal parabolic problems, Adv. Differential Equations2(1997), no. 6, 927–953.
[3] F. Benzekri and A. El Hachimi,Doubly nonlinear parabolic equations related to thep-Laplacian operator: semi-discretization, Electron. J. Differential Equations2003(2003), no. 113, 1–14.
[4] A. Eden, B. Michaux, and J.-M. Rakotoson,Semi-discretized nonlinear evolution equations as discrete dynamical systems and error analysis, Indiana Univ. Math. J.39(1990), no. 3, 737–
783.
[5] A. El Hachimi and M. R. Sidi Ammi,Existence of weak solutions for the thermistor problem with degeneracy, Proceedings of the 2002 Fez Conference on Partial Differential Equations, Electron. J. Differ. Equ. Conf., vol. 9, Southwest Texas State University, Texas, 2002, pp.
127–137.
[6] ,Existence of global solution for a nonlocal parabolic problem, Electron. J. Qual. Theory Differ. Equ.2005(2005), no. 1, 1–9.
[7] A. A. Lacey,Thermal runaway in a non-local problem modelling Ohmic heating. I. Model deriva- tion and some special cases, European J. Appl. Math.6(1995), no. 2, 127–144.
[8] ,Thermal runaway in a non-local problem modelling Ohmic heating. II. General proof of blow-up and asymptotics of runaway, European J. Appl. Math.6(1995), no. 3, 201–224.
[9] P. Shi, M. Shillor, and X. Xu,Existence of a solution to the Stefan problem with Joule’s heating, J.
Differential Equations105(1993), no. 2, 239–263.
[10] F. de Th´elin,R´esultats d’existence et de non-existence pour la solution positive et born´ee d’une e.d.p. elliptique non lin´eaire[Existence and nonexistence results for a positive bounded solu- tion of a nonlinear elliptic partial differential equation], Ann. Fac. Sci. Toulouse Math. (5)8 (1986/1987), no. 3, 375–389 (French).
[11] D. E. Tzanetis,Blow-up of radially symmetric solutions of a non-local problem modelling Ohmic heating, Electron. J. Differential Equations2002(2002), no. 11, 1–26.
Abderrahmane El Hachimi: UFR Math´ematiques Appliqu´ees et Industrielles, D´epartement de Math´ematiques et Informatique, Facult´e des Sciences, Universit´e Chouaib Doukkali, B.P. 20, El Jadida, Morocco
E-mail address:[email protected]
Moulay Rchid Sidi Ammi: UFR Math´ematiques Appliqu´ees et Industrielles, D´epartement de Math´ematiques et Informatique, Facult´e des Sciences, Universit´e Chouaib Doukkali, B.P. 20, El Ja- dida, Morocco
E-mail address:[email protected]
Special Issue on
Intelligent Computational Methods for Financial Engineering
Call for Papers
As a multidisciplinary field, financial engineering is becom- ing increasingly important in today’s economic and financial world, especially in areas such as portfolio management, as- set valuation and prediction, fraud detection, and credit risk management. For example, in a credit risk context, the re- cently approved Basel II guidelines advise financial institu- tions to build comprehensible credit risk models in order to optimize their capital allocation policy. Computational methods are being intensively studied and applied to im- prove the quality of the financial decisions that need to be made. Until now, computational methods and models are central to the analysis of economic and financial decisions.
However, more and more researchers have found that the financial environment is not ruled by mathematical distribu- tions or statistical models. In such situations, some attempts have also been made to develop financial engineering mod- els using intelligent computing approaches. For example, an artificial neural network (ANN) is a nonparametric estima- tion technique which does not make any distributional as- sumptions regarding the underlying asset. Instead, ANN ap- proach develops a model using sets of unknown parameters and lets the optimization routine seek the best fitting pa- rameters to obtain the desired results. The main aim of this special issue is not to merely illustrate the superior perfor- mance of a new intelligent computational method, but also to demonstrate how it can be used effectively in a financial engineering environment to improve and facilitate financial decision making. In this sense, the submissions should es- pecially address how the results of estimated computational models (e.g., ANN, support vector machines, evolutionary algorithm, and fuzzy models) can be used to develop intelli- gent, easy-to-use, and/or comprehensible computational sys- tems (e.g., decision support systems, agent-based system, and web-based systems)
This special issue will include (but not be limited to) the following topics:
• Computational methods: artificial intelligence, neu- ral networks, evolutionary algorithms, fuzzy inference, hybrid learning, ensemble learning, cooperative learn- ing, multiagent learning
• Application fields: asset valuation and prediction, as- set allocation and portfolio selection, bankruptcy pre- diction, fraud detection, credit risk management
• Implementation aspects: decision support systems, expert systems, information systems, intelligent agents, web service, monitoring, deployment, imple- mentation
Authors should follow the Journal of Applied Mathemat- ics and Decision Sciences manuscript format described at the journal site http://www.hindawi.com/journals/jamds/.
Prospective authors should submit an electronic copy of their complete manuscript through the journal Manuscript Track- ing System athttp://mts.hindawi.com/, according to the fol- lowing timetable:
Manuscript Due December 1, 2008 First Round of Reviews March 1, 2009 Publication Date June 1, 2009
Guest Editors
Lean Yu,Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;
Department of Management Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong;
Shouyang Wang,Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China; [email protected]
K. K. Lai,Department of Management Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong; [email protected]
Hindawi Publishing Corporation http://www.hindawi.com