• No results found

Maximum norm a posteriori error estimation for parabolic problems using elliptic reconstructions

N/A
N/A
Protected

Academic year: 2019

Share "Maximum norm a posteriori error estimation for parabolic problems using elliptic reconstructions"

Copied!
31
0
0

Loading.... (view fulltext now)

Full text

(1)

UMER. NAL c

Vol. 51, No. 3, pp. 1494–1524

MAXIMUM NORM A POSTERIORI ERROR ESTIMATION FOR

PARABOLIC PROBLEMS USING ELLIPTIC RECONSTRUCTIONS

NATALIA KOPTEVA AND TORSTEN LINSS

Abstract. A semilinear second-order parabolic equation is considered in a regular and a sin-gularly perturbed regime. For this equation, we give computable a posteriori error estimates in the maximum norm. Semidiscrete and fully discrete versions of the backward Euler, Crank–Nicolson, and discontinuous Galerkin dG(r) methods are addressed. For their full discretizations, we employ elliptic reconstructions that are, respectively, piecewise-constant, piecewise-linear, and piecewise-quadratic forr= 1 in time. We also use certain bounds for the Green’s function of the parabolic operator.

Key words. a posteriori error estimate, maximum norm, singular perturbation, elliptic recon-struction, backward Euler, Crank–Nicolson, discontinuous Galerkin, parabolic equation, reaction-diffusion

AMS subject classifications.65M15, 65M60

DOI.10.1137/110830563

1. Introduction.

Consider a semilinear parabolic equation in the form

(1.1a)

M

u

:=

t

u

+

L

u

+

f

(

x, t, u

) = 0

for (

x, t

)

Q

:= Ω

×

(0

, T

]

with a second-order linear elliptic operator

L

=

L

(

t

) in a spatial domain Ω

R

n

with

Lipschitz boundary, subject to the initial and Dirichlet boundary conditions

(1.1b)

u

(

x,

0) =

ϕ

(

x

)

for

x

Ω

¯

,

u

(

x, t

) = 0

for (

x, t

)

Ω

×

[0

, T

]

.

We assume that

f

is continuous in ¯

Ω

×

[0

, T

]

×

R

, is differentiable in the third argument,

and, for some nonnegative constants

γ

and ¯

γ

, satisfies

(1.2)

0

γ

2

z

f

(

x, t, z

)

γ

¯

2

for

(

x, t, z

)

Ω

¯

×

[0

, T

]

×

R

.

The purpose of this paper is to obtain computable a posteriori error estimates for

fully discrete methods applied to problem (1.1). We consider the first-order backward

Euler and the second-order Crank–Nicolson discretizations in time. Furthermore, we

study the discontinuous Galerkin method dG(

r

),

r

1, with Radau quadrature.

These results are applied to the model equation with

L

:=

ε

2

=

ε

2

ni=1

x2

i

:

(1.3)

M

u

:=

t

u

ε

2

u

+

f

(

x, t, u

) = 0

posed in a bounded polyhedral spatial domain Ω

R

n

with

n

= 1

,

2

,

3. This equation

will be considered in two regimes:

(i)

ε

= 1

, γ

0;

(ii)

ε

1

, γ >

0

.

Received by the editors April 13, 2011; accepted for publication (in revised form) March 20, 2013; published electronically May 22, 2013. This research was conducted with the financial support of Science Foundation Ireland under Research Frontiers Programme 2008 grant 08/RFP/MTH1536.

http://www.siam.org/journals/sinum/51-3/83056.html

Department of Mathematics and Statistics, University of Limerick, Limerick, Ireland (natalia. [email protected]).

Fakult¨at f¨ur Mathematik und Informatik, FernUniversit¨at in Hagen, 58095 Hagen, Germany ([email protected]).

1494

(2)

Note that regime (ii) yields a singularly perturbed reaction-diffusion equation, whose

solutions may exhibit sharp layer phenomena. It is important in this regime that a

posteriori error estimates are robust in the sense that any dependence on the small

perturbation parameter

ε

should be shown explicitly [21, 25].

We will give error estimates in the

maximum norm

, which is sufficiently strong to

capture sharp layers and singularities that may occur, in particular, if problem (1.1) is

of singularly perturbed type. Our estimates will be of

interpolation type

in the sense

that they will include certain terms that may be interpreted as approximating

τ

jp

|

tp

u

|

,

where

p

and

τ

j

