• 検索結果がありません。

反応拡散方程式系におけるパターン形成に対する計 算機援用証明

N/A
N/A
Protected

Academic year: 2021

シェア "反応拡散方程式系におけるパターン形成に対する計 算機援用証明"

Copied!
75
0
0

読み込み中.... (全文を見る)

全文

(1)

九州大学学術情報リポジトリ

Kyushu University Institutional Repository

反応拡散方程式系におけるパターン形成に対する計 算機援用証明

蔡, ??

九州大学大学院数理学府

https://doi.org/10.15017/21706

出版情報:Kyushu University, 2011, 博士(数理学), 課程博士 バージョン:

権利関係:

(2)

A computer-assisted proof for the pattern formation on reaction-diffusion systems

Shuting Cai

Graduate School of Mathematics, Kyushu University

2012

(3)

Contents

Abstract ii

1 Introduction 1

2 Some notations and projection error estimation 3

3 Approximate solution 17

4 Verification 21

4.1 Fixed point equation . . . 21

4.2 Verification condition . . . 22

4.2.1 Finite dimensional part . . . 23

4.2.2 Infinite dimensional part . . . 29

4.2.3 Verification Algorithm . . . 34

5 Eigenvalue excluding 37 5.1 Eigenvalue excluding theorem . . . 37

5.2 Invertibility condition of ˆL . . . 38

5.3 Computable criterion for the invertibility of ˆL . . . 41

5.4 Direct computation of upper bound for ˆL1 . . . 48

5.5 Eigenvalue problem of the linearized operator at the exact solution . . . 51

6 The domain of attraction 56

7 Numerical Results 63

8 Conclusions 67

Acknowledgements 68

References 69

(4)

Abstract

In this paper we give a method by computer-assistance to prove a pattern formation. As a typical model we consider two dimensional time-dependent reaction-diffusion equations with Neumann boundary conditions. For suit- able system parameters we solve (approximately) the parabolic problem, hop- ing for some convergence to some pattern formation stationary (approximate) solution, and improve the approximation to a stationary solution by Newton’s method, then enclose the stationary solution by our numerical verification method. Next we prove that the operator linearized at the exact stationary solution is a sectorial operator and compute a bound for the resolvent of the linearized operator which is needed for semigroup estimates. By using the semigroup estimate we analytically compute a domain of attraction for the stationary solution, i.e. some (norm-)neighborhood of the stationary solution such that, for initial data within this neighborhood, the parabolic solution converges to the stationary solution. For suitable initial conditions, if we enclose the solution of the parabolic problem until, for some time T, the en- closing set is a subset of the domain of attraction, then we can conclude that from time T on, convergence to the stationary solution takes place. This gives a complete convergence result, proving a pattern formation, for the initial conditions used for the parabolic problem.

Keyword:

Pattern formation; Computer-assisted proof; Reaction-diffusion system;

Domain of attraction.

(5)

Chapter 1 Introduction

We consider a time-dependent reaction-diffusion system with Neumann bound-

ary conditions 





ut=γf(u, v) + ∆u in Ω, vt=γg(u, v) +d∆v in Ω,

∂u

∂ν = ∂v

∂ν = 0 onΩ,

(1.0.1)

where Ω is a bounded domain in 2, γ, dare some positive constants,f, g are nonlinear/linear functions depending on each model and ν = (ν1, ν2) is an outer unit normal vector on ∂Ω.

This kind of problem (1.0.1) can be applied in mathematical biology[10, 11]. One simple system is FitzHugh-Nagumo reaction[6, 15]. In [7], u as an activator and v as an inhibitor are interpreted as relative concentrations of two substances known as morphogens. In [26], this kind of problem, called

”Excitable media”, can be applied in mammalian heart muscle and its cells and Xenopus eggs. For more background, see references in [23].

There are many papers considering the stationary solution of the system.

Here we mention some results on the systems of FitzHugh-Nagumo type.

