Skip to main content

On the numerical solution of hyperbolic IBVP with high-order stable finite difference schemes

Abstract

The abstract Cauchy problem for the hyperbolic equation in a Hilbert space H with self-adjoint positive definite operator A is considered. The third and fourth orders of accuracy difference schemes for the approximate solution of this problem are presented. The stability estimates for the solutions of these difference schemes are established. A finite difference method and some results of numerical experiments are presented in order to support theoretical statements.

MSC:65J10, 65M12, 65N12, 35L30.

1 Introduction

Partial differential equations of the hyperbolic type play an important role in many branches of science and engineering. For example, acoustics, electromagnetics, hydrodynamics, elasticity, fluid mechanics, and other areas of physics lead to partial differential equations of the hyperbolic type (see, e.g., [15] and the references given therein). The stability has been an important research topic in the development of numerical techniques for solving these equations (see [627]). Particularly, a convenient model for analyzing the stability is provided by a proper unconditionally absolutely stable difference scheme with an unbounded operator.

A large cycle of works on difference schemes for hyperbolic partial differential equations, in which stability was established under the assumption that the magnitude of the grid steps τ and h with respect to time and space variables are connected (see, e.g., [57] and the references therein). Of great interest is the study of absolute stable difference schemes of a high order of accuracy for hyperbolic partial differential equations, in which stability was established without any assumptions in respect of the grid steps τ and h. Such type stability inequalities for the solutions of the first order of accuracy difference scheme for the differential equations of hyperbolic type were established for the first time in [20].

It is known (see [25, 26]) that various initial boundary value problems for a hyperbolic equation can be reduced to the initial value problem

