the immersed interface method for elliptic and parabolic...

American Journal of Numerical Analysis, 2014, Vol. 2, No. 5, 152-166 Available online at http://pubs.sciepub.com/ajna/2/5/3 © Science and Education Publishing DOI:10.12691/ajna-2-5-3

The Immersed Interface Method for Elliptic and Parabolic Problems with Discontinuous Coefficients

Noufe Aljahdaly*

Department of Mathematics King Abduall-Aziz University *Corresponding author: [email protected]

Received August 28, 2014; Revised November 12, 2014; Accepted November 17, 2014

Abstract In this paper we consider numerical methods for solving elliptic as well as time dependent advection- diffusion-reaction (ADR) equations in one spatial dimension. We consider the case in which the difference diffusion coefficients as well as advection coefficients and reaction coefficients are discontinuous across a fixed interface. Using the immersed interface method (IIM) for finite difference approximations, we demonstrate how to modify numerical methods constructed for the constant coefficient case around interfaces of discontinuity of the diffusion, advection, and reaction coefficient.

Keywords: advection, diffusion, reaction, immersed interface

Cite This Article: Noufe Aljahdaly, “The Immersed Interface Method for Elliptic and Parabolic Problems with Discontinuous Coefficients.” American Journal of Numerical Analysis, vol. 2, no. 5 (2014): 152-166. doi: 10.12691/ajna-2-5-3.

1. Introduction In this paper we consider numerical methods for

solving elliptic and parabolic advection-diffusion-reaction (ADR) equations in one spatial dimension. We study the case in which the diffusion coefficient, advection coefficient, reaction coefficient and some terms are discontinuous across an interface. First, we consider a one-dimensional elliptic interface problem. Using the immersed interface method (IIM) [1] for finite difference approximations, then we demonstrate how to modify numerical methods constructed for homogeneous elliptic problems in the case in which the diffusion coefficient, advection coefficient, and reaction coefficient are discontinuous across the interface along with discontinuous sources. Next, we consider a parabolic problem in which the diffusion coefficient, advection coefficient, and reaction coefficient are discontinuous across the interface [3].

If numerical schemes that are used in case of the homogeneous diffusion, advection, and reaction coefficients are not modified around interfaces representing a discontinuity in the diffusion, advection, and reaction coefficients, the schemes lose their optimal order of accuracy. The IIM is a method that uses the undetermined coefficient method and correction terms to account for interfaces of discontinuity in the parameters of the partial differential equations (PDEs) which improves the accuracy of the schemes [4].

In section 2, we give an overview of the IIM. In section 3, we consider an elliptic interface problem with discontinuous diffusion, advection, and reaction coefficient. In this case, we modify a centered difference scheme at points near the interface (irregular points) by

adding a correction term. The coefficients of the difference scheme are obtained using the undetermined coefficients method. The centered difference scheme is second order accurate, but it loses the optimal order at irregular points where it is first order accurate.

In section 4, we consider a parabolic interface problem. We show how to modify a scheme which is centered difference in space and Crank-Nicolson in time to obtain a second order scheme in time and space.

2. Numerical Methods for Interface Problems

We consider one dimensional advection diffusion reaction equations (elliptic and time independent problems) with discontinuities in the coefficients. Discontinuities in the solutions of these PDEs occur when, for example, when there are different materials that are separated by sharp interfaces. Across such interfaces there can be sharp discontinuities in the diffusion coefficient as well as the advection and reaction terms.

By an interface problem, we mean an initial boundary value problem in which the following conditions are satisfied [4]. • There can be one or several fixed interfaces in the

solution domain. • The diffusion coefficients as well as advection

velocity and/or reaction terms could be discontinuous across these fixed interfaces.

• The source term may have a finite jump along interfaces.

• The solution to an interface problem may be discontinuous, or its gradient derivative is discontinuous across the interface.

153 American Journal of Numerical Analysis

• We have some prior knowledge of the jump conditions or interface conditions of the solution and ux across interfaces.

Numerical methods constructed for initial boundary value problems involving constant coefficients work poorly when applied without modification to problems with interfaces. There are several different techniques available in the literature to construct numerical methods for interface problems. Here, we present a technique called the Immersed Interface Method (IIM), which is a technique that modifies standard numerical methods for problems without interfaces to capture the discontinuities in the solution and ux. As outlined in [4], a method is called an IIM if it satisfies the following properties:

1. Uniform Grids: The is method uses a uniform grid in Cartesian, polar or spherical geometries instead of a body fitted grid as in the finite element method.

2. Jump Conditions: The interior boundary conditions at interfaces which are known from the PDEs are the jump conditions or interface conditions. More interface relations can be derived from given jump conditions.

3. Standard Schemes at Regular Points: Standard numerical methods are used to discretize the scheme at grid points that are far away from the interface (regular points), but the numerical methods are modified by correction terms at the points near the interface (irregular points). We obtain these correction terms for modifying the standard numerical schemes through the derivation of the truncation error at each irregular point using the given jump conditions.

4. Pointwise Convergence: We will be concerned with the pointwise convergence of the resulting immersed interface methods through the computation of the L1 error instead of the average L1 or L2 error. This is because, the L1 error will take into account the error near the interface, i.e. at the irregular points. The IIM generally has the same global order of accuracy as when the method is applied to regular problems without interfaces of discontinuity. However, the local truncation error may have a lower order of accuracy at irregular grid points than at regular grid points.

We will first consider an elliptic interface problem and then consider the time dependent case (parabolic problem).

3. Elliptic Interface Problem We begin with a one-dimensional elliptic problem with

a discontinuity at x =ξ which falls between irregular points xj and xj+1 for some j ∈ N so that ξ ∈ [xj, xj+1] (see Figure 1). The elliptic interface problem that we consider here is finding the solution u = u(x) of the initial-boundary value problem in domain Ω = [a, b] such that:

( ) ( ) ( )( ) ( ) ( ) ,x x xu x x u x u x f x onα β σ= − + Ω (3.1a)

[ ] ( ) ( ) ( ) ,u u uξ ξ ξ ω ξ+ −= − = (3.1b)

[ ] ( ) ( )( )

( ) ( )( ) ( ) ,x xu u

u v

ξα β α β ξ ξ

α β ξ ξ ξ

+ + +

− − −

− = −

− − = (3.1c)

( ) ( ), ,a bu a u u b u= = (3.1d)

Figure 1. Diagram of ID-interface problem with one interface ξ

( ) [ ]( ]

, , ,

, , ,

x aa x

x b

α ξ

α ξ

−

+

∈= ∈

(3.1e)

( ) [ ]( ]

, , ,

, , ,

x ax

x b

σ ξσ

σ ξ

−

+

∈= ∈

(3.1f)

In the above equations, the coefficients β > 0,σ,α and the source term f are known a-priori. We assume that α and σ are piecewise constant throughout the domain and (3.1b) and (3.1c) are the interior boundary conditions or jump conditions at the fixed interface at x = ξ. For any function v, the notation ( ) ( ),: limx xv v xξξ+

→ ∈Ω= + and

( ) ( ),: limx xv v xξξ−→ ∈Ω= − . Boundary conditions

specifying the solution at the boundaries of are given in (3.1d). There is a jump at x = ξ in the coefficients β,α,σ and the source term f as well as the solution u. However, away from the interface β,α,σ and f are smooth.

Below we outline the procedure for constructing an IIM scheme for the interface problem (3.1).

Step 1: Construction of a Uniform Cartesian Grid We first construct an uniform Cartesian grid. The

discrete mesh h consists of grid points

( ): , 0,1,.... , .i

b ax a ih where i N h

N−

+ = =

Here h > 0 is the mesh step size. We also define half-

points 12

:2ii

hx x±

= ± . The conventional finite difference

schemes can be used on most grid points except at the irregular points. In Figure 1, xj and xj+1 are irregular points.

Step 2: Derivation of a Centered Finite Difference Scheme

Next, we derive the centered finite difference scheme for equation (3.1a). Since the solution is smooth away from the interface points, we use standard finite approximations at regular grid points.

Scheme at Regular Grid Points: Using a second order centered difference scheme to

discretize the spatial derivatives at regular points xi, we have

American Journal of Numerical Analysis 154

( ) ( )( ) ( )( ) ( ) ( ) ( )

( )

( ) ( ) ( )( )

( ) ( )( ) ( ) ( )( ) ( )