There are several results about Dirichlet problem[4, 3, 20, 24]. In [4] the minimization problem associated with the system is considered, and in [3]

the peak solutions for the system are investigated. There is also one paper considering the relationship between the parameter and the solution of the system[20]. In [24], by using a numerical verification method, the author encloses the exact solution of the equations. There are also some results for Neumann problem. In [5] some results on the solutions with interior and boundary peaks are shown, and in [21] the relationship between one param- eter and the energy minimizers is discussed. In [2], the authors proposed a numerical verification method to enclose a solution of the two dimensional

(6)

system.

In this paper, we will propose a computer-assisted method to prove a pattern formation. Knowing the pattern formation is very important in biology[11]. When we solve a time-dependent problem, we often see some numerical convergence of them, but analytically there is no proof of it. On the other hand when we compute a steady state problem, we do not know from which initial state the stationary solution appeared. This paper is about how to overcome these two difficulties. As a concrete example, we will apply our method to Schnakenberg equation, which is another reaction-diffusion system.

There are eight chapters in this paper. In chapter 2, we prepare some function spaces and notations and then the fixed-point formulation and the construction of a priori error estimate for the projection are derived. And in Chapter 3, for suitable system parameters we solve (approximately) the parabolic problem and improve the approximation to a stationary (approxi- mate) solution by Newton’s method. After that, in Chapter 4, we use Nakao’s method to enclose the stationary solution near this approximate solution.

This method, which is similar to the method in [2], is based on the infi- nite dimensional fixed point theorem. First, the time-independent system is rewritten in a fixed point form and then the fixed point equation is decom- posed into the finite dimensional part and the infinite dimensional error part.

Based on these two parts, we construct a set which satisfies the hypothesis of Schauder’s fixed point theorem for a compact map in a suitable Sobolev space. This verification method was originated by Nakao[16] and then has been developed by him and his coworkers[18, 19, 12, 13, 14].

Then we prove that the operator linearized at the exact stationary so- lution is a sectorial operator and compute a bound for the resolvent of the linearized operator which is needed for semigroup estimates. By using the semigroup estimate we analytically compute a domain of attraction for the stationary solution. And thus, for suitable initial conditions, if we enclose the solution of the parabolic problem until, for some time T, the enclosing set is a subset of the domain of attraction, then we can conclude that from timeT on, convergence to the stationary solution takes place. This is showed in Chapter 6. And in order to get the results in Chapter 6, we propose a computer-assisted method to exclude the eigenvalues of the linearized oper- ator in Chapter 5. In Chapter 7, there are some numerical results. We apply our method to an example with some suitable system parameters and then get its domain of attraction. At last there are some conclusions in Chapter 8.

(7)

Chapter 2

Some notations and projection error es- timation

We consider the domain Ω = (0, l)×(0, l) ⊂ ℜ2(l 1). Then we choose basis function as

φi1i2(x, y) = cos(i1πx/l) cos(i2πy/l), i1, i2 = 0,1,2, . . . For a fixed non-negative integer N we reorder the basis function

φi = cos(i1πx/l) cos(i2πy/l),(i= 1,2,3,· · ·(N + 1)2) (i1, i2 = 0,1,2,· · ·N) in the following way:

i=i1(N + 1) +i2+ 1.

The Sobolev spaceWk,p(Ω)(1≤p≤+) is defined as Wk,p(Ω) :={u∈Lp(Ω) :Dαu∈Lp(Ω),∀|α| ≤k},

where α is a multi-index. The natural number k is called the order of the Sobolev space Wk,p(Ω).

And we suppose that for the L2-Sobolev space of order k on Ω, Hk(Ω), ψ ∈Hk(Ω) (k 0) is expanded in the Fourier series as

ψ =

i=1

aiφi (ai ∈ ℜ).

For a non-negative integerN, let XN denote a function space as XN :=

{ vN =

N n,m=0

cnmφnm|cnm∈ ℜ }