{ d 2 u ( t ) d t 2 + A u ( t ) = f ( t ) , 0 < t < T , u ( 0 ) = φ , u ( 0 ) = ψ ,
(1)

where A is a self-adjoint positive definite linear operator with the domain D(A) in a Hilbert space H.

A function u(t) is called a solution of problem (1) if the following conditions are satisfied:

  1. (i)

    u(t) is twice continuously differentiable on the segment [0,1]. The derivatives at the endpoints of the segment are understood as the appropriate unilateral derivatives.

  2. (ii)

    The element u(t) belongs to D(A) for all t[0,1] and the function Au(t) is continuous on the segment [0,1].

  3. (iii)

    u(t) satisfies the equations and the initial conditions (1).

In recent decades, many scientists have worked in the field of a finite difference method for the numerical solutions of hyperbolic PDEs and have published many scientific papers. For problem (1), the first and two types of second order difference schemes were presented and the stability estimates for the solution of these difference schemes and for the first- and second-order difference derivatives were obtained in [11]. The high order of accuracy two-step difference schemes generated by an exact difference scheme or by the Taylor decomposition on the three points for the numerical solution of the same problem were presented and the stability estimates for approximate solution of these difference schemes were obtained in [10]. However, the difference methods developed in these references are generated by square roots of A. This action is very difficult for the realization. Therefore, in spite of theoretical results, the role of their application to a numerical solution for an initial value problem is not great. In this paper, the third order of accuracy difference scheme

{ τ 2 ( u k + 1 2 u k + u k 1 ) + 2 3 A u k + 1 6 A ( u k + 1 + u k 1 ) + 1 12 τ 2 A 2 u k + 1 = f k , f k = 2 3 f ( t k ) + 1 6 ( f ( t k + 1 ) + f ( t k 1 ) ) f k = 1 12 τ 2 ( A f ( t k + 1 ) + f ( t k + 1 ) ) , 1 k N 1 , u 0 = φ , ( I + τ 2 12 A + τ 4 144 A 2 ) τ 1 ( u 1 u 0 ) = τ 2 A φ + ( I τ 2 12 A ) ψ + f 1 , 1 τ ,
(2)

and the fourth order of accuracy difference scheme

{ τ 2 ( u k + 1 2 u k + u k 1 ) + 5 6 A u k + 1 12 A ( u k + 1 + u k 1 ) τ 2 72 A 2 u k + τ 2 144 A 2 ( u k + 1 + u k 1 ) = f k , f k = 5 6 f ( t k ) + 1 12 ( f ( t k + 1 ) + f ( t k 1 ) ) + τ 2 72 ( A f ( t k ) + f ( t k ) ) f k = 1 144 τ 2 ( A ( f ( t k + 1 ) + f ( t k 1 ) ) + f ( t k + 1 ) + f ( t k 1 ) ) , 1 k N 1 , t k = k τ , N τ = 1 , u 0 = φ , ( I + τ 2 A 12 + τ 4 A 2 144 ) τ 1 ( u 1 u 0 ) = τ 2 A φ + ( I τ 2 A 12 ) ψ + f 2 , 2 τ
(3)

for the approximate solution of initial value problem (1) are constructed using the integer powers of the operator A, and stability estimates for the solution of these difference schemes are obtained. Here,

f 1 , 1 = ( I + τ 2 12 A + τ 4 144 A 2 ) τ 1 f 1 , 1 3 = { f ( 0 ) + ( f ( 0 ) + τ f ( 0 ) ) 1 2 2 f ( 0 ) τ 6 }
(4)

and

f 2 , 2 = ( I + τ 2 12 A + τ 4 144 A 2 ) τ 1 f 1 , 1 4 = { ( I τ 2 A 12 ) f ( 0 ) + ( ( I 5 τ 2 A 12 ) f ( 0 ) + τ f ( 0 ) ) 1 2 + ( A τ f ( 0 ) 2 f ( 0 ) + τ f ( 0 ) ) τ 6 + ( A f ( 0 ) 3 f ( 0 ) ) τ 2 24 } .
(5)

Some results of this paper without proof are accepted and will be published in 2013 (see [14]).

Note that boundary value problems for parabolic equations, elliptic equations, and equations of mixed type have been studied extensively by many scientists (see, e.g., [1727] and the references therein).

2 The stability estimates

In this section, construction of difference schemes (2), (3) and stability estimates for the solutions of these difference schemes are presented.

Let us obtain the third and fourth orders of approximation formulas for the solution of problem (1). If the function f(t) is not only continuous, but also continuously differentiable on [0,T], φD(A) and ψD( A 1 2 ), it is easy to show that (see [25]) the formula

u(t)=c(t)φ+s(t)ψ+ 0 t s(tλ)f(λ)dλ
(6)

gives a solution of problem (1). Throughout this paper, {c(t),t0} is a strongly continuous cosine operator-function defined by the formula

c(t)= e i t A 1 / 2 + e i t A 1 / 2 2 .
(7)

Then, from the definition of the sine operator-function

s(t)u= 0 t c(s)uds,
(8)

it follows that

s(t)= A 1 / 2 e i t A 1 / 2 e i t A 1 / 2 2 i .
(9)

For the theory of cosine operator-function, we refer to [25] and [27].

A uniform grid is considered on the segment [0,T]

[ 0 , T ] τ ={ t k =kτ,k=0,1,,N,Nτ=T}.
(10)

In the construction of two-step difference schemes for the solution of initial value problem (1), it is necessary to approximate differential equation (1) and the derivative u (0).

In the first step, the approximation of differential equation (1) is considered. Using Taylor’s decomposition on three points, the following formulas for the third order of approximation and the fourth order of approximation of (1) are obtained respectively:

(11)
(12)

Applying equation (1), one can write

u ( t k )=Au(t)+f(t), u ( 4 ) (t)=A u (t)+ f (t)= A 2 u(t)Af(t)+ f (t).
(13)

Using (11) and (13), the following formula:

(14)

for the third order of approximation of (1), and using (12), (13), the following formula

(15)

for the fourth order of approximation of (1) are obtained.

Neglecting the last small term, we get

τ 2 ( u k + 1 2 u k + u k 1 ) + 2 3 A u k + 1 6 A ( u k + 1 + u k 1 ) + 1 12 τ 2 A 2 u k + 1 = f k , f k = 2 3 f ( t k ) + 1 6 ( f ( t k + 1 ) + f ( t k 1 ) ) f k = 1 12 τ 2 ( A f ( t k + 1 ) + f ( t k + 1 ) )
(16)

and

(17)

for the third and fourth orders of approximations of (1), respectively.

In the second step, the approximation of u (0) is considered. Applying (6), we can write

u ( τ ) u ( 0 ) τ = c ( τ ) I τ φ+ s ( τ ) τ ψ+ 1 τ 0 τ s(τλ)f(λ)dλ.
(18)

From (18) it is obvious that for the approximation of u (0), it is necessary to approximate the expressions

s(τ),c(τ),and 1 τ 0 τ s(τλ)f(λ)dλ.
(19)

Using the definitions of s(τ), c(τ), and Padé fractions for the function e z (see [9]), the following approximation formulas are obtained:

c(τ)= R ( i τ B ) + R ( i τ B ) 2 +o ( τ 3 ) ,s(τ)= B 1 R ( i τ B ) R ( i τ B ) 2 i +o ( τ 3 )
(20)

for the third order of approximation of (1), where

R(iτB)=R=DE,R(iτB)= R ˜ = D ˜ E,
(21)

and

c ( τ ) = R ( i τ B ) + R ( i τ B ) 2 + o ( τ 4 ) , s ( τ ) = B 1 R ( i τ B ) R ( i τ B ) 2 i + o ( τ 4 )
(22)

for the fourth order of approximation of (1), where

R(iτB)=R=C C ˜ 1 ,R(iτB)= R ˜ = C ˜ C 1 .
(23)

Here B= A 1 / 2 and

Using (22), (20), (21), (23), we obtain the third order of approximations of s(τ) and c(τ)

(24)
(25)

and the fourth order of approximations of s(τ) and c(τ)

(26)
(27)

Let us remark that in constructing the approximation of u (0), it is important to know how to construct f 1 , 1 3 and f 1 , 1 4 such that

(28)
(29)

and formulas of f 1 , 1 3 and f 1 , 1 4 are sufficiently simple. The choice of f 1 , 1 3 and f 1 , 1 4 is not unique. Using Taylor’s formula and integration, we obtain the following formulas for the third order of approximation:

f 1 , 1 3 = { S τ ( τ ) f ( 0 ) + ( C τ ( τ ) f ( 0 ) + S τ ( τ ) f ( 0 ) ) τ 2 2 C τ ( τ ) f ( 0 ) τ 2 6 } = ( I + τ 2 12 A + τ 4 144 A 2 ) 1 { τ f ( 0 ) + ( f ( 0 ) + τ f ( 0 ) ) τ 2 2 f ( 0 ) τ 2 6 }
(30)

and for the fourth order of approximation

f 1 , 1 4 = { S τ ( τ ) f ( 0 ) + ( C τ ( τ ) f ( 0 ) + S τ ( τ ) f ( 0 ) ) τ 2 + ( A S τ ( τ ) f ( 0 ) 2 C τ ( τ ) f ( 0 ) + S τ ( τ ) f ( 0 ) ) τ 2 6 + ( A C τ ( τ ) f ( 0 ) 3 C τ ( τ ) f ( 0 ) ) τ 3 24 } = ( I + τ 2 12 A + τ 4 144 A 2 ) 1 { τ ( I τ 2 A 12 ) f ( 0 ) + ( ( I 5 τ 2 A 12 ) f ( 0 ) + τ f ( 0 ) ) τ 2 + ( A τ f ( 0 ) 2 f ( 0 ) + τ f ( 0 ) ) τ 2 6 + ( A f ( 0 ) 3 f ( 0 ) ) τ 3 24 } .
(31)

For simplicity, denote

f 1 , 1 =f(0)+ ( f ( 0 ) + τ f ( 0 ) ) 1 2 2 f (0) τ 6 ,
(32)

and

f 2 , 2 = { ( I τ 2 A 12 ) f ( 0 ) + ( ( I 5 τ 2 A 12 ) f ( 0 ) + τ f ( 0 ) ) 1 2 + ( A τ f ( 0 ) 2 f ( 0 ) + τ f ( 0 ) ) τ 6 + ( A f ( 0 ) 3 f ( 0 ) ) τ 2 24 } ,
(33)

where

f 1 , 1 3 =τ ( I + τ 2 12 A + τ 4 144 A 2 ) 1 f 1 , 1
(34)

and

f 1 , 1 4 =τ ( I + τ 2 12 A + τ 4 144 A 2 ) 1 f 2 , 2 .
(35)

Thus, we have the following formula for the approximation of u (0):

u 1 u 0 τ = c τ ( τ ) I τ φ+ s τ ( τ ) τ ψ+ f 1 , 1 m ,m=3,4.
(36)

Using the approximation formulas above, difference schemes (2) and (3) are constructed.

Now, we will obtain the stability estimates for the solution of difference scheme (2). We consider operators R, R ˜ by (21) and the following operators:

R 1 = ( 5 τ 4 144 A 2 + 7 τ 6 216 A 3 i τ A 1 / 2 ( I + τ 2 12 A + τ 4 144 A 2 ) I + 1 72 τ 4 A 2 ) × ( i τ A 1 / 2 ( I + 1 72 τ 4 A 2 ) ( I + τ 2 12 A + τ 4 144 A 2 ) ) 1 ,
(37)

and its conjugate R ˜ 1

(38)
(39)
(40)
(41)

and its conjugate R ˜ 5 ,

R 6 = ( I 1 3 τ 2 A + i τ A 1 / 2 I + 1 72 τ 4 A 2 ) × ( τ 2 2 A + τ 4 12 A 2 i τ A 1 / 2 I + 1 72 τ 4 A 2 ) 1 ,
(42)

and its conjugate R ˜ 6 .

Let us give one lemma, without proof, that will be needed below.

Lemma 1 The following estimates hold:

{ R H H 1 , R ˜ H H 1 , R 1 H H 1 , R ˜ 1 H H 1 , A 1 / 2 R 2 H H 1 , τ A 1 / 2 R 3 H H 1 , A 1 / 2 R 4 H H 1 , A 1 / 2 R 5 H H τ , A 1 / 2 R ˜ 5 H H τ , τ A 1 / 2 R 6 H H 1 , τ A 1 / 2 R ˜ 6 H H 1 .
(43)

Now, we will give the first main theorem of the present paper on the stability of difference scheme (2).

Theorem 1 Let φD(A), ψD( A 1 2 ), f 1 , 1 D( A 1 2 ). Then, for the solution of difference scheme (2), the following stability estimates hold:

(44)
(45)
(46)

where M does not depend on τ, φ, ψ, f 1 , 1 , and f s , 1sN1.

Proof First, we will obtain the formula for the solution of problem (1). It is clear that there exists a unique solution of the initial value problem

a u k 1 c u k +b u k + 1 = φ k ,1kN1, u 0 =φ, u 1 =ψ
(47)

and for the solution of (47), the following formula is satisfied (see [11]):

(48)

where R= q 1 = c + c 2 4 a b 2 b , R ˜ = q 2 = c c 2 4 a b 2 b . Here q 1 and q 2 are roots of equation (47), and a0, b0. We can rewrite (47) into the following difference problem:

Replacing a with (I+ τ 2 6 A), b with (I+ τ 2 6 A+ τ 4 12 A 2 ), c with (2 2 τ 2 3 A), and ψ with

φ+τ ( I + τ 2 12 A + τ 4 144 A 2 ) 1 ( τ 2 A φ + ( I τ 2 12 A ) ψ + τ f 1 , 1 ) ,

φ k with τ 2 f k and applying formula (48), we obtain the following formulas for u k , 2kN:

u k = 1 2 [ R ˜ 1 R k R 1 R ˜ k ] φ + 1 2 [ R ˜ k R k ] R 2 ψ + 1 2 [ R ˜ k R k ] R 3 τ 2 f 1 , 1 + 1 2 R 4 s = 1 k 1 [ R ˜ k s R k s ] f s τ 2 .
(49)

Second, we will prove estimates (44), (45), and (46). Using (43) and the formula for u 1 , and the following simple estimates:

(50)
(51)
(52)

we get

u 1 H ( I 5 12 τ 2 A + τ 4 144 A 2 ) ( I + τ 2 12 A + τ 4 144 A 2 ) 1 H H φ H + τ A 1 / 2 ( I τ 2 12 A ) ( I + τ 2 12 A + τ 4 144 A 2 ) 1 H H A 1 / 2 ψ H + τ A 1 / 2 ( I + τ 2 12 A + τ 4 144 A 2 ) 1 H H τ A 1 / 2 f 1 , 1 H φ H + 12 A 1 / 2 ψ H + 12 11 12 + 11 τ A 1 / 2 f 1 , 1 H M { s = 1 N 1 A 1 / 2 f s H τ + φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H } .

Applying A 1 / 2 to the formula for u 1 and using estimates (43), (50), (51), and (52), we get

A 1 / 2 u 1 H ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A 1 / 2 φ H + τ A 1 / 2 ( I τ 2 12 A ) ( I + τ 2 12 A + τ 4 144 A 2 ) 1 H H ψ H + τ A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H τ f 1 , 1 H A 1 / 2 φ H + 12 ψ H + 12 11 12 + 11 τ f 1 , 1 H M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H } .

Using the formula

u 1 u 0 τ = ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 × ( τ 2 A φ + ( I τ 2 12 A ) ψ + τ f 1 , 1 )
(53)

and estimates (43), (52), and the following simple estimates:

(54)
(55)

we get

u 1 u 0 τ H 1 2 τ A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A 1 / 2 φ H + ( I τ 2 12 A ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H ψ H + ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H τ f 1 , 1 H 6 11 12 + 11 A 1 / 2 φ H + ψ H + τ f 1 , 1 H M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H } .
(56)

Applying A 1 / 2 to (53) and using estimates (43), (52), (54), (55), we obtain

A 1 / 2 u 1 u 0 τ H τ 2 A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A φ H + ( I τ 2 12 A ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A 1 / 2 ψ H + ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H τ A 1 / 2 f 1 , 1 H 6 11 12 + 11 A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H } .
(57)

Applying A to the formula for u 1 and using estimates (43), (50), (51), (52), we get

A u 1 H ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A φ H + τ A 1 / 2 ( I τ 2 12 A ) ( I + τ 2 12 A + τ 4 144 A 2 ) 1 H H A 1 / 2 ψ H + τ A 1 / 2 ( I + 1 12 τ 2 A + 1 144 τ 4 A 2 ) 1 H H τ A 1 / 2 f 1 , 1 H A φ H + 12 A 1 / 2 ψ H + 12 11 12 + 11 τ A 1 / 2 f 1 , 1 H M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H } .
(58)

Using difference scheme (2) and formula (53), we obtain

u 2 2 u 1 + u 0 τ 2 = ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 × { ( I τ 2 A 3 5 τ 4 A 2 72 + τ 6 A 3 1 , 728 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 A φ τ ( A + 1 6 τ 2 A 2 ) ( I τ 2 12 A ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 ψ ( A + τ 2 A 2 6 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f 1 , 1 + f 1 } .
(59)

Using formula (59), estimates (43), (51), (52), (55), and the following simple estimates:

(60)
(61)

we have

(62)

So, for k=1, the following estimates are proved:

Now, we will establish these estimates for any k2. Using formula (49), estimate (43), and the triangle inequality, we obtain

u k H 1 2 ( R ˜ 1 H H R k H H + R 1 H H R ˜ k H H ) φ H + 1 2 ( A 1 / 2 R 2 H H R ˜ k H H + A 1 / 2 R 2 H H R k H H ) A 1 / 2 ψ H + 1 2 ( τ A 1 / 2 R 3 H H R ˜ k H H + τ A 1 / 2 R 3 H H R k H H ) τ A 1 / 2 f 1 , 1 H + 1 2 τ A 1 / 2 R 4 H H s = 1 k 1 [ R ˜ k s H H + R k s H H ] A 1 / 2 f s H τ M { s = 1 N 1 A 1 / 2 f s H τ + φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H }
(63)

for any k2. Combining the estimates u k H for any k, we obtain (44).

Applying A 1 / 2 to (49), using estimate (43) and the triangle inequality, we get

A 1 / 2 u k H 1 2 ( R ˜ 1 H H R k H H + R 1 H H R ˜ k H H ) A 1 / 2 φ H + 1 2 ( A 1 / 2 R 2 H H R ˜ k H H + A 1 / 2 R 2 H H R k H H ) ψ H + 1 2 ( τ A 1 / 2 R 3 H H R ˜ k H H + τ A 1 / 2 R 3 H H R k H H ) τ f 1 , 1 H + 1 2 τ A 1 / 2 R 4 H H s = 1 k 1 ( R ˜ k s H H + R k s H H ) f s H τ M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H }

for k2. Combining the estimates for A 1 / 2 u k H for any k, we obtain

max 1 k N A 1 / 2 u k H M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H } .
(64)

Applying formula (49), we get

u k u k 1 τ = 1 τ { 1 2 [ R ˜ 1 R 5 R k 1 R 1 R ˜ 5 R ˜ k 1 ] φ + 1 2 [ R ˜ 5 R ˜ k 1 R 5 R k 1 ] R 2 ψ + 1 2 [ R ˜ 5 R ˜ k 1 R 5 R k 1 ] R 3 τ 2 f 1 , 1 + 1 2 [ R ˜ R ] R 4 τ 2 f k 1 + 1 2 R 4 s = 1 k 2 [ R ˜ 5 R ˜ k 1 s R 5 R k 1 s ] f s τ 2 } .
(65)

Using (65), estimate (43), and the triangle inequality, we obtain

u k u k 1 τ H 1 τ { 1 2 ( A 1 / 2 R 5 H H R ˜ 1 H H R k 1 H H + A 1 / 2 R ˜ 5 H H R 1 H H R ˜ k 1 H H ) A 1 / 2 φ H + 1 2 ( A 1 / 2 R 2 H H A 1 / 2 R ˜ 5 H H R ˜ k 1 H H + A 1 / 2 R 2 H H A 1 / 2 R 5 H H R k 1 H H ) ψ H + 1 2 ( τ A 1 / 2 R 3 H H A 1 / 2 R ˜ 5 H H R ˜ k 1 H H + τ A 1 / 2 R 3 H H A 1 / 2 R 5 H H R k 1 H H ) × τ f 1 , 1 H + 1 2 ( τ A 1 / 2 R 4 H H R ˜ H H + τ A 1 / 2 R 4 H H R H H ) A 1 / 2 f k 1 H τ + 1 2 τ A 1 / 2 R 4 H H × s = 1 k 2 ( A 1 / 2 R ˜ 5 H H R ˜ k 1 s H H + A 1 / 2 R 5 H H R k 1 s H H ) f s H τ } M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H } .
(66)

Combining the estimates for τ 1 ( u k u k 1 ) H for any k, we obtain

max 1 k N 1 u k u k 1 τ H M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 1 , 1 H } .
(67)

From estimates (64), (67), estimate (45) follows.

Now, applying Abel’s formula to (65), we obtain

u k u k 1 τ = 1 τ { 1 2 [ R ˜ 1 R 5 R k 1 R 1 R ˜ 5 R ˜ k 1 ] φ + 1 2 [ R ˜ 5 R ˜ k 1 R 5 R k 1 ] R 2 ψ + 1 2 [ R ˜ 5 R ˜ k 1 R 5 R k 1 ] R 3 τ 2 f 1 , 1 + 1 2 [ R ˜ R ] R 4 τ 2 f k 1 + 1 2 R 4 τ 2 ( s = 2 k 2 [ R 5 R 6 R k 1 s R ˜ 5 R ˜ 6 R ˜ k 1 s ] ( f s f s 1 ) × [ R ˜ 5 R ˜ 6 R 5 R 6 ] f k 2 [ R ˜ 5 R ˜ 6 R ˜ k 2 R 5 R 6 R k 2 ] f 1 ) } , 2 k N .
(68)

Next, applying A 1 / 2 to formula (68) and using estimate (43) and the triangle inequality, we get

Combining the estimates for A 1 / 2 τ 1 ( u k u k 1 ) H for any k, we obtain

max 1 k N 1 A 1 / 2 u k u k 1 τ H M { s = 2 N 1 f s f s 1 H + f 1 H + A 1 / 2 ψ H + A φ H + τ A 1 / 2 f 1 , 1 H } .
(69)

Now, applying Abel’s formula to (49), we have

u k = 1 2 [ R ˜ 1 R k R 1 R ˜ k ] φ + 1 2 [ R ˜ k R k ] R 2 ψ + 1 2 [ R ˜ k R k ] R 3 τ 2 f 1 , 1 + 1 2 τ 2 R 4 ( s = 2 k 1 [ R 6 R k s R ˜ 6 R ˜ k s ] ( f s f s 1 ) + ( R ˜ 6 R 6 ) f k 1 [ R ˜ 6 R ˜ k 1 R 6 R k 1 ] f 1 ) , 2 k N .
(70)

Next, applying A to formula (70) and using (43) and the triangle inequality, we get

A u k H 1 2 ( R ˜ 1 H H R k H H + R 1 H H R ˜ k H H ) A φ H + 1 2 ( A 1 / 2 R 2 H H R ˜ k H H + A 1 / 2 R 2 H H R k H H ) A 1 / 2 ψ H + 1 2 ( τ A 1 / 2 R 3 H H R ˜ k H H + τ A 1 / 2 R 3 H H R k H H ) × τ A 1 / 2 f 1 , 1 H + 1 2 τ A 1 / 2 R 4 H H × ( s = 2 k 1 [ τ A 1 / 2 R 6 H H R k s H H + τ A 1 / 2 R ˜ 6 H H R ˜ k s H H ] × f s f s 1 H + ( τ A 1 / 2 R ˜ 6 H H + τ A 1 / 2 R 6 H H ) f k 1 H + [ τ A 1 / 2 R ˜ 6 H H R ˜ k 1 H H + τ A 1 / 2 R 6 H H R k 1 H H ] f 1 H ) M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H }