1 1 1 12 2 2 2 2

1 11 1

22 2

1 1 1 1 1 12 2 2 2 2

2

1 1 2

|

|2

x xi i i i

x xix

i i i ii i

i i ii i i i

i ix xi

u x u x

x u x O hh

u x u x u x u xh h

O hh

u x u x u x

O hh

u x u xx u x O h

h

β β

β

β β

β β β β

αα

+ + − −

+ −

+ −

+ −+ + − −

+ −

−

= +

− −−

= +

− + + = +

−= +

where 12

:2ii

hxβ β±

= ±

and 1 : .i ix x h± = ±

Thus, the fully discrete scheme at a regular grid point x = xi is:

12

1 1 1 112 221 1

22.

i

i i ii ii

i i

i i

u u u

u uh h

u f

β

β ββ

α α

σ

+

+ −+ −

−+ −

− + + − −

+ =

(3.2)

where ui ≈u(xi), and fi = f(xi). At regular grid points away from the interface, scheme

(3.2) is second order accurate in space. We define for 1 ≤ i ≤ N-1, i≠j, j + 1 the parameters:

12

1, 2 2

ii hh

βαγ

−−

= − (3.3a)

1 12 2

2, 2

i ii

h

β β

γ+ −

+

= (3.3b)

12

3, 2 2

ii hh

βαγ

+−

= + (3.3c)

with definition (3.3), scheme (3.2) the scheme can be written as: 1, 1 2, 3, 1 ,i i i i i i i iu u u u fγ γ γ σ− ++ + + = (3.4)

for 1 ≤ i ≤ N-1, i≠j, j + 1. Scheme at Irregular Grid Points: To determine the finite difference equations at irregular

grid points we use the method of undetermined coefficients [2]. To keep a unified notation, we assume that the scheme at the irregular points xj and xj+1 is of the form 1, 1 2, 3, 1j j j j j j j j ju u u u f Cγ γ γ σ− ++ + + = + (3.5a)

1, 1 2, 1 1

3, 1 2 1 1 1

j j j j

j j j j j

u u

u u f C

γ γ

γ σ+ + +

+ + + + +

+

+ + = + (3.5b)

where we add correction terms Cj, and Cj+1 on the right hand side of the equations in (3.5a) and (3.5b) respectively in order to let the scheme achieve the optimal order of accuracy at irregular points, xj and xj+1. The correction terms are obtained by constructing the Local Truncation Error (LTE) at the irregular points, using Taylor

expansions of the solutions in which the interior boundary conditions (3.1b) and (3.1c) are used. We will derive the coefficients , , 1, 2,3, , 1k k j jγ = = +

in the next step as well as the correction terms Cj and Cj+1.

Step 3: Solution of a Linear System We can write the scheme at all the grid points (regular

and irregular) in vector form as

AU F= where

[ ]1 1 1 1

1 1,1 2 1 1

2 1 3, 1

,..., , , ,..., ,

, ,..., , ,

...,...., ,

Ti i i N

Ta j j j j

N N N b

U u u u u u

f u f f C f CF

f f u

γ

γ

− + −

+ +

− − −

=

− + +=

−

and

2,1 3,1

1,2 2,2 3,2

1,3 2,3 3,3

1, -2 2, -2 3, -2

1, -1 2, -1

0 0 0

0 0

0 0 0

0 0 0 0 0

0 0 0

0 0 0 0N N N

N N

AM

γ σ γ

γ γ σ γ

γ γ σ γ

γ γ σ γ

γ γ σ

+

+

+=

+

+

is a tridiagonal matrix. The solution of this linear system gives us the approximate solution to the elliptic interface problem (3.1).

3.1. Derivation of Additional Jump Conditions

We compute the jump condition for [ ]xxu ξβ in order to

use it to derive the local truncation error as well as obtain the correction terms. Consider (3.1a) at interface x = ξ and substitute the interior boundary conditions. We note that the coefficients σ and α are constant and the source term f has a jump at the interface x = ξ. Thus,

[ ] [ ] [ ] ( ) ( )0, 0, .f f fξ ξ ξα σ ξ ξ+ −= = = −

By definition and from the jump conditions (3.1b), (3.1c) we have

[ ] ( ) ( ) ( ) ( )

( ) ( ) ( )( ) ( )

( ) ( ) ( )( ) ( )( )( ) ( ) ( ) ( ) ( )( ) ( ) ( ) ( )

( ) ( ) ( )

lim lim

.

x x

x x x

x x x

x x x xx

x x x

xx

f f f f x f x

u u u

u u u

u u u

u u u

u u

ξξ ξ

ξ ξ

α ξ β ξ ξ σ ξ

α ξ β ξ ξ σ ξ

α ξ β ξ ξ β ξ ξ

σ ξ α ξ β ξ ξ

β ξ ξ σ ξ

+ −+ −→ →

+ + + + +

− − − − −

+ + + + + +

+ + − − − −

− − − −

= − = −

= − +

− − +

= − −

+ − +

+ −

(3.6)

Substituting the jump conditions (3.1b) and (3.1c) in (3.6) we have

[ ] ( ) ( ) ( ) ( )

( )( ) ( ) ( ) ( )( )( )

xx xx xx

xx

u u u

v uf

ξ

ξ

β β ξ ξ β ξ ξ

α α ξ β ξ ξα β ξ

β ξ

+ + − −

+ − − −+ +

+

= −

− − + = − + −


( )( ) ( ) ( )

( ) ( )( )( )

( )( ) ( )

( ) ( )( )( )( )

[ ] [ ] ( ) ( )

x x

xx x

x

u

u

v

f uξ

α β ξ ξ σω ξ

α β ξ β ξα β ξ ξ

β ξ

α β ξ α α ξ

β ξ

σ ξ σ ω ξ

− − −

+ + −− − −

+

+ + + −

+

− +

− − +

− = − −

− − −+

− + +

(3.7)

Moreover, from (3.6), (3.1b) and (3.1c) we have

[ ]xxu ξβ in terms of ( )u ξ+ as

[ ] ( ) ( ) ( ) ( )

( )( ) ( ) ( )( )( )

( )

( )( ) ( )( )( )

[ ] ( ) ( ).

xx xx xx

xx x

x

u u u

u

v

f u

ξ

ξ

ξ

β β ξ ξ β ξ ξ


β ξ

α β ξ α α ξ

β

σ ξ σ ω ξ

+ + − −

− − ++ + +

−

− − + −

−

+ −

= −

− = − −

− − −+

− + +

(3.8)

In the above β,α,σ and the source term f are the only discontinuous coefficients.

3.2. Computing the Coefficients and the Correction Terms at Irregular Points

The coefficients 1, 2, 3,, ,i i iγ γ γ at regular points are given in (3.3). In this step, we aim to find the coefficients

, , 1,k j k jγ γ + where k = 1,2,3 in the scheme at irregular points. At regular points the solution is smooth and the truncation error is O(h2) since the centered difference scheme has second order accuracy, but the smoothness is poor near irregular grid points. We derive the local truncation error at irregular points xj and xj+1 and we expect to lose the optimal order of this error. Let the local truncation error at x = xi be denoted as Ti, 1 ≤ i ≤ N-1.

The local truncation error at x = xj: The scheme at the irregular point xj is

1, 1 2, 3, 1

0.j j j j j j j j j

j

u u u u f C

where C

γ γ γ σ− ++ + + = +

≠ (3.9)

Since xj-1, xj fall on the left of the interface x = ξ and xj+1 falls on the right of interface (see Figure 1) we compute Taylor expansions of the solution u(x) of the scheme (3.9) around the interface x = ξ and rewrite terms in u-(ξ). The local truncation error Tj is defined as

( ) ( ) ( )

( )1, 1 2, 3, 1

.

j j j j j j j

j j j

T u x u x u x

u x f C

γ γ γ

σ

− += + +

+ − − (3.10)

Taylor expansions for u(xj-1); u(xj) and u(xj+1) around x = ξ, with respect to the interior conditions (3.1b), (3.1c), the PDE (3.1a) and the additional jump condition [ ]xxu ξβ

defined in (3.7) are computed as:

( ) ( ) ( ) ( )

( ) ( ) ( )1 1

2 31

1 ,2

j j x

j xx

u x u x u

x u O h

ξ ξ ξ

ξ ξ

− −− −

−−

= + −

+ − + (3.11a)

( ) ( ) ( ) ( )