are the discretization order and local step size in time, respectively.

We employ the

elliptic reconstruction

technique, which was introduced in the

recent papers [22, 19, 6] as a counterpart of the Ritz-projection in the a posteriori

error estimation for parabolic problems. We also use certain bounds for the

Green’s

function

of the continuous parabolic operator in a manner similar to [6], only for a

more general semilinear parabolic operator of (1.3) (compared to

t

in [6]).

One distinctive feature of our analysis in this paper (compared, e.g., to [1, 6])

is that we use computed solutions and elliptic reconstructions that are

piecewise-polynomial of degree

p

1 in time, where

p

is the time discretization order. In

partic-ular, they are

piecewise-constant

in time when dealing with the first-order backward

Euler method and

piecewise-linear

and

-quadratic

, respectively, when dealing with

the second-order Crank–Nicolson method, and the third-order dG(1) method.

Con-sequently, we allow the residuals of computed solutions, as well as other functions, to

be understood as

distributions

; this inclusion plays a crucial role in our analysis.

Note that earlier pointwise/maximum norm a posteriori error estimates for

parabolic equations either are given for regular linear problems [9, 3, 6, 7] or are

not robust in the sense that they involve negative powers of

ε

[3]. For a more detailed

comparison of our results with various earlier a posteriori error estimates, we refer

the reader to Remarks 5.3, 9.5, 9.9, and 11.7 below.

The paper is organized as follows. In section 2, we introduce the Green’s function

and obtain a certain stability lemma, which is the key ingredient of our a posteriori

error analysis. The contents of sections 3–6 and 8–11 are summarized in the table

below, while section 7 looks into elliptic a posteriori error estimators.

Summary

Backward

Crank–

of results

Euler

Nicolson

dG(

r

)

Semidiscretizations

section 3

section 4

section 5

section 6

Full discretizations

section 8

section 9

section 10

section 11

Notation.

Throughout the paper,

C

, as well as

c

, denotes a generic positive

constant that may take different values in different formulas but is

independent of

the diffusion coefficient

ε

and any mesh sizes

. We use

|

x

|

for the Euclidean norm of

x

R

n

. The usual spaces

C

( ¯

Ω) and

H

01

(Ω) are used, as well as the spaces

L

p

(Ω),

1

p

≤ ∞

, with the norm

·

p,Ω

, while

φ, ψ

=

Ω

φ

(

x

)

ψ

(

x

) d

x

denotes the inner

product in

L

2

(Ω).

Distributions and left-continuity convention.

Certain functions will be understood

as distributions [13], which will in most cases be indicated. By contrast, if a certain

function is Lebesgue-integrable in Ω

×

(0

, T

), we shall refer to it as a regular function.

Whenever we deal with a regular function, it will be understood as

left-continuous

for

all

t

(0

, T

]. In particular, this convention will be applied to all piecewise-continuous

temporal derivatives.

(3)

1496

NATALIA KOPTEVA AND TORSTEN LINSS

2. The Green’s function of the parabolic operator.

In this section we

consider the Green’s function

G

associated with the operator

M

of (1.1). Our interest

in the Green’s function is in that it will be used to express the error of a numerical

approximation in terms of its residual.

For definitions and properties of fundamental solutions and Green’s functions of

parabolic operators with variable coefficients, we refer the reader to [12, Chapter 1

and section 7 of Chapter 3]. For any pair of bounded functions

v

and

w

that vanish

on

Ω, the standard linearization yields

M

v

− M

w

= [

t

+

L

+

a

(

x, t

)](

v

w

), where

a

(

x, t

) :=

01

z

f

(

x, t, w

+

z

[

v

w

]) d

z

. Hence, the difference

v

w

is represented as

[

v

w

](

x, t

) =

Ω

G

(

x, t

;

ξ,

0) [

v

w

](

ξ,

0) d

ξ

+

t

0

Ω

G

(

x, t

;

ξ, s

) [

M

v

− M

w

](

ξ, s

) d

ξ

d

s

(2.1)

with the help of the Green’s function

G

that we now define. For fixed (

x, t

)

Q

, the

Green’s function

G

(

x, t

;

ξ, s

) =: Γ(

ξ, s

) solves the adjoint terminal-value problem

[

s

− L

+

a

(

ξ, s

) ] Γ(

ξ, s

) = 0

for (

ξ, s

)

Ω

×

[0

, t

)

,

(2.2a)

Γ(

ξ, t

) =

