A Relaxation/Finite Difference discretization of a 2D Semilinear Heat Equation over a rectangular domain

06/24/2020 ∙ by Georgios E. Zouraris, et al. ∙ University of Crete 0

We consider an initial and Dirichlet boundary value problem for a semilinear, two dimensional heat equation over a rectangular domain. The problem is discretized in time by a version of the Relaxation Scheme proposed by C. Besse (C. R. Acad. Sci. Paris Sér. I, vol. 326 (1998)) for the nonlinear Schrödinger equation and in space by a standard second order finite difference method. The proposed method is unconditionally well-posed and its convergence is established by proving an optimal second order error estimate allowing a mild mesh condition to hold.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1. Introduction

1.1. Formulation of the problem

Let , with and , , and be the solution of the following initial and boundary value problem:

(1.1)
(1.2)
(1.3)

where with , and with

(1.4)

1.2. Formulation of the numerical method

Let be the set of all positive integers. For a given , we define a uniform partition of the time interval with time-step , nodes for , and intermediate nodes for . Also, for given , we consider a uniform partition of with mesh-width and nodes for , and a uniform partition of with mesh-width and nodes for . Also, we set , , , and introduce the discrete space

and a discrete Laplacian operator by

In addition, we introduce an operator , which, for given , is defined by for all . Finally, for any , we define by for all .

The Relaxation Finite Difference (RFD) method uses a standard finite difference scheme for space discretization along with a variant of the Relaxation Scheme for time stepping (cf. [2]).

Step 1: First, set

(1.5)

and find such that

(1.6)

Step 2: Set

(1.7)

and find such that

(1.8)

Step 3: For , first set

(1.9)

and then find such that

(1.10)

1.3. References and main results

The Relaxation Scheme (RS) has been introduced by C. Besse [2] as a linearly implicit, conservative, time stepping method for the approximation of the solution to the nonlinear Schrödinger equation. Convergence results has been obtained in [3] and [4] for the (RS) time-discrete approximations of the Cauchy problem for the nonlinear Schrödinger equation, which can not be concluded in the fully-discrete case, because on the one hand they are valid for small final time , and on the other hand are based on the derivation of a priori bounds (with ) for the time discrete approximations. Recently, in [7], the (RS) joined with a finite difference scheme is proposed for the approximation of the solution to a semilinear heat equation in the 1D case, and the corresponding error analysis arrived at optimal second order error estimates. Here, we investigate the extension of the results obtained in [7] in the 2D case. We would like to stress that a fylly-discrete version of the (RS) applied on a parabolic problem can be analyzed by using energy estimates, which, however, are not efficient in the case of the nonlinear Schrödinger equation (see [8]).

To develop an error analysis for the (RFD) method, we introduce the modified scheme (see Section 3.2) that follows from the (RFD) method after mollifying properly the terms with nonlinear structure (cf. [1], [5], [6]). For the approximations obtained from the modified scheme, we provide an optimal, second order error estimate in the discrete norm at the nodes and in the discrete norm at the intermediate nodes (see Theorem 3.1). After applying an inverse inequality (see (2.3)) and imposing a proper mesh condition (see (3.31)), the latter convergence result implies that the discrete norm of the modified approximations is uniformly bounded, and thus they are the same with those derived by the (RFD) method and hence inherit their convergence properties o (see Theorem 3.2), i.e. that there exist constant , independent of , , , such that

where is a discrete norm and is a discrete norm.

2. Preliminaries

2.1. Discrete relations

We provide with the discrete inner product given by

and we shall denote by its induced norm, i.e. for . Also, we equip with a discrete -norm defined by for , and with a discrete -type norm given by

In the convergence analysis of the method, we will make use of the following, easy to verify, relation

(2.1)

of the discrete Poincaré-Friedrishs inequality

(2.2)

of the inverse inequality

Lemma 2.1.

For it holds that

(2.3)

with .

Proof.

Let and such that . Since , we conclude (see [7]) that

(2.4)

and

(2.5)

From (2.4) and (2.5), we conclude that

which, easily, yields (2.3). ∎

and of the following Lipschitz-type inequality:

Lemma 2.2.

Let with . Then, for , it holds that

(2.6)
Proof.

It is similar to the proof of (2.9) in Lemma 2.3 in [7]. ∎

2.2. Consistency Errors

To simplify the notation, we set for , and for .

2.2.1. Consistency error in time

For , let be defined by

(2.7)

Then, setting and expanding, by using the Taylor formula around , we obtain:

which, easily, yields

(2.8)

Let be defined by

(2.9)

and, for , let be specified by

(2.10)

Using (1.1), from (2.9) and (2.10), we obtain

(2.11)

where

and

Applying the Taylor formula we obtain

(2.12)

and

(2.13)

Thus, from (2.11), (2.13) and (2.12), we arrive at

(2.14)

2.2.2. Consistency error in space

Also, let be defined by

(2.15)

and, for , let be given by

(2.16)

Subtracting (2.15) from (2.9) and (2.16) from (2.10), we obtain

(2.17)

For , we use of the Taylor formula with respect to the space variables around to get

which, along with (2.17), yields

(2.18)

3. Convergence Analysis

3.1. A mollifier

For , let (cf. [1], [5], [6]

) be an odd fuction defined by

(3.1)

where is the unique polynomial of that satisfies the following conditions:

3.2. The modified scheme

For given , the modified version of the (RFD) method (cf. [1], [5], [6]), derives approximations of the solution as follows:

Step M1: First, we set

(3.2)

Step M2: Set

(3.3)

and find such that

(3.4)

Step M3: For , first define by

(3.5)

and, then, find such that

(3.6)

3.3. Convergence of the modified scheme

Theorem 3.1.

Let and . Then, there exist positive constants , and , independent of and , such that: if , then

(3.7)

and

(3.8)
Proof.

To simplify the notation, we set for , and for . In the sequel, we will use the symbol to denote a generic constant that is independent of , and , and may changes value from one line to the other. Also, we will use the symbol to denote a generic constant that depends on but is independent of , , and may changes value from one line to the other.

Since , after subtracting (1.6) and (1.8) from (2.15) and (2.16) (with ), respectively, we obtain

(3.9)
(3.10)

Taking the inner product of (3.9) with , and then using (2.1), the Cauchy-Schwarz inequality, (2.14), (2.18) and the arithmetic mean inequality, we get