( ) ( ) ( )2 31 ,2

j j x

j xx

u x u x u

x u O h

ξ ξ ξ

ξ ξ

− −

−

= + −

+ − + (3.11b)

( ) ( ) ( ) ( )

( ) ( ) ( )( ) ( )( ) ( )

( ) ( ) ( )( )( )

( )( )

( )( ) ( )

( )( )( ) ( )

[ ]( )( )

( )( )( )

[ ] ( ) ( ) ( ) ( )

( )

1 1

2 31

1

211

3

12

12

j j x

j xx

j

x j

xx x

x

xx

u x u x u

x u O h

u x

v u x

u

f v

u u

O h

ξ

ξ ξ ξ

ξ ξ

ω ξ ξ ξ

α α ξ β ξ ξ ξ

β ξ β ξ


β ξ

α β ξα α ξ

β ξ

σ ξ σ ω ξ β ξ ξ

+ ++ +

++

−+

+ − − −+

+ +

+ + −− − −

+

+ ++ −

+

− + − −

= + −

+ − +

= + + −

− − + −+

−− −

−− + − −

+ + +

+

(3.11c)

We define ( ) ( ) ( )1 1 2 3 1, , .j j jh x h x h xξ ξ ξ− += − = − = − (3.12)

Substituting (3.11a), (3.11b), and (3.11c) in (3.10), using the PDE (3.1a) we have

[ ]( )

( )

( )( ) ( )

( )( ) ( )( )

( )( )( )

( )( )

23

1, 2, 3,

23

1, 1 2, 2 3, 3 3,

3,2 2 21, 1 2, 2 3

12

2

1 ( ) ( )2

( ( ) ( )) ( ( )

j j j j

j j j j

xx

x

jj j xx

hT u

hh h h

u

h h h u

u O h f O

σγ γ γ ξ

β ξ

β ξγ γ γ γ

β ξ β ξξ

α β ξ β ξα β ξ

β ξ

γ β ξγ γ ξ

β ξ

σ ξ ξ

−+

−

+ +

−+ + −

− −+

−−

+

− −

= + + +

+ + + + − − −

+ + +

+ + − +

( )

[ ] ( )

( )

( )

33, 3,

23

3,

3

( ))

( ) ( ( ))

( ( )2 ( )

( )( ( )) [ ] )

( )

j j

j

x

j

hh

v

hu

v f

C O h

ξ

γ ω ξ γ α α ξβ ξ

γ σ ξ σ ω ξβ ξ

α β ξα α ξ

β ξ

+ −+

− ++

+ ++ −

+

+ + − −

+ +

−+ − − −

− +(3.13)

Comparing (3.13) with the PDE (3.1a), which in approaching ξ from the left can be written as


( ) ( ) ( ) ( ) ( )( ) ( ) 0.

x x x xxu u u

u x f


σ ξ

− − − − − −

− −

− −

+ − =

We obtain the following system of linear equations in the coefficients 1, 2, 3,, ,i i iγ γ γ

[ ]( )

23

1, 2, 3,0 1 ,2

j j jh σ

γ γ γβ ξ+

= + + +

(3.14a)

( )

( )( )

( )( ) ( )

( )( )( )( )

( )

1, 1 2, 2

223

3, 3 ,2

x j j

x

j

x

h h

hh

α β ξ γ γ

α β ξ β ξ

β ξβ ξγ

β ξ α β ξ

β ξ

− −

+ + −

+−

+− −

+

− = + +

− + − −

(3.14b)

( )( )

( )

13,2 2 2

1, 1 2, 2 31 .2

jj jh h h

γ β ξβ ξ γ γ

β ξ

−−

+

− = + +

(3.14c)

We define

( )( )

( )( )

( )( )

( )( )( )

( ) [ ]( )

33, 3,

23

3, .2

j j j

x

j

hC v

h

v f ξ


α β ξσ ω ξ

β ξγβ ξ

α α ξ

+ −+

+ ++

++

+ −

= + − −

− + + − − −

(3.15)

The local truncation error at x = xj+1: The scheme at the irregular point xj+1 is

1, 1 2, 1 1 3, 1 2

1 1 1 0.j j j j j j

j j j j

u u u

u f C where C

γ γ γ

σ+ + + + +

+ + +

+ +

+ = + ≠ (3.16)

Since xj falls on the left of the interface x = ξ and xj+1, xj+2 fall on the right of interface (see Figure 1) we compute Taylor expansions of the solution u(x) in the scheme (3.16) around the interface x = ξ and rewrite terms in u+(ξ). The local truncation error Tj+1 is defined as

( ) ( )( ) ( )

1 1, 1 2, 1 1

3, 1 2 1.1 1

T u x u xj j j j j

u x u xj j jf Cj j

γ γ

γ σ

= ++ + + +

+ ++ + +

− −+ +

(3.17)

Taylor expansion for u(xj), u(xj+1) and u(xj+2) around x = ξ with respect to the interior conditions (3.1b), (3.1c), the PDE (3.1a) and the additional jump condition [ ]xxu ξβ

as defined in (3.8) are computed as

( ) ( ) ( ) ( ) ( )

( ) ( ) ( )( )( )( )

( )

( )( ) ( )( )

( )( ) [ ]

( ) ( ) ( ) [ ]

( )( )( )

( )( ) ( )

( )

2

3

1

1 12

j j

x

j

xx

x xx

x

u x u x

u v

x

u u f

v

O h

ξ

ξ ω ξ ξβ ξ

β ξ ξ α α ξ

ξβ ξ

α β ξ β ξα β ξ σ

β ξ

ξ β ξ ξ

α β ξα α ξ σ ω ξ

β ξ

+

+ + + −

−

− − ++ +

−

+ + +

− −+ − −

−

= − + −−

− − −

+ −

− − − −

+ + − − − − −

+(3.18a)

( ) ( ) ( ) ( )

( ) ( )1 1

2 31

1 ,2

j j x

j xx

u x u x u

x u O h

ξ ξ ξ

ξ

+ ++ +

++

= + −

+ − + (3.18b)

( ) ( ) ( ) ( )

( ) ( )2 2

2 32

1 ,2

j j x

j xx

u x u x u

x u O h

ξ ξ ξ

ξ

+ ++ +

++

= + −

+ − + (3.18c)

We define h4 = (xj+2- ξ) and substitute (3.18a), (3.18b), and (3.18c) in (3.17) to get

[ ]( ) ( )

( )( ) ( )

( )( ) ( )( )( )( )

( )

( )

22

1, 11

2, 1 3, 1

22

2

1, 1

2, 1 3 3, 1 4

21, 1 2

12

2

12

ij

i i

xix

x

i i

i

hT u

hh

u

h h

h

σγ

ξβ ξ

γ γ

β ξ

β ξ β ξ

α β ξ β ξγξ

β ξ

α β ξ

γ γ

β ξγ

β

+ +−+

+ +

+

− −

− − ++ +

−

+ +

+ +

+

+

− = + +

+

− + − − + +

+ ( ) ( )

( ) ( )( ) ( ) ( )( )

22, 1 3

24 3, 1

ixx

i

hu

h

u O h f O h

γξ ξ

γ

σ ξ ξ

+− +

+

+ +

+ +

+ − +

( )( )

( )( )

( )

[ ] ( )( )( )

( )( )( )

( )

21, 1 1, 1

22

1, 1

31

2

.

j j

j

x

j

h v

h

fC O h

v

ξ


γβ ξ

α β ξσ ω ξ

β ξ

α α ξ

+ −+ + −

+ −

− −+

−+

+ −

− − − −

+

− − − − + − −

(3.19)


When we compare (3.19) with the PDE (3.1a), which in approaching ξ from the right is given as

( ) ( ) ( ) ( ) ( )( ) ( ) 0

x x x xxu u u

u x f


σ ξ

+ + + + + +

+ + +

− −

+ − =

then, we obtain the following linear system in the coefficients 1, 1 2, 1, ,j jγ γ+ + and 3, 1jγ + :

[ ]( )

22

1, 1 2, 1 3, 10 1 ,2

j j jh σ

γ γ γβ ξ

+ + +−

= + + −

(3.20a)

( )

( )( )

( )( ) ( )

( )( )( )( )

( )

( ) ( )( )

222

1, 1 2

2, 1 3 3, 1 4

2 2 21, 1 2 2, 1 3 4 3, 1