δ

(

ξ

x

) for

ξ

Ω

,

(2.2b)

Γ(

ξ, s

) = 0

for (

ξ, s

)

Ω

×

[0

, t

]

.

(2.2c)

Here

δ

(

·

) is the Dirac

δ

-distribution in

R

n

[13], and

L

is the adjoint operator to the

linear operator

L

.

The analysis in this paper will be carried out under the following condition.

Condition 2.1.

There are constants

κ

0

, κ

1

>

0

and

κ

2

0

such that the Green’s

function

G

of

(2.2)

,

(1.2)

satisfies

G

(

x, t

;

·

, s

)

1,Ω

κ

0

e

−γ2(t−s)

,

tτ

0

s

G

(

x, t

;

·

, s

)

1,Ω

d

s

κ

1

(

τ, t

) +

κ

2

,

where

x

Ω

,

τ

(0

, t

]

,

t

(0

, T

]

, and

(

τ, t

) :=

τt

s

−1

e

12γ2s

d

s

ln(

t/τ

)

.

Note that our model problem satisfies this condition as follows.

Lemma 2.2.

Let

ε

(0

,

1]

and

γ

0

. Under assumption

(1.2)

, the model

problem

(1.3)

satisfies Condition

2.1

with

κ

0

:= 1

,

κ

1

:=

2n/3n2+1

, and an

ε

-independent

constant

κ

2

0

. If

f

(

x, t, z

) =

a

(

x

)

z

+

b

(

x, t

)

, then

κ

2

= 0

. In general,

κ

2

=

γ

2

γ

2

) ˆ

κ

2

, where

κ

ˆ

2

= ˆ

κ

2

(

γ

)

if

γ >

0

and

κ

ˆ

2

= ˆ

κ

2

(

T

)

if

γ

= 0

.

1

Proof

. We defer the proof to section 12.

Condition 2.1 will be employed by means of the following lemma, which plays a

crucial role in our analysis. The lemma is formulated in the context of an arbitrary

nonuniform mesh in the time direction

(2.3)

0 =

t

0

< t

1

< t

2

<

· · ·

< t

M

=

T

with

τ

j

=

t

j

t

j−1

for

j

= 1

, . . . , M.

Lemma 2.3.

Suppose the parabolic operator

M

of

(1.1)

satisfies

(1.2)

and

Con-dition

2.1

, and

v, w

are bounded in

Ω

¯

×

[0

, T

]

. Furthermore, let

v

(

·

, t

)

, w

(

·

, t

)

H

01

(Ω)

C

( ¯

Ω)

for

t

[0

, T

]

, and

1The constants κ

0 and κ1 given by Lemma 2.2 are reasonably sharp. For example, for the constant-coefficient version ∂tu ε22xu + γ2u = b(x, t) of (1.3) in the spa-tial domain Ω :=R, a calculation [16] yields G(x, t;·, s)1,Ω= e−γ

2(ts)

and ∂sG(x, t;·, s)1,Ω

2 (πe)−1(t−s)−1+γ2e−γ2(t−s), so Condition 2.1 is satisfied withκ 0= 1 (as in Lemma 2.2),κ1=

2 (πe)−1≈0.48,κ2= 1, while Lemma 2.2 givesκ1= 3·2−3/21.06.

(4)

(2.4)

M

v

− M

w

=

t

μ

+

ϑ

in

Q,

where the function

μ

is continuous and bounded on

[

t

0

, t

1

]

and each

(

t

j−1

, t

j

]

, while

t

μ

is continuous and bounded on

(

t

m−1

, t

m

]

for some

1

m

M

, and

ϑ

(

·

, s

)

,Ω

is integrable w.r.t.

s

in

(0

, t

m

)

(possibly, in the sense of distributions). Then

[

v

w

](

·

, t

m

)

∞,Ω

κ

0

e

−γ2tm

[

v

w

μ

](

·

,

0)

∞,Ω

+ (

κ

1

m

+

κ

2

)

sup

s∈[0,tm−1]

μ

(

·

, s

)

,Ω

+

κ

0

lim

s→t+m−1

μ

(

·

, s

)

,Ω

+

κ

0

τ

m

sup

s∈(tm−1,tm]

s

μ

(

·

, s

)

,Ω

+

κ

0

tm

0

e

−γ2(tm−s)

ϑ

(

·

, s

)

∞,Ω

d

s,

(2.5)

where

m

=