⊂H2(Ω)⊂H1(Ω).

(8)

Forz1, z2 ∈H1(Ω), define the usual inner product as

⟨z1, z2H1(Ω):= (z1, z2)L2(Ω)+ (∇z1,∇z2)L2(Ω), where (·,·)L2(Ω) means the inner product on L2(Ω).

Forz ∈Hk(Ω)(1≤k < ∞, k̸= 2), define the usual norm as

∥z∥2Hk(Ω) := ∑

|α|≤k

∥Dαz∥2L2(Ω).

When k= 2, for z = ∑

n,m=0

cnmφnm ∈H2(Ω), we have

∥z∥2L2(Ω)+∥∇z∥2L2(Ω)+∆z2L2(Ω)

=∥z∥2L2(Ω)+∥∇z∥2L2(Ω)+

n,m=0

c2nm(nm)xx2L2(Ω)+nm)yy2L2(Ω) + 2((φnm)xx,nm)yy)L2(Ω))

=∥z∥2L2(Ω)+∥∇z∥2L2(Ω)+

n,m=0

c2nm((n4+m44/l4 + 2n2m2π4/l4)∥φnm2L2(Ω)

=∥z∥2L2(Ω)+∥∇z∥2L2(Ω)+

n,m=0

c2nm(nm)xx2L2(Ω)+nm)yy2L2(Ω) + 2((φnm)xy,nm)xy)L2(Ω))

= ∑

|α|≤2

∥Dαz∥2L2(Ω),

where (φnm)x is the derivative of φnm with respect to x, (φnm)xy is the derivative of (φnm)x with respect to y and (φnm)xx, (φnm)yy are the second derivative of φnm with respect to x and y respectively, therefore, we define the norm in H2(Ω) as

∥z∥2H2(Ω):=∥z∥2L2(Ω)+∥∇z∥2L2(Ω)+∆z2L2(Ω). And for z1, z2 ∈H2(Ω), define the inner product as

⟨z1, z2H2(Ω) := (z1, z2)L2(Ω)+ (∇z1,∇z2)L2(Ω)+ (∆z1,∆z2)L2(Ω). For z H1(Ω), let PN : H1(Ω) →XN denote the H1-projection defined by the truncation operator:

PN

( ∑

n,m=0

cnmφnm )

=

N n,m=0

cnmφnm,

(9)

which satisfies

⟨z−PNz, zNH1(Ω) = 0, for all zN ∈XN. When z∈H2(Ω), we also have

⟨z−PNz, zNH2(Ω) = 0, for all zN ∈XN. Therefore, we also use PN as a H2-projection.

Set P :H2(Ω)×H2(Ω)→XN ×XN as

P(z1, z2) := (PNz1, PNz2), z1, z2 ∈H2(Ω).

For Hilbert spaces X and Y, we define the inner product and the norm in X×Y as

(( x1 y1

) ,

( x2 y2

))

X×Y

:= (x1, x2)X + (y1, y2)Y

and

( x y

):=

∥x∥2X +∥y∥2Y.

Defining the operator L : H2(Ω) L2(Ω) by := −△ψ +ψ, we get the following lemma.

Lemma 2.0.1 For all ϕ∈L2(Ω), the linear equation { =ϕ in Ω,

∂ψ

∂ν = 0 on ∂Ω (2.0.1)

has the unique solution ψ ∈H2(Ω).

Proof. Let ψ = ∑

n,m=0

ψnmφnmnm∈ ℜ, n, m= 0,1,2, . . .).

Forϕ= ∑

n,m=0

ϕnmφnm ∈L2(Ω) (ϕnm ∈ ℜ, n, m= 0,1,2, . . .),let

ψnm = ϕnm

1 +n2π2/l2+m2π2/l2, then =ϕ holds. By observing

n,m=0

(1 +n2π2/l2+m2π2/l2 +n4π4/l4+m4π4/l4+ 2n2m2π4/l4nm2

(10)

=

n,m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4)