for k2. Combining the estimates for A u k H for any k, we obtain

max 1 k N A u k H M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 1 , 1 H } .
(71)

Now, applying formula (49), we get

u k + 1 2 u k + u k 1 τ 2 = 1 τ 2 { 1 2 [ R ˜ 1 R 5 2 R k 1 R 1 R ˜ 5 2 R ˜ k 1 ] φ + 1 2 [ R ˜ 5 2 R ˜ k 1 R 5 2 R k 1 ] R 2 ψ + 1 2 [ R ˜ 5 2 R ˜ k 1 R 5 2 R k 1 ] R 3 τ 2 f 1 , 1 + 1 2 [ R ˜ R ] R 4 τ 2 f k + 1 2 ( R ˜ 5 2 R 5 2 ) R 4 τ 2 f k 1 + 1 2 R 4 s = 1 k 2 [ R ˜ 5 2 R ˜ k 1 s R 5 2 R k 1 s ] f s τ 2 } .
(72)

First, applying Abel’s formula to (72), we have

(73)

Second, using formulas (73), (43), and the triangle inequality, we get

(74)

Combining the estimates for τ 1 ( u k + 1 2 u k + u k 1 ) H for any k, we obtain

(75)

From estimates (69), (71), and (75), we obtain (46). Theorem 1 is proved. □