m

(

γ

) :=

τtm m

s

−1

e

1

2γ2s

d

s

ln(

t

m

m

)

.

Remark

2.4.

The term

t

μ

in the right-hand side of (2.4) is understood in the

sense of distributions.

A typical

μ

is continuously differentiable in time on each

(

t

j−1

, t

j

] and has jumps at

t

∈ {

t

j

}

mj=1−1

, but our left-continuity convention allows us

to avoid ambiguity when integrating by parts. It may help the reader to consider

an equivalent interpretation of such evaluations. For some small positive

λ

, one can

replace

t

+j

by

t

j

+

λ

and

μ

by

μ

λ

such that

μ

λ

=

μ

for

t

[

t

j−1

+

λ, t

j

], and it

is continuous and linear in time on each [

t

j

, t

j

+

λ

]. Then one deals with a regular

function

t

μ

λ

, while the final result is obtained by taking the limit as

λ

0

+

.

Similarly, in all calculations involving Γ, one can initially replace it by a regular

function Γ

λ

obtained using a regular approximation

δ

λ

of

δ

in (2.2b), and then let

λ

0

+

. With regard to the regularity of Γ, Condition 2.1 implies for any

τ

(0

, t

)

that

s

Γ

L

1

×

[0

, t

τ

]), while an inspection of the proof of Lemma 2.2 yields a

stronger regularity with

s

Γ

L

2

×

[0

, t

τ

]).

Remark

2.5.

One can easily check that if

γ

= 0, then

m

= ln(

t

m

m

). Otherwise,

if

γ >

0, one has

m

(

γ

) =

E

1

(

12

γ

2

τ

m

)

E

1

(

12

γ

2

t

m

), where

E

1

(

t

) =

t

s

−1

e

−s

d

s

; so

m

(

γ

)

≤ |

ln(

12

γ

2

τ

m

)

|

provided that

12

γ

2

τ

m

0

.

67. (This is easily checked by finding

the only root

0

.

67 of the equation

E

1

(

s

) =

|

ln

s

|

on (0

,

1).) Note also that

1

= 0

for any

γ

0.

Proof of Lemma

2.3

.

Combining representation (2.1) with the notation Γ(

ξ, s

) :=

G

(

x, t

m

;

ξ, s

) for the Green’s function of (2.2), one gets

[

v

w

](

x, t

m

) =

[

v

w

](

·

,

0)

,

Γ(

·

,

0)

+

tm

0

[

M

v

− M

w

](

·

, s

)

,

Γ(

·

, s

)

d

s.

Here, in view of (2.4), the integral on the right-hand side involves

μ

and

ϑ

and so can

be represented as a sum

J

μ

+

J

ϑ

of the corresponding integrals, which we consider

separately. We use the notation

b+

:= lim

β→0+

b+β

and so split

J

μ

as

J

μ

=

J

μ(1)

+

J

μ(2)

:=

t+

m−1

0

s

μ,

Γ(

·

, s

)

d

s

+

tm

t+m−1

s

μ,

Γ(

·

, s

)

d

s.

Here, for

J

μ(1)

, an integration by parts yields

J

μ(1)

=

μ

(

·

, t

+m−1

)

,

Γ(

·

, t

m−1

)

μ

(

·

,

0)

,

Γ(

·

,

0)

tm−1

0

μ

(

·

, s

)

, ∂

s

Γ(

·

, s

)

d

s.

(5)

1498

NATALIA KOPTEVA AND TORSTEN LINSS

Consequently, we arrive at

[

v

w

](

x, t

m

) =

[

v

w

μ

](

·

,

0)

,

Γ(

·

,

0)

tm−1

0

μ

(

·

, s

)

, ∂

s

Γ(

·

, s

)

d

s

+

μ

(

·

, t

+m−1

)

,

Γ(

·

, t

m−1

)

+

tm

t+m−1

s

μ,

Γ(

·

, s

)

d

s

+

tm

0

ϑ

(

·

, s

)

,

Γ(

·

, s

)

d

s,

(2.6)

where the last term represents

J

ϑ

. Finally, Condition 2.1 implies that

Γ(

·

, s

)

1,Ω

κ

0

e

−γ2(tm−s)

κ

0

,

tm−1

0

s

Γ(

·

, s

)

1,Ω

d

s

κ

1

m

+

κ

2

,

so we get the desired result.

The following version of Lemma 2.3 involves certain approximations Γ