·

( ϕnm

1 +n2π2/l2+m2π2/l2 )2

<

n,m=0

3(l2+n4π4/l2+m4π4/l2) ϕ2nm

1 +n4π4/l4+m4π4/l4

=

n,m=0

2nml2 <∞, and

∥ψ∥2H2(Ω)

=

n,m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l42nm∥φnm2L2(Ω)

<

n,m=0

l2(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4nm2 , ψ ∈H2(Ω) follows.

Noting that the solution of =ϕ is characterized as the solution of

∇ψ· ∇v dx+

ψv dx=

ϕv dx, ∀v ∈H1(Ω),

we have ∫

(∆ψ+ψ)v dx+

∂Ω

∂ψ

∂νv dx=

ϕv dx,

and thus ∫

∂Ω

∂ψ

∂νv dx= 0.

Sincev is arbitrary inH1(Ω), in case ψ ∈H2(Ω) we have ∂ψ∂ν = 0 in the trace sense.

If there exists another solution ˜ψ ̸=ψ, we get ˜=ϕ,

which means the existence of a non-trivial solution of the equation = 0.

But noting that

(Lφ, φ)L2(Ω) =∥φ∥2H1(Ω)

holds, = 0 derives ∥φ∥2H1(Ω) = 0, i.e. φ = 0, which contradicts the assumption and the uniqueness of the solution of =ϕ follows. 2

(11)

Remark 2.0.2 For ϕ L2(Ω), we denote the solution of (2.0.1) as L1ϕ.

Then it is clear that L1ϕ satisfies Neumann boundary conditions.

Lemma 2.0.3 For all ϕ∈L2(Ω), the linear equation



(∆2∆ +I)ψ =ϕ in Ω,

∂Ω

(∂ψ

∂νv−∆ψ∂v

∂ν +∂(∆ψ)

∂ν v )

dx= 0, for ∀v ∈H2(Ω) has the unique solution ψ ∈H4(Ω).

Proof. Let ψ = ∑

n,m=0

ψnmφnmnm∈ ℜ, n, m= 0,1,2, . . .).

Forϕ= ∑

n,m=0

ϕnmφnm ∈L2(Ω) (ϕnm ∈ ℜ, n, m= 0,1,2, . . .),let

ψnm= ϕnm

1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4, then (∆2∆ +I)ψ =ϕ holds. By observing

n,m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+n6π6/l6+m6π6/l6 +n8π8/l8+m8π8/l8+ 2m2n2π4/l4+ 3m4n2π6/l6+ 3m2n4π6/l6

+ 4m2n6π8/l8+ 4n2m6π8/l8+ 6n4m4π8/l82nm

=

n,m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+n6π6/l6+m6π6/l6 +n8π8/l8+m8π8/l8+ 2m2n2π4/l4+ 3m4n2π6/l6+ 3m2n4π6/l6

+ 4m2n6π8/l8+ 4n2m6π8/l8+ 6n4m4π8/l8)

·

( ϕnm

1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4 )2

<

n,m=0

16(l4+n8π8/l2 +m8π8/l2) ϕ2nm

1 +n8π8/l8+m8π8/l8

=

n,m=0

16ϕ2nml4 <∞,

(12)

and

∥ψ∥2H4

=

n,m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+n6π6/l6+m6π6/l6 +n8π8/l8+m8π8/l8+ 2m2n2π4/l4+ 3m4n2π6/l6+ 3m2n4π6/l6

+ 4m2n6π8/l8+ 4n2m6π8/l8+ 6n4m4π8/l82nm∥φnm2L2

<

n,m=0