2

,

1.

2

x

x

j

x

j j

j j j

hh

h h

h h h

α β ξ

α β ξ β ξ

β ξβ ξγ

β ξ α β ξ

β ξ

γ γ

β ξβ ξ γ γ γ

β ξ

+ +

− − +

−+

+ −+ +

−

+ +

++

+ + +−

− =

−

+−

−

+ +

− = + +

(3.20b)

We define

( )( )

( )( )

( )

( )( )( )

( )( )[ ] ( )

2

1 1, 1 22

.

2

x

j j

h v

Ch v

f ξ

ω ξ α α ξβ ξ

α β ξ

β ξγα α ξ

β ξσ ω ξ

+ −−

− −

−+ +

+ −−

+

+ − − − = − + − − − +

The system of linear equations (3.20), (3.20b), (3.20b) can be solved easily using a computer program like MAPLE to obtain the coefficients of the centered finite difference scheme at the irregular points xj and xj+1.

3.3. Numerical Examples We will measure the error using the L∞ norm defined as

( )max1 1

E u u xh l ll N

= −≤ ≤ −

(3.21)

where ul is numerical solution and u(xl) is the exact solution at grid point xl.

Order of convergence is ( ) ( )h h 1 21 2log E / E / log h / h ,

where h1E is the error corresponding to step size hi, i = 1, 2.

Example 3.1: Consider the initial-boundary value problem with interface ξ = 0.5, and the jump conditions: [u] = 1/3 and [α-βux] =-1. In this problem σ = 0 and β, α, and the source term are given as

( ) ( ) [ ]

( ) [ ]( ] ( )

[ ]

( ]

( ) [ ]( ]

( ) [ ]( ]

3

2 3

, 0,1

1, 0,0.5/ 3, 0,0.51, 0.5,1 , 0.5,13

1, 0,0.52, 0.5,1

/ 3, 0,0.5

8 2 , 0.5,1 .

x f x x

xx xx x

x x x

xx

x

x xf x

x x x

α β σ

β α

σ

= − + ∀ ∈

∈ ∈ = = ∈ ∈ ∈= ∈ ∈= − + ∈

(3.22)

The true solution for this problem is

( ) [ ]( ]

/ 3, 0,0.5, 0.5,1

x xu x

x x ∈= ∈

In Figure 2, we plot the numerical and exact solution for Example 3.1 with N=80 and h=1/80. Table 1 shows that the error converges as O(h2).

Table 1. Table of errors for Example 3.1

N h Eh Eh/Eh/2 Order

20 1/20 0.0061 - -

40 1/40 0.0014 4.3659 2.1393

80 1/80 3.2779e-04 4.2010 2.0765

160 1/160 7.9702e-05 4.1051 2.0401

320 1/320 1.9644e-05 4.0537 2.0205

In Figure 2, we plot the numerical solution and the exact solution for Example 3.1 with N=80 and h=1/80. Table 1 shows that the IIM reaches the optimal order of accuracy (i.e second order) in the case where the diffusion, advection, and reaction coefficient are discontinuous across the interfaces.