jh

of Γ(

·

, t

j

).

Lemma 2.3

.

Under conditions of Lemma

2.3

, suppose that instead of

(2.4)

one

has

M

v

− M

w

=

t

μ

+

ϑ

+

ϑ

, where

ϑ

(

·

, t

) =

mj=1−1

ϑ

j

δ

(

t

t

j

)

for

t

[0

, t

m

]

. If

there exist some functions

{

Γ

jh

}

mj=1−1

such that

ϑ

j

,

Γ

jh

= 0

for

j

= 1

, . . . , m

1

, and

m−1

j=1

τ

j

H

j−2

{

Γ(

·

, t

j

)

Γ

hj

}

1,Ω

κ

3

(

τ, t

)

for some positive weight functions

{H

j

}

and some constant

κ

3

, then the statement of Lemma

2.3

remains valid, only with an

additional term

κ

3

(

τ, t

) max

j=1,...,m−1

τ

j−1

H

2j

ϑ

j

∞,Ω

in the final line of

(2.5)

.

Proof

. Imitate the proof of Lemma 2.3, and note that now we have (2.6) with an

additional term

mj=1−1

ϑ

j

,

Γ(

·

, t

j

)

=

jm=1−1

ϑ

j

,

Γ(

·

, t

j

)

Γ

jh

.

3. Summary of results for semidiscrete methods (no spatial

discretiza-tion).

In this section we describe our results for the abstract parabolic problem (1.1)

discretized in time on an arbitrary nonuniform mesh (2.3) using semidiscrete backward

Euler, Crank–Nicolson, and discontinuous Galerkin methods.

Let

u

solve problem (1.1) with the parabolic operator

M

satisfying (1.2) and let

Condition 2.1, and let

U

j

H

1

0

(Ω)

C

( ¯

Ω), associated with the time level

t

j

, solve a

corresponding semidiscrete problem with

U

0

=

ϕ

. Then, for

m

= 1

, . . . , M

, we give

a

posteriori error estimates

of the type

U

m

u

(

·

, t

m

)

,Ω

C

1

(

κ

1

m

+

κ

2

)

j=1

max

,...,m−1

χ

j

∞,Ω

+

C

2

κ

0

χ

m

∞,Ω

+

κ

0

m

j=1

tj

tj−1

e

−γ2(tm−s)

ϑ

(

·

, s

)

∞,Ω

d

s .

(3.1)

The quantities that appear in this estimate are specified by Theorems 4.1 and 5.1

and Corollary 6.3 below, and can be summarized as follows:

p

χ

j+1

ϑ

C

1

C

2

Backward Euler 1

U

j+1

U

j

ψ

˜

ψ

j

on (

t

j−1

, t

j

]

1

2

Crank–Nicolson 2

τ

j+1

(

ψ

j+1

ψ

j

)

ψ

˜

I

1,t

ψ

˜

18 12

dG(1)-Radau 3

3

τ

j+1

(2

ψ

j

3

ψ

j+1/3

+

ψ

j+1

)

ψ

˜

I

2,t

ψ

˜

812 16

Here for the evaluation of

χ

j+1

and

ϑ

we use

ψ

j+α

:=

L

(

t

j+α

)

U

j+α

+

f

(

·

, t

j+α

, U

j+α

)

,

ψ

˜

:=

L

(

t

) ˜

U

+

f

(

·

, t,

U

˜

)

,

(3.2)

(6)

where

α

(0

,

1] is any value for which the approximate solution

U

j+α

at time

t

j+α

:=

t

j

+

ατ

j+1

is available from the definition of the semidiscrete method. Also, ˜

U

is

a piecewise-polynomial interpolant of the computed solution of degree

p

1, while

I

p−1,t

ψ

˜

is a piecewise-polynomial interpolant of ˜

ψ

of the same degree using the same

interpolation points.

Remark

3.1 (

interpolation-type estimates

).

The quantity

|

χ

j

|

in (3.1)

approxi-mates

τ

jp

|

tp

u

(

·

, t

j

)

|

. This immediately follows from

χ

j

=

U

j

U

j−1

for the backward

Euler method. For the Crank–Nicolson and dG(1) methods, note that

ψ

j+α

approxi-mates

L

u

+

f

(

·

, t, u

) at

t

=

t

j+α

, so

χ

j

approximates

τ

p j

|

p−1

t

(

L

u

+

f

(

·

, t, u

))

|