l2(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+n6π6/l6+m6π6/l6 +n8π8/l8+m8π8/l8+ 2m2n2π4/l4+ 3m4n2π6/l6+ 3m2n4π6/l6

+ 4m2n6π8/l8+ 4n2m6π8/l8+ 6n4m4π8/l82nm, ψ ∈H4(Ω) follows.

Noting that the solution of (∆2 ∆ +I)ψ = ϕ is characterized as the solution of

∆ψ∆v dx+

∇ψ· ∇v dx+

ψv dx=

ϕv dx, ∀v ∈H2(Ω), we have

(∆2ψ−∆ψ+ψ)v dx+

∂Ω

∂ψ

∂νv dx+

∂Ω

∂(∆ψ)

∂ν v dx−

∂Ω

∂v

∂ν∆ψ dx=

ϕv dx, and thus

∂Ω

∂ψ

∂νv dx+

∂Ω

∂(∆ψ)

∂ν v dx−

∂Ω

∂v

∂ν∆ψ dx= 0.

If there exists another solution ˜ψ ̸=ψ, we get (∆2∆ +I) ˜ψ =ϕ,

which means the existence of a non-trivial solution of the equation (∆2

∆ +I)φ= 0. But noting that

((∆2∆ +I)φ, φ)L2(Ω)=∥φ∥2H2(Ω)

holds, (∆2∆ +I)φ= 0 derives∥φ∥2H2(Ω) = 0, i.e. φ= 0, which contradicts the assumption and the uniqueness of the solution of (∆2 ∆ +I)ψ = ϕ follows. 2

Now we derive an estimation for the projection PN, an imbedding con- stant from H1(Ω) toLp(Ω) for 2≤p <∞ and an imbedding constant from H2(Ω) to Lp(Ω) for 2≤p≤ ∞.

(13)

Lemma 2.0.4 For all z ∈H4(Ω), we have

∥z−PNz∥H2(Ω) ≤C2(N)∥△2z− △z+z∥L2(Ω), where C2(N) = √

1

1+(N+1)2π2/l2+(N+1)4π4/l4. And for z∈H2(Ω),

∥z−PNz∥L2(Ω) ≤C2(N)∥z−PNz∥H2(Ω)

holds.

Proof. For z = ∑

n,m=0

cnmφnm ∈H2(Ω), we obtain

∥z−PNz∥2H2(Ω)

≤∥z−PNz∥2L2(Ω)+(z−PNz)x2L2(Ω)+(z−PNz)y2L2(Ω)+(z−PNz)xx2L2(Ω)

+(z−PNz)yy2L2(Ω)+ 2((z−PNz)xx,(z−PNz)yy)L2(Ω)

=

n=N+1

m=0

c2nm∥φnm2L2(Ω)+

N n=0

m=N+1

c2nm∥φnm2L2(Ω)

+

n=N+1

m=0

c2nmnm)x2L2(Ω)+

N n=0

m=N+1

c2nmnm)x2L2(Ω)

+

N n=0

m=N+1

c2nmnm)y2L2(Ω)+

n=N+1

m=0

c2nmnm)y2L2(Ω)

+

n=N+1

m=0

c2nmnm)xx2L2(Ω)+

N n=0

m=N+1

c2nmnm)xx2L2(Ω)

+

N n=0

m=N+1

c2nmnm)yy2L2(Ω)+

n=N+1

m=0

c2nmnm)yy2L2(Ω)

+

N n=0

m=N+1

c2nm2((φnm)xx,nm)yy)L2(Ω)+

n=N+1

m=0

c2nm2((φnm)xx,nm)yy)L2(Ω)

=

N n=0

m=N+1

c2nm(∥φnm2L2(Ω)+nm)x2L2(Ω)+nm)y2L2(Ω)+nm)xx2L2(Ω) +nm)yy2L2(Ω)+ 2((φnm)xx,nm)yy)L2(Ω)) +

n=N+1

m=0

c2nm(∥φnm2L2(Ω)

+nm)x2L2(Ω)+nm)y2L2(Ω)+nm)xx2L2(Ω)+nm)yy2L2(Ω)

+ 2((φnm)xx,nm)yy)L2(Ω))

(14)

n=N+1

m=0