Now, we will obtain the stability estimates for the solution of difference scheme (3). We consider operators R, R ˜ by (23) and the following operators:

which will be used in the sequel. It is obvious that J 1 , J ˜ 1 , and J 2 , J ˜ 2 , and J 3 , J ˜ 3 , and J 4 , J ˜ 4 are conjugates.

Let us give one lemma, without proof, that will be needed below.

Lemma 2 The following estimates hold:

{ R H H 1 , R ˜ H H 1 , J 1 H H 1 , J ˜ 1 H H 1 , τ A 1 / 2 J 2 H H 1 , τ A 1 / 2 J ˜ 2 H H 1 , A 1 / 2 J 3 H H τ , A 1 / 2 J ˜ 3 H H τ , τ A 1 / 2 J 4 H H 1 , τ A 1 / 2 J ˜ 4 H H 1 .
(76)

Now, we will give the first main theorem of the present paper on the stability of difference scheme (3).

Theorem 2 Let φD(A), ψD( A 1 2 ), f 2 , 2 D( A 1 2 ). Then, for the solution of difference scheme (3), the following stability estimates hold:

(77)
(78)
(79)

where M does not depend on τ, φ, ψ, f 2 , 2 , and f s , 1sN1.

Proof First, we will obtain the formula for the solution of problem (1). In exactly the same manner as in Theorem 1, one establishes formula (48) for the solution of initial value problem (47).

We can rewrite (47) into the following difference problem:

(80)

Replacing a with (I+ τ 2 A 12 + τ 4 A 2 144 ), b with (I+ τ 2 A 12 + τ 4 A 2 144 ), c with

( 2 5 τ 2 A 6 + τ 4 A 2 72 ) ,

and ψ with

φ+τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 ( τ 2 A φ + ( I τ 2 A 12 ) ψ + τ f 2 , 2 ) ,

φ k with τ 2 f k and applying formula (48), we obtain the following formula for u k , 2kN:

u k = 1 2 [ R k + R ˜ k ] φ + 1 2 [ R ˜ k R k ] i A 1 / 2 ψ + ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 ( R ˜ R ) 1 [ R ˜ k R k ] τ 2 f 2 , 2 + ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 ( R ˜ R ) 1 s = 1 k 1 [ R ˜ k s R k s ] τ 2 f s .
(81)

Now, we will prove estimates (77), (78), and (78). First, using the formula of difference scheme (3), we obtain the formula

u 1 + u 0 2 = ( I τ 2 A 6 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 φ + 1 2 ( I τ 2 A 12 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ ψ + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f 2 , 2 .
(82)

Using estimates (76), the formula for u 1 + u 0 2 , and the following simple estimates:

(83)
(84)
(85)

we get

Applying A 1 / 2 to the formula for u 1 + u 0 2 and using estimates (76), (83), (84), and (85), we obtain

Applying A to the formula for u 1 + u 0 2 and using estimates (76), (83), (84), and (85), we have

A u 1 + u 0 2 H ( I τ 2 A 6 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × A φ H + 1 2 τ A 1 / 2 ( I τ 2 A 12 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × A 1 / 2 ψ H + 1 2 τ A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H τ A 1 / 2 f 2 , 2 H A φ H + 6 A 1 / 2 ψ H + 6 11 12 + 11 τ A 1 / 2 f 2 , 2 H M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 2 , 2 H } .
(86)

Using the formula for the solution of difference scheme (3), we obtain

u 2 u 0 2 τ = τ A 2 ( I τ 2 A 6 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 2 φ + ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I τ 2 12 A ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 2 ψ + ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 2 τ f 2 , 2 + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ f 1 .
(87)

Using formula (87), estimates (76), (83), (85), and the following simple estimates:

(88)
(89)
(90)

we get

(91)

Applying A 1 / 2 to (87) and using estimates (76), (85), (89), (90), we obtain

A 1 / 2 u 2 u 0 2 τ H ( I τ 2 A 6 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 × τ A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A φ H + ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × ( I τ 2 12 A ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H A 1 / 2 ψ H + ( I 5 τ 2 A 12 + τ 4 A 2 144 ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H τ A 1 / 2 f 2 , 2 H + 1 2 τ A 1 / 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H f 1 H 12 11 12 + 11 A φ H + 6 11 12 + 11 f 1 H + A 1 / 2 ψ H + τ A 1 / 2 f 2 , 2 H M { s = 2 N 1 f s f s 1 H + f 1 H + A φ H + A 1 / 2 ψ H + τ A 1 / 2 f 2 , 2 H } .
(92)

So, for k=1, the following estimates are proved:

Now, we will establish these estimates for any k2. Using formula (81), we obtain

u k + u k 1 2 = 1 2 [ J 1 R k 1 + J ˜ 1 R ˜ k 1 ] φ + 1 2 [ J ˜ 1 R ˜ k 1 J 1 R k 1 ] i A 1 / 2 ψ + 1 2 [ J ˜ 2 R ˜ k 1 J 2 R k 1 ] τ 2 f 2 , 2 + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f k 1 + 1 2 s = 1 k 2 [ J ˜ 2 R ˜ k 1 s J 2 R k 1 s ] τ 2 f s .
(93)

Using formula (93), estimate (76), and the triangle inequality, we get

for any k2. Combining the estimates u k + u k 1 2 H for any k, we obtain (77).

Applying A 1 / 2 to (93), using estimate (76) and the triangle inequality, we get

for k2. Combining the estimates for A 1 / 2 u k + u k 1 2 H for any k, we get

(94)

Now, applying Abel’s formula to (93), we obtain

u k + u k 1 2 = 1 2 [ J 1 R k 1 + J ˜ 1 R ˜ k 1 ] φ + 1 2 [ J ˜ 1 R ˜ k 1 J 1 R k 1 ] i A 1 / 2 ψ + 1 2 [ J ˜ 2 R ˜ k 1 J 2 R k 1 ] τ 2 f 2 , 2 + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f k 1 + 1 2 A 1 ( s = 2 k 2 [ R ˜ k s + R k s ] ( f s f s 1 ) + ( R ˜ + R ) f k 2 ( R ˜ k 1 + R k 1 ) f 1 ) .
(95)

Applying A to formula (95), using estimate (76) and the triangle inequality, we get

Combining the estimates for A u k + u k 1 2 H for any k, we obtain

max 1 k N 1 A u k + u k 1 2 H M { s = 2 N 1 f s f s 1 H + f 1 H + A 1 / 2 ψ H + A φ H + τ A 1 / 2 f 2 , 2 H } .
(96)

Using formula (81), we get

u k + 1 u k 1 2 τ = 1 2 τ [ J 3 R k 1 + J ˜ 3 R ˜ k 1 ] φ + 1 2 τ [ J ˜ 3 R ˜ k 1 J 3 R k 1 ] i A 1 / 2 ψ + 1 2 τ [ R ˜ k + R k ] ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f 2 , 2 + 1 2 τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f k + 1 2 τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 [ R ˜ + R ] τ 2 f k 1 + 1 2 τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 s = 1 k 2 [ R ˜ k s + R k s ] f s τ 2 .
(97)

Next, using formula (97), estimate (76), and the triangle inequality, we obtain

u k + 1 u k 1 2 τ H 1 2 τ ( A 1 / 2 J 3 H H R k 1 H H + A 1 / 2 J ˜ 3 H H R ˜ k 1 H H ) A 1 / 2 φ H + 1 2 | i | ( A 1 / 2 J ˜ 3 H H R ˜ k 1 H H + A 1 / 2 J 3 H H R k 1 H H ) ψ H + 1 2 ( R ˜ k H H + R k H H ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × f 2 , 2 H τ + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H f k H τ + 1 2 ( R ˜ H H + R H H ) ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × f k 1 H τ + 1 2 ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 H H × s = 1 k 2 ( R ˜ k s H H + R k s H H ) f s H τ M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 2 , 2 H } .
(98)

Combining the estimates for u k + 1 u k 1 2 τ H for any k, we get

max 1 k N 1 u k + 1 u k 1 2 τ H M { s = 1 N 1 f s H τ + A 1 / 2 φ H + ψ H + τ f 2 , 2 H } .
(99)

From estimates (94) and (99), we obtain (78).

Now, applying Abel’s formula to (97), we have

u k + 1 u k 1 2 τ = 1 2 τ [ J 3 R k 1 + J ˜ 3 R ˜ k 1 ] φ + 1 2 τ [ J ˜ 3 R ˜ k 1 J 3 R k 1 ] i A 1 / 2 ψ + 1 2 τ [ R ˜ k + R k ] ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f 2 , 2 + 1 2 τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 τ 2 f k + 1 2 τ ( I + τ 2 A 12 + τ 4 A 2 144 ) 1 [ R ˜ + R ] τ 2 f k 1 + 1 2 τ s = 2 k 2 [ J ˜ 2 R ˜ k s + J 2 R k s ] ( f s f s 1 ) 1 2 τ [ J ˜ 2 R ˜ + J 2 R ] f k 2 + 1 2 τ [ J ˜ 2 R ˜ k 1 + J 2 R k 1 ] f 1 } , 2 k N .
(100)

Next, applying A 1 / 2 to formula (100), using estimate (76) and the triangle inequality, we obtain

Combining the estimates for A 1 / 2 u k + 1 u k 1 2 τ H for any k, we get

(101)

From estimates (96) and (101), estimate (78) follows. Theorem 2 is proved. □

3 Numerical analysis

In the present section, finite difference method is used and two numerical examples and some numerical results are presented in order to support our theoretical statements.

Generally, we have not been able to determine a sharp estimate for the constant figuring in the stability inequalities. However, the numerical results are presented by considering the Cauchy problem

{ 2 u ( t , x ) t 2 2 u ( t , x ) x 2 = 2 e t sin x , 0 < t < 1 , 0 < x < π , u ( 0 , x ) = sin x , 0 x π , u t ( 0 , x ) = sin x , 0 x π , u ( t , 0 ) = u ( t , π ) = 0 , 0 t 1 ,
(102)

for a one-dimensional hyperbolic equation. The exact solution of this problem is u(t,x)= e t sinx.

We consider the set [ 0 , 1 ] τ × [ 0 , π ] h of a family of grid points depending on the small parameters τ and h: [ 0 , 1 ] τ × [ 0 , π ] h ={( t k , x n ): t k =kτ,0kN,Nτ=1, x n =nh,0nM,Mh=π}. First, for the approximate solution of problem (102), we have applied the third and fourth orders of accuracy difference schemes respectively.

First, let us consider the third order of accuracy in time difference scheme for the approximate solution of Cauchy problem (102). Using difference scheme (2), we obtain

{ u n k + 1 2 u n k + u n k 1 τ 2 2 3 ( u n + 1 k 2 u n k + u n 1 k h 2 ) 1 6 ( u n + 1 k + 1 2 u n k + 1 + u n 1 k + 1 h 2 + u n + 1 k 1 2 u n k 1 + u n 1 k 1 h 2 ) + τ 2 12 ( u n + 2 k + 1 4 u n + 1 k + 1 + 6 u n k + 1 4 u n 1 k + 1 + u n 2 k + 1 h 4 ) = φ n k , φ n k = ( 4 3 exp ( t k ) + 1 3 ( exp ( t k + 1 ) + exp ( t k 1 ) ) ) sin ( x n ) , t k = k τ , 1 k N 1 , N τ = 1 , x n = n h , 2 n M 2 , M h = π , u n 0 = φ n 0 , φ n 0 = sin ( x n ) , 0 n M , u n 1 u n 0 τ 2 12 ( ( u n + 1 1 u n + 1 0 ) 2 ( u n 1 u n 0 ) + ( u n 1 1 u n 1 0 ) h 2 ) + τ 4 144 ( u n + 2 1 u n + 2 0 4 ( u n + 1 1 u n + 1 0 ) + 6 ( u n 1 u n 0 ) h 4 4 ( u n 1 1 u n 1 0 ) + u n 2 1 u n 2 0 h 4 ) = φ n N , φ n N = τ 2 2 A sin ( x n ) + τ ( I τ 2 12 A ) ( sin ( x n ) ) + f 1 , 1 τ , 2 n M 2 , f 1 , 1 = ( f ( 0 ) + ( f ( 0 ) + τ f ( 0 ) ) 1 2 2 f ( 0 ) τ 6 ) , u 0 k = u M k = 0 , 0 k N , u 3 k = 4 u 2 k 5 u 1 k , u M 3 k = 4 u M 2 k 5 u M 1 k , 0 k N ,
(103)

for the approximate solution of Cauchy problem (102). We have (N+1)×(N+1) system of linear equations in (103) which can be written in the matrix form as follows:

A u n + 2 + B u n + 1 + C u n + D u n 1 + E u n 2 = R φ n , 2 n M 2 , u 0 = u M = 0 ˜ , u 3 k = 4 u 2 k 5 u 1 k , u M 3 k = 4 u M 2 k 5 u M 1 k , 0 k N ,
(104)

where

(105)
(106)
(107)
(108)
(109)
(110)
(111)
(112)

and

u s k = [ u s 0 u s 1 u s N ] ( N + 1 ) × 1 ,0kN,s=n2,n1,n,n+1,n+2.
(113)

Note that

(114)
(115)
(116)
(117)
(118)

For a solution of difference equation (103), we have applied the procedure of the modified Gauss elimination method with respect to n with matrix coefficients. Therefore, we seek a solution of the matrix equation by using the following iteration formula:

u n = α n + 1 u n + 1 + β n + 1 u n + 2 + γ n + 1 ,n=M2,,2,1,0,
(119)

where α j , β j (j=1,,M) are (N+1)×(N+1) square matrices and γ j are (N+1)×1 column matrices. Now, we obtain the formulas of α n + 1 , β n + 1 , γ n + 1 as

(120)

for n=2:M2 and α 1 , β 1 , γ 1 , α 2 , β 2 , γ 2

(121)
(122)
(123)

and u M = 0 ˜ . Applying the formulas

(124)

we get

(4I α M 2 )( α M 1 u M 1 + γ M 1 )(5I+ β M 1 ) u M 1 = γ M 2 .
(125)

From that, it follows

u M 1 = [ ( β M 2 + 5 I ) ( 4 I α M 2 ) α M 1 ] 1 [ ( 4 I α M 2 ) γ M 1 γ M 2 ] .
(126)

Thus, using the formulas and matrices above, the third order of approximation difference scheme with matrix coefficients for the approximate solution of Cauchy problem (102) is obtained.

Second, let us consider the fourth order of accuracy in time difference scheme (3) for the approximate solution of Cauchy problem (102).

Using difference scheme (3), we obtain

{ u n k + 1 2 u n k + u n k 1 τ 2 5 6 ( u n + 1 k 2 u n k + u n 1 k h 2 ) 1 12 ( u n + 1 k + 1 2 u n k + 1 + u n 1 k + 1 h 2 + u n + 1 k 1 2 u n k 1 + u n 1 k 1 h 2 ) τ 2 72 ( u n + 2 k 4 u n + 1 k + 6 u n k 4 u n 1 k + u n 2 k h 4 ) + τ 2 144 ( u n + 2 k + 1 4 u n + 1 k + 1 + 6 u n k + 1 4 u n 1 k + 1 + u n 2 k + 1 h 4 + u n + 2 k 1 4 u n + 1 k 1 + 6 u n k 1 4 u n 1 k 1 + u n 2 k 1 h 4 ) = φ n k , φ n k = ( 5 3 ( exp ( t k ) ) + 1 6 ( exp ( t k + 1 ) + exp ( t k 1 ) ) ) sin ( x n ) , t k = k τ , 1 k N 1 , N τ = 1 , x n = n h , 1 n M 1 , M h = π , u n 0 = φ n 0 , φ n 0 = sin ( x n ) , 0 n M , u n 1 u n 0 τ 2 12 ( ( u n + 1 1 u n + 1 0 ) 2 ( u n 1 u n 0 ) + ( u n 1 1 u n 1 0 ) h 2 ) + τ 4 144 ( u n + 2 1 u n + 2 0 4 ( u n + 1 1 u n + 1 0 ) + 6 ( u n 1 u n 0 ) h 4 4 ( u n 1 1 u n 1 0 ) + u n 2 1 u n 2 0 h 4 ) = φ n N , φ n N = τ 2 2 A sin ( x n ) + τ ( I τ 2 12 A ) ( sin ( x n ) ) + τ f 2 , 2 , f 2 , 2 = ( I τ 2 A 12 ) f ( 0 ) τ ( ( I 5 τ 2 A 12 ) τ f ( 0 ) ) τ 2 f 2 , 2 = + ( A τ f ( 0 ) 2 f ( 0 ) + τ f ( 0 ) ) τ 2 6 + ( A f ( 0 ) 3 f ( 0 ) ) τ 3 24 , 2 n M 2 , u 0 k = u M k = 0 , 0 k N , u 3 k = 4 u 2 k 5 u 1 k , u M 3 k = 4 u M 2 k 5 u M 1 k , 0 k N ,
(127)

for an approximate solution of Cauchy problem (102). We have again the same (N+1)×(N+1) system of linear equations (104), where

(128)
(129)
(130)
(131)
(132)

and

(133)
(134)
(135)

Note that

(136)
(137)
(138)
(139)

For the solution of difference equation (127), we use exactly the same method that we have used for the solution of difference equation (103). Thus, using the formulas and matrices above, the fourth order of approximation difference scheme with matrix coefficients for the approximate solution of Cauchy problem (102) is obtained. The implementations of the numerical experiments are carried out by Matlab.

The errors are computed by the following formula:

E M N = max 1 k N 1 , 1 k M 1 |u( t k , x n ) u n k |.
(140)

Here, u( t k , x n ) represents the exact solution and u n k represents the numerical solution at ( t k , x n ). The errors are presented in Table 1.

Table 1 Errors for the approximate solutions of problem ( 102 )

In the table, the results are presented for different M and N values which are the step numbers for time and space variables respectively.

References

  1. Lamb H: Hydrodynamics. Cambridge University Press, Cambridge; 1993.

    MATH  Google Scholar 

  2. Lighthill J: Waves in Fluids. Cambridge University Press, Cambridge; 1978.

    MATH  Google Scholar 

  3. Hudson JA Cambridge Monographs on Mechanics and Applied Mathematic. In The Excitation and Propagation of Elastic Waves. Cambridge University Press, Cambridge; 1980.

    Google Scholar 

  4. Jones DS Oxford Science Publications. In Acoustic and Electromagnetic Waves. The Clarendon Press/Oxford University Press, New York; 1986.

    Google Scholar 

  5. Taflove A: Computational Electrodynamics: the Finite-Difference Time-Domain Method. Artech House, Boston; 1995.

    MATH  Google Scholar 

  6. Ciment M, Leventhal SH: A note on the operator compact implicit method for the wave equation. Math. Comput. 1978, 32(141):143-147. 10.1090/S0025-5718-1978-0483507-7

    Article  MATH  MathSciNet  Google Scholar 

  7. Gustafson B, Kreiss HO, Oliger J: Time Dependent Problems and Difference Methods. Wiley, New York; 1995.

    Google Scholar 

  8. Sapagovas M: On stability of the finite difference schemes for parabolic equations with nonlocal condition. J. Comput. Appl. Math. 2003, 1(1):89-98.

    Google Scholar 

  9. Ashyralyev A, Sobolevskii PE 148. In New Difference Schemes for Partial Differential Equations, Operator Theory: Advances and Applications. Birkhäuser, Basel; 2004.

    Chapter  Google Scholar 

  10. Ashyralyev A, Sobolevskii PE: Two new approaches for construction of the high order of accuracy difference schemes for hyperbolic differential equations. Discrete Dyn. Nat. Soc. 2005, 2(1):183-213.

    Article  MathSciNet  Google Scholar 

  11. Ashyralyev A, Sobolevskii PE: A note on the difference schemes for hyperbolic equations. Abstr. Appl. Anal. 2001, 6(2):63-70. 10.1155/S1085337501000501

    Article  MATH  MathSciNet  Google Scholar 

  12. Ashyralyev A, Aggez N: Finite difference method for hyperbolic equations with the nonlocal integral condition. Discrete Dyn. Nat. Soc. 2011., 2011: Article ID 562385

    Google Scholar 

  13. Ashyralyev A, Yildirim O: A note on the second order of accuracy stable difference schemes for the nonlocal boundary value hyperbolic problem. Abstr. Appl. Anal. 2012., 2012: Article ID 846582

    Google Scholar 

  14. Ashyralyev, A, Yildirim, O: High order accurate difference schemes for hyperbolic IBVP. Lecture Notes in Computer Science (accepted)

  15. Ashyralyev A, Yildirim O: On multipoint nonlocal boundary value problems for hyperbolic differential and difference equations. Taiwan. J. Math. 2010, 14(1):165-194.

    MATH  MathSciNet  Google Scholar 

  16. Ashyralyev A, Koksal ME, Agarwal RP: A difference scheme for Cauchy problem for the hyperbolic equation with self-adjoint operator. Math. Comput. Model. 2010, 52(1-2):409-424. 10.1016/j.mcm.2010.03.012

    Article  MATH  MathSciNet  Google Scholar 

  17. Ashyralyev A, Gercek O: On second order of accuracy difference scheme of the approximate solution of non-local elliptic-parabolic problems. Abstr. Appl. Anal. 2010., 2010: Article ID 705172

    Google Scholar 

  18. Ozdemir Y, Kucukunal M: A note on nonlocal boundary value problems for hyperbolic Schrödinger equations. Abstr. Appl. Anal. 2012., 2012: Article ID 687321

    Google Scholar 

  19. Simos TE: A finite-difference method for the numerical solution of the Schrödinger equation. J. Comput. Appl. Math. 1997, 79(4):189-205.

    Article  MATH  MathSciNet  Google Scholar 

  20. Sobolevskii PE, Chebotaryeva LM: Approximate solution by method of lines of the Cauchy problem for an abstract hyperbolic equations. Izv. Vysš. Učebn. Zaved., Mat. 1977, 5: 103-116. (in Russian)

    Google Scholar 

  21. Sobolevskii PE: Difference Methods for the Approximate Solution of Differential Equations. Izdat. Gosud. Univ., Voronezh; 1975.

    Google Scholar 

  22. Mitchell AR, Griffiths DF: The Finite Difference Methods in Partial Differential Equations. Wiley, New York; 1980.

    Google Scholar 

  23. Lax PD, Wendroff B: Difference schemes for hyperbolic equations with high order of accuracy. Commun. Pure Appl. Math. 1964, 17: 381-398. 10.1002/cpa.3160170311

    Article  MATH  MathSciNet  Google Scholar 

  24. Samarskii AA, Lazarov RD, Makarov VL: Difference Schemes for Differential Equations with Generalized Solutions. Vysshaya Shkola, Moscow; 1987. (in Russian)

    Google Scholar 

  25. Fattorini HO North-Holland Mathematics Studies 108. In Second Order Linear Differential Equations in Banach Spaces. North-Holland, Amsterdam; 1985.

    Google Scholar 

  26. Krein SG: Linear Differential Equations in a Banach Space. Nauka, Moscow; 1966.

    Google Scholar 

  27. Piskarev S, Shaw Y: On certain operator families related to cosine operator function. Taiwan. J. Math. 1997, 1(4):3585-3592.

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Prof. Dr. P. E. Sobolevskii for his helpful suggestions to the improvement of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ozgur Yildirim.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

OY carried out the studies, participated in the sequence alignment and drafted the manuscript and AA carried out the studies, participated in the sequence alignment.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Ashyralyev, A., Yildirim, O. On the numerical solution of hyperbolic IBVP with high-order stable finite difference schemes. Bound Value Probl 2013, 29 (2013). https://doi.org/10.1186/1687-2770-2013-29

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-2770-2013-29

Keywords