(in fact,

χ

j

=

τ

p

j

tp−1

(

I

p−1,t

ψ

˜

)), while (1.1) gives

|

tp−1

(

L

u

+

f

(

·

, t, u

))

|

=

|

tp

u

|

.

Remark

3.2 (

p

th-order estimates

).

Remark 3.1 and the definitions of

ϑ

for the

backward Euler, Crank–Nicolson, and dG(1) methods imply that (3.1) gives an a

pos-teriori error estimate of order

p

with

p

= 1

,

2, and 3, respectively.

4. Semidiscrete backward Euler method (no spatial discretization).

Consider an arbitrary nonuniform mesh (2.3) in the time direction and discretize

the abstract parabolic problem (1.1) in time using the first-order backward Euler

method as follows. We associate an approximate solution

U

j

H

01

(Ω)

C

( ¯

Ω) with

the time level

t

j

and require it to satisfy

δ

t

U

j

+

L

j

U

j

+

f

j

= 0

in Ω

,

j

= 1

, . . . , M,

U

0

=

ϕ,

(4.1a)

where

δ

t

U

j

:=

U

j

U

j−1

τ

j

,

L

j

:=

L

(

t

j

)

,

and

f

j

:=

f

(

·

, t

j

, U

j

)

.

(4.1b)

For this discretization, we give the following a posteriori error estimate.

Theorem 4.1.

Let

u

solve problem

(1.1)

with the parabolic operator

M

satisfying

(1.2)

and Condition

2.1

and

U

j

solve the corresponding semidiscrete problem

(4.1)

.

Then, for

m

= 1

, . . . , M

, one has

(3.1)

with

χ

j

=

U

j

U

j−1

,

C

1

= 1

,

C

2

= 2

, and

ϑ

defined by

ϑ

(

·

, t

) = ˜

ψ

(

·

, t

)

ψ

˜

(

·

, t

j

)

,

ψ

˜

(

·

, t

) =

L

(

t

)

U

j

+

f

(

·

, t, U

j

)

for

t

(

t

j−1

, t

j

]

.

(4.2)

Proof

. Let

I

1,t

U

be the standard piecewise-linear interpolant of

U

j

in time:

(4.3)

I

1,t

U

(

·

, t

) :=

tjτ−t j

U

j−1

+

t−tj−1

τj

U

j

for

t

[

t

j−1

, t

j

]

,

j

= 1

, . . . , M.

Furthermore, we define a

piecewise-constant

interpolant ˜

U

of

U

j

by

(4.4)

U

˜

(

·

, t

) :=

U

j

for

t

(

t

j−1

, t

j

]

,

j

= 1

. . . , M,

U

˜

(

·

,

0) :=

U

1

(so ˜

U

is continuous on [

t

0

, t

1

]). Note that the temporal derivative

t

U

˜

is understood

as a distribution, while

t

(

I

1,t

U

) is a regular function, equal to

δ

t

U

j

for

t

(

t

j−1

, t

j

]

(in agreement with our left-continuity convention). Consequently, (4.1a) implies that

(4.5)

t

(

I

1,t

U

) + ˜

ψ

=

ϑ

for (

x, t

)

Q.

Here we also used the observation that by (4.4), the regular function

ϑ

of (4.2) can

be rewritten as

ϑ

= ˜

ψ

[

L

j

U

j

+

f

j

] for

t

(

t

j−1

, t

j

].

As

M

U

˜

=

t

U

˜

+ ˜

ψ

and

M

u

= 0, so (4.5) implies that

M

U

˜

− M

u

=

t

[ ˜

U

I

1,t

U

] +

ϑ

in

Q.

(7)

1500

NATALIA KOPTEVA AND TORSTEN LINSS

Now the desired bound for

U

m

u

(

·

, t

m

) = [ ˜

U

u

](

·

, t

m

) is obtained by an application

of Lemma 2.3 with

μ

:= ˜

U

I

1,t

U

and

ϑ

of (4.2), using the following two observations.

First, we note that [ ˜

U

u

μ

](

·

,

0) =

U

1

ϕ

(

U

1

ϕ

) = 0. Second, for

t

(

t

j−1

, t

j

],

one has

μ

=

tjτ−t j

(

U

j

U

j−1

) =

tj−t τj

χ

j

=

|

μ

| ≤

χ

j

,

τ

j

|

t

μ

|

=

χ

j

.

This completes the proof.

Corollary 4.2.