c2nm(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4)∥φnm2L2(Ω)

+

N n=0

m=N+1

c2nm(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4+ 2n2m2π4/l4)∥φnm2L2(Ω)

1

1 + (N + 1)2π2/l2+ (N + 1)4π4/l4

·

n=0

m=0

(1 +n2π2/l2+m2π2/l2+n4π4/l4+m4π4/l4 + 2n2m2π4/l4)2c2nm∥φnm2L2(Ω)

= 1

1 + (N + 1)2π2/l2+ (N + 1)4π4/l42z−∆z+z∥2L2(Ω). So we get C2(N) =

1

1+(N+1)2π2/l2+(N+1)4π4/l4.

For ∥z PNz∥L2, we use the so-called Aubin-Nitsche technique. We consider the linear equation:



(∆2∆ +I)Φ =z−PNz in Ω,

∂Ω

(∂Φ

∂νv−∆Φ∂v

∂ν +(∆Φ)

∂ν v )

dx= 0,for ∀v ∈H2(Ω).

By Lemma 2.0.3, we know that there exists the unique solution Φ∈H4(Ω).

Therefore, we have

∥z−PNz∥2L2(Ω)

=(z−PNz, z−PNz)L2(Ω)= (z−PNz,(∆2∆ +I)Φ)L2(Ω)

=(z−PNz,Φ)L2(Ω)+ ((z−PNz),∇Φ)L2(Ω)+ (∆(z−PNz),∆Φ)L2(Ω)

∂Ω

(∂Φ

∂ν(z−PNz)−∆Φ(z−PNz)

∂ν + ∂(∆Φ)

∂ν (z−PNz) )

dx

=⟨z−PNz,ΦH2(Ω)

=⟨z−PNz,Φ−PNϕ⟩H2(Ω)

≤∥z−PNz∥H2(Ω)Φ−PNΦH2(Ω)

≤∥z−PNz∥H2(Ω)C2(N)∥z−PNz∥L2(Ω).

So ∥z−PNz∥L2(Ω) ≤C2(N)∥z−PNz∥H2(Ω) holds. 2

Lemma 2.0.5 Ω = (a, b)×(a, b), a < b. Then, for all u∈H1(Ω), we have

∥u∥Lp(Ω) ≤Kp∥u∥H1(Ω),(2≤p <∞) where Kp =

( 1

ba +2p2

)(p2)/p

.

(15)

Proof. For (x, y)Ω, we have (x−a)|u(x, y)|p/2 =∫x

a

∂t[(t−a)|u(t, y)|p/2]dt

=∫x

a |u(t, y)|p/2dt+p2x

a(t−a)|u(t, y)|p/22u(t, y)∂u∂x(t, y)dt

x

a |u(t, y)|p/2dt+ p2(b−a)x

a |u(t, y)|p/21∂u

∂x(t, y)dt, (2.0.2) and

(b−x)|u(x, y)|p/2 =b x

∂t[(b−t)|u(t, y)|p/2]dt

=∫b

x |u(t, y)|p/2dt− p2b

x(b−t)|u(t, y)|p/22u(t, y)∂u∂x(t, y)dt

b

x|u(t, y)|p/2dt+p2(b−a)b

x |u(t, y)|p/21∂u

∂x(t, y)dt.

(2.0.3) Adding (2.0.2) and (2.0.3), we get

(b−a)|u(x, y)|p/2 b

a |u(t, y)|p/2dt+p2(b−a)b

a |u(t, y)|p/21∂u

∂x(t, y)dt

=:f(y).

(2.0.4) Analogously, integrating instead in y-direction,

(b−a)|u(x, y)|p/2 b

a |u(x, t)|p/2dt+p2(b−a)b

a |u(x, t)|p/21∂u∂y(t, y)dt

=:g(x)

(2.0.5) holds.

Multiplying (2.0.4) and (2.0.5), we have