Figure 2. The plot of the numerical solution (the \o"-line) and the exact solution (the solid line) for Example


Figure 3. The plot of Error for Example 3.1 with N=80, h=1/80, k=0.1 and t=0.5

4. Time-Dependent Interface Problem In this section, we will construct an IIM for the time-

dependent (Parabolic) interface problem. Consider the following time-dependent initial-boundary value problem in one dimension with time dependent source term f and assume that the coefficients σ and α are piecewise constant. Find the solution u = u(x,t) on Ω×(0,T] of the initial-boundary value problem:

( )( ) ( )

( ], , ,

0,t x x x

u u x t u u f x t

on T

α β σ+ = − +

Ω× (4.1a)

[ ] ( ) ( ) ( ), , , ,u u t u t tξ ξ ξ ω ξ+ −= − = (4.1b)

[ ] ( ) ( ) ( )( )

( ) ( ) ( )( ) ( )

, , ,

, , , , ,

x x

x

u t t u t

t t u t v t

ξα β α ξ β ξ ξ

α ξ β ξ ξ ξ

+ +

− −

− = −

− − = (4.1c)

( ) ( )0,0 , ,u x u x x= ∀ ∈Ω (4.1d)

( ) ( ) [ ], , , 0, .u x t g t x t T= ∀ ∈∂Ω ∀ ∈ (4.1e)

( ) [ ]( ]

, , ,,

, , ,

x ax t

x b

β ξβ

β ξ

−

+

∈= ∈

(4.1f)

( ) [ ]( ]

, , ,,

, , ,

x ax t

x b

α ξα

α ξ

−

+

∈= ∈

(4.1g)

( ) [ ]( ]

, , ,,

, , ,

x ax t

x b

σ ξσ

σ ξ

−

+

∈= ∈

(4.1h)

In the above equations, the coefficients β > 0, σ, and α, the source term f, the jump conditions w and v, and the initial and boundary functions u0(x) and g(x) are known a-priori. We assume β, α, σ, u, and f have a finite (time-dependent) discontinuity at interface x = ξ. We now present the construction of the IIM for problem (4.1).

Step 1: Construction of the Uniform Cartesian Grid for Space-Time Mesh

The discrete mesh h kΩ ×Ω consists of grid points (xi, tn) defined as

( ): , 0,1,.... , 0,

: , 0,1,.... , 0,

i

n

b ax a ih where i N h

NTt nk where n M kM

−+ = = >

= = = >

where h is the space step size, and k is the time step. We

also define half-points 12

, : ,2

nii

hx t x nk±

= ± as well

as 12, : ,

2n

i ihx t x n k

± = ± . Conventional finite

difference schemes can be used on most grid points except

at ( ) ( )1, , , , 0,1, 2....n nj jx t x t n M+ ∀ = (see Figure 4),

where xj, xj+1 are the spatial irregular points.

Figure 4. Stencil for CFD-CN scheme (4.8)

Step 2: Derivation of a Centered Finite Difference Scheme in Space and Crank-Nicolson

Scheme in Time at Regular Grid Points We will derive the scheme for (4.1a) which is centered finite difference (CFD) in space and Crank-Nicolson (CN) in time. This scheme is unconditionally stable when applied to regular grid points if σ > 0 regardless of the jump, provided that β(x,t) has the same sign across the interface. Then the

scheme discretized at 12,

nix t

+

is derived as he

following:

( ) ( )( )

( )( ) ( )( ) ( )

( ) ( )

12

1 12

1 1 1 11 1 1 12 2 2 2

1 1 1 12 2 2 2

2 2

, , |

, ,

2

, ,

2

, ,

2

nt

x xix

n n n ni x i i x i

x x

n n n nx xi i i i

n n n nx xi i i i

x t u x t

u x t u x tO k

u x t u x t

h

u x t u x t

hO h O k

β

β β

β β

β β

+

+ +

+ + + +

+ + − −

+ + − −

=

++

−

=

−

+

+ +


( ) ( )

( ) ( )

( ) ( )

( ) ( )

( ) ( )

1 111

12

1 111

12

112

112

2 2

, ,

, ,

2

, ,

, ,

2

n ni in

i

n ni in

i

n ni in

i

n ni in

i

u x t u x t

h

u x t u x t

h

h

u x t u x t

h

u x t u x t

h

hO h O k

β

β

β

β

+ +++

+

+ +−+

−

+

+

−

−

− − − =

− − − +

+ +

( ) ( )( )

( ) ( ) ( )( )

( ) ( ) ( )( )

( ) ( )

( )( )

12

1 1 1 1 11/2 1 1/2 1/2

1 11/2 1

2

1/2 1 1/2 1/2

1/2 1

2

2 2

1 12

, , |

, ,

,

2

, ,

,

2.

,, |

nt

x xix

n n n n ni i i i i

n ni i

n n n n ni i i i i

n ni i

nn x itx xi

x t u x t

u x t u x t

u x t

h

u x t u x t

u x t

hO h O k

u x tu x t

β

β β β

β

β β β

β

αα

+

+ + + + ++ + + −

+ +− −

+ − + −

− +

++

=

− + +

− + + +

+ +

=( ) ( )

( ) ( )

( ) ( ) ( ) ( )

2

1 11 1

1 1 2 2

,

2, ,

4, ,

4

nx i

n ni i

n ni i

u x tO k

u x t u x t

hu x t u x t

O h O kh

α

α α

α α

+ ++ −

+ −

++

−=

−+ + +

In the above, 1 12 2

: ,n ni i

x tβ β+ +

=

. We define for 1 ≤ i

≤ N-1 the following parameters:

12

1, 2 ,2

ni

ni hh

βαγ

−= − (4.2)

1 12 2

2, 2 ,

n ni i

ni h

β β

γ+ −

+ = −

(4.3)

12

3, 2 .2

ni

ni hh

βαγ

+= + (4.4)

The coefficients (4.2), (4.3), and (4.4) correspond to the scheme at regular points. Thus, the standard Crank-

Nicolson and centered spatial finite difference scheme at

regular grid points 12,

nix t

+

can be written as:

1 1 1 1 1 11, 1 2, 3, 1

11 1

1, 1 2,

3, 1

1 ,2

n n n n n ni i i i i i

n nn n n n n ni ii i i i i i

n n n ni i i i

u u uu u

u f u uk

u u f

γ γ γ

σ γ γ

γ σ

+ + + + + +− +

++ +

−

+

+ + − = − + + + − +

where ( ),n ni iu u x t≈ and ( ): ,n n

i if f x t= .

Scheme at Irregular Grid Points: To determine the finite difference equations at irregular

grid points we use the method of undetermined coefficients [2]. We assume that the scheme at the

irregular points 12,

njx t

+

and 12

1,n

jx t+

+

is of the

form 1 1 1 1 11 2, 3, 11,1

1 1 11, 1

2, 3, 1

1 ,2

n j n n n n nj j j j jjn n

j j n n n n nj j j j j

n n n n n n nj j j j j j j

u u uu u

u f C uk

u u u f C

γ γ γ

σ γ

γ γ σ

+ + + + + +− +

++ + +

−

+

+ + − = − + + + + + − + +

(4.5)

1 1 1 1 12, 1 1 3, 1 21, 1

1 1 111 1 1 1, 21 1

2, 1 1 3, 1 2 1

1 1

1 ,2

n j n n n n nj j j j jj

n n n n nn nj j j j jj j

n n n n nj j j j j

n nj j

u u u

u f C uu uk u u u

f C

γ γ γ

σ γ

γ γ σ

+ + + + + ++ + + ++

+ + +++ + + ++ +

+ + + + +

+ +

+ + − + + +− = + + − + +

(4.6)

where we add correction terms njC , 1n

jC + , and 1njC + ,

11

njC ++ on the right hand side of the equations in (4.5) and

(4.6) respectively in order to let the scheme reach the optimal order of accuracy (i.e second order) at irregular points xj and xj+1 for each time point tn. We will derive the coefficients ,

nkγ

for k = 1, 2, 3; and l = j, j +1 in the next

step. We also derive the correction terms njC and 1n

jC + through computing the Local Truncation Error (LTE) at the irregular points, using Taylor expansions of the solutions at each time point tn in which the interior boundary conditions (4.1b) and (4.1c) are used.

Step 3: Solution of a Linear System This finite difference scheme for problem (4.1) on h kΩ ×Ω can be written in vector form as

1 ,n nDU BU F+ = + (4.7)

where

1 11 3,1

1 1 11,2 2 3,2

1 1 11, 2 2 3, 2

1 11, 1 1

1 0 0 02

1 0 02 2

0 12 2

0 0 12

n n

n n n

n n nN N N

n nN N

k

k k

Dk k

k

ϖ γ

γ ϖ γ

γ ϖ γ

γ ϖ

+ +

+ + +

+ + +− − −

+ +− −

−−

− −−

=− −

−

−−


( )

1 3,1

1,2 2 3,2

1, 2 2 3, 2

1, 1 1

2, 1 2 1

1 11 2 2 2 2

1 0 0 02

1 0 02 2

0 12 2

0 0 12

, , ,.......... ,2

,2

n n

n n n

n n nN N N

n nN N

Tn n n n n nj j N

n n n n

k

k k

B

k k

k

k U u u u and

P f f C CkF

ϖ γ

γ ϖ γ

γ ϖ γ

γ ϖ

ϖ γ σ

− − −

− −

−

+ +

+

+

=

+

+

= − =

+ + +=

1 11 1 1 1

,...........,

,n n n nN N N N Nf f C C P+ +− − − −

+ + +

with

1 1 1 1

1 1 1 1 3, 1 3, 1

1 1 1 11 1 1 1 1 1,1 0 1,1 0

,

,n n n n n n n n

N N N N N N N N N

n n n n n n n n

P f f C C u u

P f f C C u u

γ γ

γ γ+ + + +

− − − − − −

+ + + +

= + + + + +

= + + + + +

where 0miC = if , 1,l j j≠ + for all 1 1.m N≤ ≤ −

The solution of the linear system (4.7) of equations is the numerical solution

1 1 1 11 2 1, ,......... .

Tn n n nNU u u u+ + + +− =

4.1. Derivation of Additional Jump Conditions

In this subsection we want to compute .n nxxu

ξβ The

source term f has a jump across the interface x ξ= at

each time point .nt

[ ] ( ) ( ), , .n n nf f t f tξ ξ ξ+ −= −

Then, we have

[ ] ( ) ( )( ) ( )

( ) ( )( ) ( )( ) ( )( ) ( )

( ) ( )( ) ( )( ) ( ) ( ) ( )( ) ( ) ( )

, ,

lim , lim ,

, ,

, , ,

, ,

, , ,

, , , ,

, , ,

,

n n n

n n

x x

n nt x

n n nx

x

n nt x

n n nx

x

n n n nt x x x

n n nxx

t

f f t f t

f x t f x t

u t u t

t u t u t

u t u t

t u t u t

u t u t t u t

t u t u t

u

ξ

ξ ξ

ξ ξ

ξ α ξ

β ξ ξ σ ξ

ξ α ξ

β ξ ξ σ ξ

ξ α ξ β ξ ξ

β ξ ξ σ ξ

ξ

+ −

+ −→ →

+ + +

+ + + +

− − −

− − − −

+ + + + +

+ + + +

−

= −

= −

= +

− +

+ − − +

= + −

− +

− ( ) ( ) ( ) ( )( ) ( ) ( )

, , ,

, , , .

n n n nx x x

n n nxx

t u t t u t

t u t u t

α ξ β ξ ξ

β ξ ξ σ ξ

− − − −

− − − −

− +

+ −

(4.8)

We define ( ) ( ) ( ), , ,n n nt t tt u t u tω ξ ξ ξ+ −= − and use

the given jump conditions (4.1b) and (4.1c) to get

( ) ( )( )( ) ( )( )( )( )

( )

( )( ) ( )( )( )

[ ] ( ) [ ] ( ) ( )

, ,

, ,

, ,

,

, ,

,

, , , .

n n n nxx xx xx

n nx

n nx

nx

n nx

n

n n nt

u u t u t

t t

t u t

t

t t

t

f t u t tξ

β β ξ β ξ

α β ξ β ξ

β ξ ξ

α β ξ

α β ξ α α ν ξ

β ξ

σ ω ξ σ ξ ω ξ

+ −

+ + −

+ −

− −

+ + + −

+

+ −

= −

−

=

− −

− − −+

− + + +

(4.9)

We can also rewrite n nxxu

ξβ in terms of u+ as

( ) ( )( )( )( ) ( )( )

( )

( )( ) ( )( )( )

[ ] ( ) [ ] ( ) ( )

, ,

,

,, ,

,

, ,

,

, , , .

n n n nxx xx xx

nx

nn nxx

n

n nx

n

n n nt

u u t u t

t

u tt t

t

t t

t

f t u t t

ξ

ξ

β β ξ β ξ

α β ξ

ξα β ξ β ξ

β ξ

α β ξ α α ν ξ

β ξ


+ −

+ +

+− − +

−

− − + −

−

− +

= −

−

= −−

− − −+

− + + +

(4.10)

4.2. Computation of Coefficients and Correction Terms for Irregular Points

The coefficients of the scheme at regular points are given in (4.2), (4.3), and (4.4). The coefficients of the scheme at irregular points are derived by substituting Taylor expansions of the solution around interface

12,

ntξ+

in the local truncation error at 12, ,

njx t

+

1 112 22

1 1 1, ,n nn

j j jx t ie T T+ ++

+ + +

and by using the jump

condition (4.1b), (4.1c), and (4.9) on 1122

1,nn

j jT T++

+ . The

local truncation error 12

njT+

and 12

1njT+

+ is slightly different

than jT and 1jT + computed in section 2 because of extra

term ntω .

The local truncation error at ( ), njx t is

( ) ( )

( ) ( )( ) ( )( ) ( )( ) ( )

( ) ( )

112

1 1 1 11, 1 2,

1 1 13, 1

1 11, 1

2, 3, 1

, ,

, ,

, ,1

, , .2

, ,

, ,

n nn j jj

n n n nj j j j

n n nj j j

n n n nj j j j

n n n nj j j j

n n nj j j

u x t u x tT

k

u x t u x t

u x t f x t

u x t C u x t

u x t u x t

f x t u x t C

γ γ

γ

σ γ

γ γ

σ

− + −+

+ − + + − +−

+ + + ++

− − + + −−

− ++

− −

−=

+

+ +

− − + +

+ +

+ − +

(4.11)


The scheme is discretized at 12,

ntξ+

as the following:

( ) ( ) ( ) ( )( ) ( ) ( )

1 1

2 31

, , ,

1 , ,2

n n nj j x

nj xx

u x t u t x u t

x u t O h

ξ ξ ξ

ξ ξ

− − −− −

−−

= + −

+ − + (4.12a)

( ) ( ) ( ) ( )

( ) ( ) ( )2 3

, , ,

1 , ,2

n n nj j x

nj xx

u x t u t x u t

x u t O h

ξ ξ ξ

ξ ξ

− − −

−

= + −

+ − −(4.12b)

( ) ( ) ( ) ( )( ) ( ) ( )( ) ( )( )

( )( )( ) ( ) ( )

( )

( )( )

( )( ) ( )( )( )( )

( )

[ ]( )( )

1 1

2 31

1

21

, , ,

1,

2

, ,

, , ,

,

, ,

, ,

,

1,

2 ,

n n nj j x

nj xx

n n

n n nx

j n

n nx

n nx

nx

j nxn

n

u x t u t x u t

x u t O h

t u t

t t u tx

t

t t

t u t

t

xt

tf ξ

ξ ξ ξ

ξ ξ

ω ξ ξ

α α ν ξ β ξ ξξ

β ξ

α β ξ β ξ

β ξ ξ

α β ξ

ξ α αα β ξ

β ξ

+ ++ +

++

−

+ − − −

+ +

+ + −

+ −

− −

+ −+ + ++

= + −

+ − +

= +

− − ++ −

−

− −

− −+ −

− +

( )( )

( ) [ ] ( ) ( )( ) ( ) ( )3

,

,

, , ,

, ,

n

n

n n nt

n nxx

t

t

t u t t

t u t O h

ν ξ

β ξ


β ξ ξ

+

+ −

− −

−

+ + +

+ +

The Taylor expansions for ( )11, ,n

ju x t− +−

( )1, ,nju x t− + and ( )1

1, nju x t+ ++ around ( )1, ntξ + are the

same as above, but in terms of 1.nt + Also, we use he following expansion:

( ) ( )

( )

1

1 1242 2

, ,

, , .6

n nj j

n nt ttt

u x t u x t

k

ku t u t O kξ ξ

− + −

+ +− −

−

= + +

to obtain

( )

( [ ]( ) ) ( )

( )( )

1 1 1242 2 2

21 1 1 13

1, 2, 3,1

1 13,1 1

1, 2, 2 311

, ,6

1 1 ,

2 2 ,

,

,

n n n

j t ttt

n n n nj j jn

n njn n

j j n

kT u t u t O k

hu t

t

th h

th

ξ ξ

σγ γ γ ξ

β ξ

γ β ξγ γ

β ξ

+ + +− −

+ + + − ++ +

+ − ++ +

+ +

= + +

− + + +

+ +

+

( )( )( ) ( )

( )( )( ) ( )

( )( ) ( )

( ) ( ) ( ) ( ) ( )

( )

1 123

1 1

1 1

1 13,1 2 1 2 2 1

1, 1 2, 2 3 1

1 1 13,

1 33, 1

, ,

2 , ,

, ,

,1,

2 ,

, , ,

,

n nx

n n

n nx x

n njn n n

j j xxn

n n nj

nj n

t th

t t

t u t

th h h u t

t

f t O h u t O h t

h

t

α β ξ β ξ

β ξ β ξ

α β ξ ξ

γ β ξγ γ ξ

β ξ

ξ σ ξ γ ω ξ

γ αβ ξ

+ + + − +

+ + + +

− − + − +

+ − ++ + − +

+ +

− + − − + +

+ ++ +

−+

− −

+ + +

+ + − +

+

−

( )( )

( ) ( )(

( )( )( ) ( )( )

( ) [ ] ) ( )[ ]( ) ( )

( )( ) ( )

1

21 13

3, 1

11

1

11 1 31, 2,

23

3, 1, 1 2, 2

23, 3

3

,

,2 ,

,,

,

, (

1 ) , [2 ,

,

, 2 ,

(

n

n nj n

nx n

n

nn n n nt j j j

n n n nj j jn

n nj

n n

x

t

ht

t

tt

t

t f C O h

hu t h h

t

t hh

t t

ξ

α ν ξ

γ σ ω ξβ ξ

α β ξα α ν ξ

β ξ

ω ξ γ γ

σγ ξ γ γ

β ξ

γ β ξ

β ξ β ξ

α β

− +

+ + ++ +

+ + ++ − +

+

++ +

−+

−

+ +

+ +

− −

+

−+ − −

+ − + + + +

+ + + +

+ +

−

( )( ) ( )( )

( )( ) ( )( )

( ) ( ) ( ) ( )

( ) ( ) ( )

( )

( ) ( )

( )( )

2 21, 1 2, 2

3,23

3,

13 2

3,

23

3,

, ,

,

1, )] , (

2

,) , ,

,

, ,

,,

( ,2 ,

,

n n

n

n n n nx x j j

n nj n n

xxn

n nj

nnj n

n nj n

nx

t t

t

t u t h h

th u t f t O h

t

u t O h t

ht

t

ht

t

t

ξ β ξ

β ξ

α β ξ ξ γ γ

γ β ξξ ξ

β ξ

σ ξ γ ω ξ

γ α α ν ξβ ξ

γ σ ω ξβ ξ

α β ξ

β ξ

−

+

− − −

−− −

+

− −

++ −+

++

+ +

− − + +

+ + +

− − +

+ − −

+

−+

( )( )( )

( ) [ ] ( )3

,

,

, )

n

n

nn nt j

t

t

t f C O hξ

α α ν ξ

ω ξ

+ −− −

+ − + +

(4.13)

where

( ) ( ) ( )1 1 2 3 1, , .j j jh x h x h xξ ξ ξ− += − = − = − (4.14)

The PDE that approaches ξ from the left of the

interface at time point 12

nt+

is

12

1 1 1

1 1

( , )1 ( , ) ( ( , ) ( , ))2

( , ) ( , ) ( , )

( ( , ) ( , )) ( , ) ( , ).

nt

n n nx x

n n n

n n n nx x

u t

u t t u t

u t f t u t

t u t u t f t

ξ

α ξ β ξ ξ

σ ξ ξ α ξ

β ξ ξ σ ξ ξ

+−

− − + − + − +

− − + − + − −

− − − − −

= − +

− + −

+ − +

(4.15)


where we substitute 12( , )

ntu tξ

+− in (4.11) and compare

the factors of 1( , ), ( , )n nu t u tξ ξ− + − , 1( , ),nxu tξ− +

( , ),nxu tξ− 1( , )n

xxu tξ− + and ( , ),nxxu tξ− we obtain the

following linear system

( )

21 1 13

1, 2, 3,1

1 13,1 1 1

1, 1 2, 2 31

1 11 2

3, 3 11

1

[ ]0 1 ,

2 ( , )

( , )( , )

( , )

( , ) ( , )

( , )2 ( , )( , )

n n nj j jn

n njn n n

x j j n

n nxn

j nn

nx

ht

tt h h h

t

t th

ttt

σγ γ γ

β ξ

γ β ξβ ξ α γ γ

β ξ

α β ξ β ξγ

β ξβ ξ

α β ξ

+ + ++ +

+ − +− + − + +

+ +

+ + + − ++

+ ++ +

− − +

= + + +

− = + +

− + − −

1 13,1 1 2 1 2 2

1, 1 2, 2 3 1

,

( , )1( , ) .2 ( , )

n njn n n

j j n

tt h h h

t

γ β ξβ ξ γ γ

β ξ

+ − +− + + +

+ +

= + +

The correction term corresponding to 1( , )njx t + is

given by

( )

( )

( )[ ]

1 1 1[ ( , )3, 11( , )

2 1( , )1( , )

22 1( , )12 ( , ) 1( , )

11 1( , ) ( , )]

n n nC tj jnt

hnt

ntxh ntnt nt

nn nt f tt

γ ω ξ

α α ν ξ

β ξ

α β ξ

β ξβ ξ

α α ν ξ

σ ω ξ ω ξξ

+ + += +

+ − +− −+

+ +

+ + + − + ++ + + + − + × − −

++ + ++ − +

(4.16)

Also, we obtain the same linear system of equations and correction term for the time level n to compute 1, 2,,n n

j jγ γ

and 3, .njγ

The local truncation error at ( )1, njx t+ :

( ) ( )1 1, ,1 121

1 1 1 1 1 ( , ) ( , )1, 1 2, 1 121 1 1( , ) ( , )3, 1 2 1

1 1( , ) ( , )1 1 1, 1

( , ) ( , )2, 1 1 3, 1 2

( 1

n nu x t u x tn j jT j k

n n n nu x t u x tj j j jn n nu x t f x tj j j

n n n nu x t C u x tj j j jn n n nu x t u x tj j j j

f x j

γ γ

γ

σ γ

γ γ

+ + +−+ + +=+

+ − + + + +− ++ + +

+ + + ++ ++ + ++ + + + −− + ++ + +

+ ++ ++ + + +

+ + , ) ( , ) .1 1n n nt u x t Cj jσ + +− ++ +

(4.17)

We use Taylor expansion of the solution around interface ( , )ntξ to obtain

( ) ( )

( ) ( )

( ))[ ]