Under assumption

(1.2)

, the a posteriori error estimate of

Theorem

4.1

applies to the model problem

(1.3)

with

ϑ

=

f

(

·

, t, U

j

)

f

(

·

, t

j

, U

j

)

and

the constants

κ

0

,

κ

1

,

κ

2

from Lemma

2.2

.

5. Semidiscrete Crank–Nicolson method (no spatial discretization).

Con-sider an arbitrary nonuniform mesh (2.3) in the time direction and discretize the

ab-stract parabolic problem (1.1) in time using the second-order Crank–Nicolson method

as follows. We associate an approximate solution

U

j

H

1

0

(Ω)

C

( ¯

Ω) with the time

level

t

j

and require it to satisfy

(5.1a)

δ

t

U

j

+

12

L

j−1

U

j−1

+

L

j

U

j

+

12

(

f

j−1

+

f

j

) = 0

in Ω

,

j

= 1

, . . . , M,

where we again let

(5.1b)

U

0

=

ϕ,

δ

t

U

j

:=

U

j

U

j−1

τ

j

,

L

j

:=

L

(

t

j

)

,

and

f

j

:=

f

(

·

, t

j

, U

j

)

.

To give an a posteriori error estimate for this discretization, we will use the

stan-dard piecewise linear interpolation

I

1,t

, which, for any continuous function

w

=

w

(

t

),

is defined by

(5.2)

I

1,t

w

(

t

) :=

tjτ−t

j

w

(

t

j−1

) +

t−tj−1

τj

w

(

t

j

)

for

t

[

t

j−1

, t

j

]

,

j

= 1

, . . . , M.

Recall an almost identical definition (4.3) for the

piecewise-linear

interpolant

I

1,t

U

of

the computed solution; the latter plays a crucial role in our analysis of this section.

Theorem 5.1.

Let

u

solve the problem

(1.1)

with the parabolic operator

M

satisfying

(1.2)

and Condition

2.1

, and let

U

j

solve the corresponding semidiscrete

problem

(5.1)

. Then for

m

= 1

, . . . , M

, one has

(3.1)

with

χ

j

=

τ

j

ψ

j

ψ

j−1

using

ψ

j

=

L

j

U

j

+

f

j

,

C

1

=

1

8

,

C

2

=

12

, and

ϑ

defined by

ϑ

= ˜

ψ

I

1,t

ψ,

˜

ψ

˜

=

L

(

t

) ˜

U

+

f

(

·

, t,

U

˜

)

,

U

˜

(

·

, t

) =

I

1,t

U

(

·

, t

)

(5.3)

for

t

[0

, T

]

, where we use

I

1,t

U

(

·

, t

)

of

(4.3)

and

I

1,t

of

(5.2)

.

Proof

. Let

t

[

t

j−1

, t

j

]. First, note that ˜

ψ

=

I

1,t

ψ

˜

+

ϑ

=

12

ψ

j−1

+

ψ

j

+

t

μ

+

ϑ

,

where

μ

:=

tt

j

I

1,t

ψ

˜

12

ψ

j−1

+

ψ

j

d

t

, so

(5.4)

μ

=

τ

j−1

χ

j

t

tj

(

t

t

j−1/2

) d

t

=

12

(

t

j

t

)(

t

t

j−1

)

·

τ

j−2

χ

j

for

t

[

t

j−1

, t

j

]

.

Next, note that ˜

U

(

·

, t

) =

I

1,t

U

(

·

, t

) implies that

t

U

˜

=

δ

t

U

j

=

1

2

(

ψ

j−1

+

ψ

j

) for

t

(

t

j−1

, t

j

] (where we also invoked (5.1a)). Combining these two observations, one

deduces that

t

U

˜

+ ˜

ψ

=

t

μ

+

ϑ

. As

M

U

˜

=

t

U

˜

+ ˜

ψ

and

M

u

= 0, so

(5.5)

M

U

˜

− M

u

=

t

μ

+

ϑ

in

Q.

(8)

Both sides in this relation are regular functions; it is valid for

t

(0

, T

] as

μ

of (5.4)

is continuous for

t

[0

, T

].

Now the desired bound for

U

m

u

(

·

, t

m

) = [ ˜

U

u

](

·

, t

m

) is obtained by an

application of Lemma 2.3 to (5.5) with

μ

given by (5.4) and

ϑ

by (5.3), using the