(b−a)2|u(x, y)|p ≤f(y)g(x) and integrating over Ω we obtain

(b−a)2

|u(x, y)|pdxdy

f(y)g(x)dxdy = (∫ b

a

f(y)dy

) (∫ b a

g(x)dx )

= (∫

|u(t, y)|p/2dtdy+ p

2(b−a)

|u(t, y)|p/2−1 ∂u

∂x(t, y) dtdy

)

· (∫

|u(x, t)|p/2dxdt+p

2(b−a)

|u(x, t)|p/2−1 ∂u

∂y(x, t) dxdt

)

(16)

∫

|u|p/2dxdy+p

2(b−a) (∫

|u|p2dxdy

)1/2(∫

∂u

∂x

2dxdy

)1/2

·

∫

|u|p/2dxdy+p

2(b−a) (∫

|u|p2dxdy

)1/2(∫

∂u

∂y

2dxdy )1/2

 and thus, using (A +Bλ)(A+ Bµ) = A2 +AB(λ +µ) +B2λµ A2 +

2AB√

λ2+µ2+12B22+µ2) = (A+1 2B

λ2+µ2)2, we have (b−a)2

|u(x, y)|pdxdy

(∫

|u|p/2dxdy+ p 2

2(b−a) (∫

|u|p2dxdy

)1/2(∫

|∇u|2dxdy

)1/2)2

i.e. we obtain

|u|p (

1 b−a

|u|p/2+ p 2

2 (∫

|u|p2

)1/2(∫

|∇u|2

)1/2)2

, (2.0.6) here and in the following we omit to write dxdy.

When p= 4, from (2.0.6), we have

|u|4 (

b−a1

|u|2+ 2(∫

|u|2)1/2(∫

|∇u|2)1/2)2

(

1 ba

|u|2+22(∫

|u|2+∫

|∇u|2))2

(

1 ba +22

)2(∫

|u|2+∫

|∇u|2)2

= ( 1

ba+ 22 )2

∥u∥4H1(Ω),

therefore, for 2≤p < 4 by using H¨older’s inequality, we get

|u|p =∫

|u|4p|u|2p4 (∫

|u|2)(4p)/2(∫

|u|4)(p2)/2

≤ ∥u∥4H1p(Ω)((

1 ba+ 22

)2

∥u∥4H1(Ω)

)(p2)/2

(

1 ba +22

)p2

∥u∥pH1(Ω), that is,

∥u∥Lp(Ω) (

1 b−a +

2 2

)(p2)/p

∥u∥H1(Ω) (2≤p <4) (2.0.7)

Figure 7.1: Finite part of initial values in Galerkin method. The left one is u h (0) and the right one is v h (0).
Figure 7.2: The approximate solutions of Example 1 which we got from Galerkin method. The left one is u h (T ) and the right one is v h (T ).
Figure 7.5: The eigenvalue excluding results. The right one is a zoom in of the left one.

参照

関連したドキュメント

[r]

[Publications] Masaaki Tsuchiya: &#34;A Volterra type inregral equation related to the boundary value problem for diffusion equations&#34;

で得られたものである。第5章の結果は E £vÞG+ÞH 、 第6章の結果は E £ÉH による。また、 ,7°²­›Ç›¦ には熱核の

この節では mKdV 方程式を興味の中心に据えて,mKdV 方程式によって統制されるような平面曲線の連 続朗変形,半離散 mKdV

The aim of the present paper is to establish Grüss type inequalities for some perturbed ˇ Cebyšev functionals... Perturbed ˇ Cebyšev

Irreducible, admissible, generic representations of GSp(4, F ) admit a theory of zeta integrals, and every zeta integral gives rise to a split Bessel functional.. As a

In order to solve this problem we in- troduce generalized uniformly continuous solution operators and use them to obtain the unique solution on a certain Colombeau space1. In

Abstract. The backward heat problem is known to be ill possed, which has lead to the design of several regularization methods. In this article we apply the method of filtering out