( )

2

( , ) ( , ) ( , )

( , ) ( , )1( , )( , )

( , ) ( )1 12 ( , ) ( , )

( , ) ( , ) ( , ) ( , )

( , )

( , )

n n nj

n nx

j nn

nx

j n n

n n n nx x xx

nx

n

u x t u t t

t u tx

tt

tx

t t

t u t t u t

tf

tξ

ξ ω ξ

β ξ ξξ

α α ν ξβ ξ

α β ξ β ξξ

β ξ β ξ

α β ξ ξ β ξ ξ

α β ξα α

β ξ

− +

+ +

+ −−

− − +

− −

+ + + + +

− −+

−

= −

+ − − − −

−+ −

− − +

−+ − −( )

[ ] ( )3

( )

( , ) ( , ) ( , ) ,n n ntt u t t O h

ν ξ


−

− +

−

− − − +

(4.18a)

( )

1 1

2 31

( , ) ( , ) ( ) ( , )

1 ( ) ( , ) ,2

n n nj j x

nj xx

u x t u t x u t

x u t O h

ξ ξ ξ

ξ ξ

+ + ++ +

++

= + −

+ − +(4.18b)

( )

( , ) ( , ) ( ) ( , )2 21 2 3( ) ( , ) .22

n n nu x t u t x u tj j x