following two observations. First, note that [ ˜

U

u

μ

](

·

,

0) =

U

0

ϕ

0 = 0.

Second, for

t

(

t

j−1

, t

j

], one has

(5.6)

|

μ

| ≤

18

|

χ

j

|

and

τ

j

|

t

μ

| ≤

12

|

χ

j

|

,

while

μ

(

·

, t

+m−1

) = 0. This completes the proof.

Corollary 5.2.

Under assumption

(1.2)

, the a posteriori error estimate of

Theorem

5.1

applies to the model problem

(1.3)

with

ϑ

=

f

(

·

, t, I

1,t

U

)

I

1,t

[

f

(

·

, t, I

t

U

)]

and the constants

κ

0

,

κ

1

,

κ

2

from Lemma

2.2

.

Remark

5.3.

The a posteriori error estimate given by Theorem 5.1 resembles

(but is not identical to) error estimates of [1]. Our analysis of the semidiscrete Crank–

Nicolson method seems more straightforward as we work with the standard piecewise

linear interpolant of the computed solution, while the analysis in [1] involves a

con-struction of a certain piecewise-quadratic polynomial of the computed solution in

time. Furthermore, in section 10, we derive a posteriori error estimates for fully

discrete Crank–Nicolson methods, which were not considered in [1].

6. Semidiscrete discontinuous Galerkin method dG(r) with Radau

quadrature (no spatial discretization).

Consider an arbitrary nonuniform mesh

(2.3) in the time direction and discretize the abstract parabolic problem (1.1) in time

using the discontinuous Galerkin method dG(

r

) (described, e.g., in [10, 27]) as follows.

First, introduce the Radau points

A

R

:=

{

α

k

: 0

< α

0

< α

1

<

· · ·

< α

r

= 1

}

(e.g.,

r

= 1 corresponds to

A

R

=

{

13

,

1

}

). We shall also use the augmented set

A

:=

{

0

} ∪ A

R

of

r

+ 2 points. Next, on [0

,

1] introduce the basis

{

φ

k

(

s

)

}

rk=0

for

polynomials of degree

r

with the property

ϕ

k

(

α

l

) =

δ

k l

and the polynomial

ζ

r+1

of

degree

r

+ 1 such that

ζ

r+1

(0) = 1

,

ζ

r+1

(

α

k

) = 0

for

k

= 0

, . . . , r,

C

ζ

:=

dr+1

dsr+1

ζ

r+1

(

s

)

.

(6.1)

Also define the two interpolants on (

t

j

, t

j+1

]: ˆ

I

r,t

φ

Π

r

with

I

ˆ

r,t

φ

(

t

j+α

) =

φ

(

t

j+α

)

for

α

∈ A

R

and

I

r+1,t

φ

Π

r+1

with

I

r+1,t

φ

(

t

j+α

) =

φ

(

t

j+α

) for

α

∈ A

.

Let

U

0

:=

ϕ

. Given an approximate solution

U

j

H

01

(Ω)

C

( ¯

Ω) associated

with the time level

t

j

, we require approximate solutions

U

j+αk

H

1

0

(Ω)

C

( ¯

Ω), for

k

= 0

, . . . , r

, respectively associated with the time levels

t

j+αk

, to satisfy

U

(

·

, t

+j

)

U

j

ϕ

k

(0) +

tj+1

t+j

t

U

+ ˆ

I

r,t

ψ

ϕ

k

t−tj

τj+1

d

t

= 0

for

k

= 0

, . . . , r,

(6.2a)

where

U

:=

r

k=0

U

j+αk

ϕ

k

(

τt−j+1tj

)

,

ψ

:=

L

(

t

)

U

+

f

(

·

, t, U

) for

t

(

t

j

, t

j+1

]

.

(6.2b)

Note that (6.2) represents the dG(

r

) method with Radau quadrature, exact for

poly-nomials of degree 2

r

, while if the term ˆ

I

r,t

ψ

is replaced by

ψ

, then we get the dG(

r

)

method without quadrature.

Next, an application of

I

r+1,t

to the approximate solutions

{

U

j+α

, α

∈ A}

gen-erates ˜

U

and the related function ˜

ψ

:

˜

U

:=

U

U

(

·

, t

+j

)

U

j

ζ

r+1

(

tτ−tj j+1

)

,

˜

ψ

=

L

(

t

) ˜

U

+

f

(

·

, t,

U

˜

)

.

(6.3)

References

Related documents