nx u t O hj xx

ξ ξ ξ

ξ ξ

+ + += + −+ +

++ − ++

(4.18c)

We will define 4 2( ).jh x ξ+= − The Taylor expansion

for 1 1 11 2( , ), ( , ), ( , )n n n

j j ju x t u x t u x t− + + + + ++ + around

1( , )ntξ + is the same as above replacing nt by 1.nt + Also, we have

( )

1( , ) ( , )

1 12 42 2( , ) ( , ) .6

n nu x t u x tj jk

n nku t u t O kt tttξ ξ

+ + +−

+ ++ += + +

The local truncation error corresponding to 12

1( , )n

jx t+

+ is

( )

[ ]

1 1 12 22 2 2( , ) ( , )1 6

21 1 121 2, 1 3, 112 2 ( , )

1 1 1 1( , )1, 1 2, 1 3 3, 1 41 1( , )1, 1 1, 1

21( , )

n n nkT u t u t O kt ttj

h n nj jnt

n n n nu t h hj j jn n ntj jh

nt

ξ ξ

σγ γ

β ξ

γ ξ γ γ

γ β ξ γ

β ξ

+ + + + += + + +

+ + − − + + + − + + + + + + + + ++ + + + + + ++ +

+ +− +

( )

( )

1 22

12 ( , )

1 1( , ) ( , )

11 ( , )( , )1( , )

h

nt

n nt txnn u tt x

ntx

β ξ

α β ξ β ξ

ξβ ξ

α β ξ

− +

− − + + + − + +− + + + + − −


( ) ( )[ ]

1 2 1 22, 1 2 3, 1 2

11 11, 12

2 1

1 1

1 1 13,

1 23, 1 1

21 2

3,

1 ( , )( , )2( , )

( , ) ( , )

( , )

( , ) ( , )

2 ( ,

n nj j

nn n xxjn

n n

n n nj

nj n n

nj n

h h

u tth

t

f t O h u t O h

f t

ht t

ht

ξ

γ γ

ξγ β ξ

β ξ

ξ σ ξ

γ ω ξ

α αγ

β ξ ν ξ

γβ ξ

+ ++ +

+ ++ + ++− +

+ + − + +

+ + +

+ −+

− + +

++

+

+ +

+ + − −

+ −

− − −

+ (( ) ( )[ ] ) ( )

[ ]

11

11

1

1 1 1 31

22

2, 1 3, 1 1, 1

1, 12, 1 3 3, 1 4 2

1, 1 2

( , ))

( , )( , )

( , )

1 ( , )2 ( , )

( , )

( , )

n

nx n

n

n n nt j

n n n nj j jn

n njn n

j j n

nj

t

tt

t

f C O h

hu t

t

th h h

t

h

ξ

σ ω ξ

α β ξα α ν ξ

β ξ

ω

σγ γ γ ξ

β ξ

γ β ξγ γ

β ξ

γ

− ++

− − ++ − +

− +

+ + ++

++ + +−

++

+ + −

+

−

−− − −

+ − + +

+ − + +

+ + +

+

( )

( )

( ) ( ) [ ]

2

2 22, 1 2 3, 1 2

1, 122

3, 3,

( , )( , )

( , )( , )2 ( , )

( , )

1 ( , )( , )2( , )

( , ) ( , )

( , )

nx n

nnxn

nx

n nj j

nn n xxjn

nn n

n nj j

tt

u ttt

t

h h

u tth

t

f t O h u t O h f

t

ξ

α β ξβ ξ

ξβ ξβ ξ

α β ξ

γ γ

ξγ β ξ

β ξ

ξ σ ξ

γ ω ξ γ

− −+

+−−

+ +

+ +++

+−

+ − +

− − −

+

+ +

+ + − − +

− − ( )

(( ) ( )[ ] ) ( )

2

22

3,

31

( , )( , )

( , )2 ( , )

( , )( , )

( , )

.

n nn

n nj n

nx n

n

n n nt j

h tt

h tt

tt

t

f C O hξ

α α ν ξβ ξ

γ σ ω ξβ ξ

α β ξα α ν ξ

β ξ

ω

+ −−

++

− −+ −

−

+

− −

+ −

−− − −

+ − + +

(4.19)

The PDE that approaches ξ from the right of the

interface on time point 12

nt+

is

( )(

( ) )

12

1 1 1

1 1

( , )1 ( , ) ( , ) ( , )2

( , ) ( , ) ( , )

( , ) ( , ) ( , ) ( , )

nt

n n nx x

n n n

n n n nx x

u t

u t t u t

u t f t u t

t u t u t f t

ξ

α ξ β ξ ξ

σ ξ ξ α ξ

β ξ ξ σ ξ ξ

++

+ + + + + + +

+ + + + + + +

+ + + + +

= − +

− + −

+ − +

(4.20)

From (4.19) and (4.20), we obtained the following linear system for which that the solutions are the coefficients of the scheme corresponding to 1

1( , )njx t ++ :

[ ]( )

( ) ( )( )

( )

( )( ) ( )( )

( )( )

221 1 1

2, 1 3, 1 1, 11

1 11, 11

21

1 1

1 21, 1 2 1

11

1 12, 1 3 3, 1 3

0 1 ,2 ,

,,

,

, ,

,2 ,

,

,

,

n n nj j jn

n njn

n

n n

nj n

nn

n nj j

h

t

tt h

t

t th

tt

t

h h

σγ γ γ

β ξ

γ β ξβ ξ α

β ξ

α β ξ β ξγ

β ξβ ξ

α β ξ

γ γ

β ξ

+ + ++ + ++

+ + +++ + +− +

− − + + +

++ − +

− +

− − +

+ ++ +

+

= + + − −

− =

−

+ − −

+ +

( )( )

( )1 1

1, 1221 1

1 2 1 22, 1 3 3, 1 4

,1 .,2

n nj

n n

n nj j

th

t t

h h

γ β ξ

β ξ

γ γ

+ + ++

+ − +

+ ++ +

= + +

The correction term corresponding to (xj+1, tn+1) is

( ) ( )( )( )

( )

( )( )( )

( )( )( )

[ ] ( )

11

12 1

1

111, 1

22

1

1

1 1

,,

,

,

,

,2 ,

,

,

nj

nn

n

nx

nnj

nn

n

n nt

C

v tt h

t

t

t

h v tt

t

f tξ

α α ξω ξ

β ξ

α β ξ

β ξγ

α α ξβ ξ

σ ω ξ

ω ξ

++

+ −+

− +

− − +

− +++

+ −− +

− +

+ +

=

− − + +

− − − − + − +

(4.21)

The linear system for computing the coefficients of the scheme at (xj+1, tn) and correction term 1

njC + are the same

as in time level n + 1. These linear systems of equations can be solved using a computer program such as MAPLE.

4.3. Numerical Example Example 4.1: We will estimate the errors using the

norm L∞ in space mesh at all grid point as

( ) ( ),1 1

max , .n n nh k l l

l NE t u u x t∞

≤ ≤ −

= −

Also, the errors are estimated in time mesh using

( ),1 1 1max max , .n n

h k l ln M l N

E u u x t∞

≤ ≤ ≤ ≤ −

= −

(4.22)

Consider the initial-boundary value problem with interface: x = 0.5. and the jump conditions: [u] =1/2cos(t) as well as [α - βux] =1/3cos(t) Let T=[0,1]. Then


( ) ( ) ( ) ( ) ( ) [ ]) 0,1 ,t x x xu x u x x u x f x xα β+ − = ∀ ∈ (4.23)

( ) [ ]( ]

( )( ) ( ) [ ]

( ) ( ) ( ) ( ]

( ) [ ]( ] ( ) [ ]

( ]

3 3

3 2

, 0,0.53

, 0.5,1

sin cos , 0,0.53 3

sin 9 cos , 0.5,1 .

1, 0,0.5 1, 0,0.50, 0.5,1 0, 0.5,1 .

x xx

x x

x xt t xf x

x t x t x

x xx x

x x

β

α σ

∈= ∈ −

+ ∈= − − ∈ ∈ ∈ = = ∈ ∈

The true solution is

( ) ( ) [ ]

( ) ( ]

3

3

cos , 0,0.53

cos , 0.5,1 .

x t xu x

x t x

∈

= ∈

Table 2. Table of errors for Example 4.1 with k/h=1

N h ,Eh k∞

, ,2 2

E / Eh k h k∞ ∞

Order

8 1/8 0.0370 - 0.0118 16 1/16 0.0071 5.2241 2.3852 32 1/32 0.0015 4.6814 2.2269 64 1/64 0.0003 4.3560 2.1230 128 1/128 0.0001 4.1818 2.0641

Figure 5. The plot of the numerical solution (the \o"-line) and the exact solution (the solid line) for Example 4.1 with N=80, h=1/80, k=0.1 and t=0.5


In Figure 5, we plot the numerical solution for N = 80, t = 0.5, h = 1/80, k = 0.1. Table 2 shows the error converges to O(h2). Table 2 shows that the error converges to O(k2). Therefore, the truncation error is second order of accuracy in space as well as in time.

Example 4.2: Consider the initial-boundary value problem with interface: x = 0.5. and the jump conditions: [u] =1/2cos(t) as well as [α - βux] =1/3cos(t). Let T=[0,1]. then


( ) [ ]( ]

( )( ) ( ) ( ) [ ]

( ) ( ) ( ]

( ) [ ]( ] ( ) [ ]

( ]

, 0,0.53

, 0.5,1

51 sin cos , 0,0.53

sin cos , 0.5,1 .

1, 0,0.5 1, 0,0.50, 0.5,1 0, 0.5,1 .

x xx

x x

x t x t xf x

x t t x

x xx x

x x

β

α σ

∈= ∈ − + + + ∈ = − − ∈ ∈ ∈ = = ∈ ∈


( )( ) [ ]

( ) ( ]

cos , 0,0.51 cos , 0.5,1 .2

x t xu x

x t x

∈= + ∈


N h ,Eh k∞

, ,2 2

E / Eh k h k∞ ∞

Order

8 1/8 0.0102 - - 16 1/16 0.0024 4.1986 2.0699 32 1/32 0.0006 4.1215 2.0432 64 1/64 0.0001 4.0628 2.0225 128 1/128 0.0001 4.0322 2.0116


In Figure 7, we plot the numerical solution for N = 80, t = 0.5, h = 1/80, k = 0.1. Table 3 shows the error converges to O(h2). Table 3 shows that the error converges to O(k2). Therefore, the truncation error is second order of accuracy in space as well as in time


Example 4.3: Consider the initial-boundary value problem with interface: x = 0.5. and the jump conditions: [u] =1/2cos(t) as well as [α - βux] =1/3cos(t) Let T=[0,1]. then


( ) [ ]( ]

( )( ) ( ) [ ]

( ) ( ]

, 0,0.53

, 0.5,1

2 cos sin , 0,0.53

1 sin 0.5,12

x xx

x x

t x t xf x

x t x

β ∈= ∈ − ∈=

− + ∈


( )( ) [ ]

( ) ( ]

cos , 0,0.51 cos , 0.5,1 .2

x t xu x

x t x

∈= + ∈


In Figure 9, we plot the numerical solution for N = 80, t = 0.5, h = 1/80, k = 0.1. Table 4 shows the error converges to O(h2). Table 4 shows that the error converges to O(k2). Therefore, the truncation error has the second order of accuracy in space as well as in time.


α=1 α=0 α=1, t=1

N h ,Eh k∞ , ,

2 2

E / Eh k h k∞ ∞

,Eh k∞ , ,

2 2

E / Eh k h k∞ ∞

,ENh k , ,

2 2

E / EN Nh k h k

20 1/20 2.9061e-005 - 3.5815e-005 - 2.9061e-005 -

40 1/40 6.6497e-006 4.3702 7.8895e-006 4.5396 6.6497e-006 4.3702

80 1/80 1.6343e-006 4.0689 1.9151e-006 4.1196 1.6343e-006 4.0689

160 1/160 4.0802e-007 4.0054 4.7623e-007 4.0215 4.0802e-007 4.0054

320 1/320 1.0212e-007 3.9956 1.1903e-007 4.0010 1.0212e-007 3.9956




5. Conclusions In this paper, we have presented the Immersed Interface

Method (IIM) to solve one-dimensional elliptic and parabolic interface problems with discontinuous diffusion, advection, and reaction coefficients. We presented numerical examples that compute the approximate solution across a fixed interface and demonstrate how to modify a centered difference scheme at irregular points by adding the correction terms. The correction terms were obtained by deriving the truncation error and using the given jump conditions. The method of undetermined coefficients was used to obtain the (modified) coefficients of the scheme at irregular points.

The result is that we obtained the second order of accuracy for the scheme modified by IIM.

References [1] X. Feng and Z. Li, Simplified Immersed Interface Methods for

Elliptic Interface Problems with Straight Interfaces, Numerical Methods for Partial Differential Equations, 28 (2012), pp. 188-203.

[2] R. J. LeVeque, Finite difference methods for ordinary and partial differential equations: Steady-state and time-dependent problems, (2007).

[3] Zhilin Li, The immersed Interface method: A numerical approach for partial differential equation with interface, PhD thesis, Univerdity of Washington, 1994.

[4] Z. Li and K. Ito, The immersed interface method: numerical solutions of PDEs involving interfaces and irregular domains, vol. 33, Society for Industrial Mathematics, 2006.

the immersed interface method for elliptic and parabolic...

Documents