Abstract

This paper is concerned with accurate and efficient numerical methods for solving viscous and nonviscous wave problems. The paper first introduces a new second-order PR-ADI like scheme. For an efficient simulation, the scheme is also extended to a high-order compact PRADI like method. Both of them have the advantages of unconditional stability, less impact of the perturbing terms on the accuracy, and being convenient to compute the boundary values of the intermediates. Besides this, the compact scheme has high-order accuracy and costs less in computational time. Numerical results are presented to show the accuracy and efficiency of the new algorithms.

1. Introduction

In this paper, we consider the following differential problem with initial and boundary conditions on domain : where , and are nonnegative constants, and , denotes the source, and , and are given functions, and is the boundary of the domain .

Equations (1)–(3) govern various physical phenomena by choosing the coefficients. When and , the equation represents standard heat transfer, and when and , the equation represents standard wave equations. Since there are many efficient algorithms known for them, we exclude their consideration.

Some conventional numerical approaches for solving wave equations introduce auxiliary variables to rewrite the equations as first-order hyperbolic systems [13]; however, these approaches introduce new unknowns which results in an increase in the number of variables in the discrete problems. Thus, there are advantages in keeping the formulation (1)–(3) involving the second time-derivative and a scalar unknown. It has been the case that it is hard to construct methods combining good stability with high accuracy with this formulation [4].

This paper is concerned with numerical solutions to viscous and nonviscous nonhomogeneous wave problems. The wave equation is often solved by explicit time-stepping schemes, which require to choose a time step size sufficiently small to satisfy the stability condition and to reduce numerical dispersion as well. As is well known, the alternating direction implicit (ADI) schemes [314] are unconditionally stable and only need to solve a sequence of tridiagonal linear systems. In 1955, Peaceman and Rachford Jr. [15] presented a method to solve two-dimensional parabolic equations. When constructing the difference scheme, they first evaluated the derivative with respect to implicitly, the derivative with respect to explicitly and used a time step of to get a scheme, then took another half step with explicit in and implicit in to get another scheme. The final two-step scheme, called Peaceman and Rachford (PR) scheme, is unconditionally stable and second-order accurate. Alternative conventional approaches for solving wave equations introduce an auxiliary variable to rewrite the equation as a first-order hyperbolic system. With these approaches one introduces new unknowns, which result in an increase in the number of variables in the discrete problems. Thus, there are good reasons to try to keep the formulation involving the second time-derivative and a scalar unknown. Lim et al. [11] introduce a stable three-level locally one-dimensional (LOD) method for solving (1)–(3), which is second-order in space.

In the context of high order finite difference methods, compact schemes feature high-order accuracy and small stencils. Recently, there has been a renewed interest in the development and the application of compact finite difference methods for the numerical solution of the differential equations [810, 12, 14]. To obtain satisfactory higher order numerical results with reasonable computational cost, there have been attempts to develop higher order compact ADI methods.

In this paper, we propose a new set of ADI methods for viscous and nonviscous wave problems. In Section 3, we obtain a new PR ADI-like scheme with truncation error and analyze the error estimate by discrete energy method. In Section 4, we further extend the method to compact PR ADI-like scheme with truncation error . In Section 5, we provide two numerical examples to illustrate the effectiveness of the scheme. We also compare the two methods with some other schemes and the results show that they have much higher efficiency.

2. Notation

The domain is divided into a mesh by points , denoted by , where is the spatial mesh size in both and directions. Let , with being the time increment. Denote the values of and by and , respectively. Denote also the difference solutions to and by and , respectively.

Assume that , and . For and , denote by For , define their discrete inner product and norms as follows:

3. The New Second-Order ADI Scheme for Two-Dimensional Problems

In this section, we derive a new second-order ADI method for the numerical solution of the differential problems (1)–(3).

3.1. Construction of the New ADI Scheme

Introducing , we can rewrite (1) as follows: where .

Applying Crank-Nicolson implicit discretization to (6), we have

From (10), we obtain Let then (11) can be reorganized as Adding perturbing term to the left hand side of (14), we factor (14) as Introducing the intermediate variable , we obtain the PR ADI-like scheme as follows: From (16), (17), we get the boundary equation as follows: But usually we compute the boundary values of the intermediate variable using the following simple equality: where .

We see that schemes (16)–(20) can solve differential problems (1)–(3). In addition, following the idea of Douglas ([2, 3]), a Douglas-like scheme is as follows: The intermediate value of on the boundary is easy to be obtained from (22). PR ADI-like scheme (16)–(18) and Douglas-like scheme (21)-(22) are all derived from equation (15), but PR ADI-like scheme has more efficiency, which will be found in numerical experiment.

3.2. Error Estimate

We have derived a new kind of ADI scheme in Section 3.1. We further analyze the error of the scheme starting from (15). Expanding (15), we get Discretizing (6) as above and letting , we obtain the error equations as follows: where the truncation errors Hence there exist positive constants such that

Lemma 1 (see [1]). For , the following equalities hold:

From Lemma 1 and Cauchy-Schwarz inequality, multiplying to both sides of (24), computing the inner product, it is easy to follow that Multiplying to both sides of the result derived from (29), we have Summing for to both sides of (30), we obtain noticing that , by Gronwall Lemma, we obtain the following theorem.

Theorem 2. Assume that are the accurate solutions of (6)–(9) with sufficient smoothness and are the difference solutions of (16)–(18). Let , then there exists a positive constant independent of and , such that

4. Generalized Compact ADI Scheme

In this section, we extend the method to compact ADI scheme for the numerical solution of the wave problems (1)–(3).

4.1. Construction of the Compact ADI Scheme

Introducing We can rewrite (6) as follows:

Using the fourth-order compact finite difference discretization [6, 8], we discretize (33) as follows:

The Crank-Nicolson implicit discretization of (34) reads where . Multiplying (36) by , applying to its both sides with , and using the fact that the two operators and commute with each other, we obtain the implicit approximation of (6)–(9) Let then (37) can be conveniently written as Adding perturbing term to the left hand side of (40) and introducing the intermediate variable , we obtain the compact PR ADI-like scheme as follows: From (41) and (42), we obtain the boundary equation as follows: But usually we compute the boundary values of the intermediate using the following simple equality: where . In addition, following the idea of Douglas [2, 3], we can get a compact Douglas scheme as follows: The intermediate value of on the boundary is easy to be obtained from (47).

4.2. Error Estimate

We have derived a kind of compact PR ADI-like scheme in Section 4.1. In the following, we further analyze the error of the scheme. Expanding (41)-(42), we get Noting that , (48) can be written as Discretizing (6) as above and letting , we obtain the error equations as follows: where the truncation errors Hence there exist positive constants such that

Lemma 3 (see [1]). For , the following inequalities hold:

From Lemmas 1 and 3 and Cauchy-Schwarz inequality, multiplying to both sides of (50) and computing the inner product, we have

Multiplying to both sides of the result derived from (55), we have Summing for to both sides of (56), and by Lemma 3, we obtain Noticing that , by Gronwall Lemma, we obtain the following theorem.

Theorem 4. Assume that are the accurate solutions of (6)–(9) with sufficient smoothness and are the difference solutions of (41)–(43). Let , then there exists a positive constant independent of and , such that

5. Numerical Experiment

In this section, we exemplify two numerical examples to illustrate the effectiveness of the present ADI scheme. Lele [9] discussed some finite differencing errors for first and second derivatives by establishing the relationship of wave number (for differential equation) and numerical wave number (for difference scheme) and indicated that standard Pade scheme (which is known as compact finite difference scheme in this paper) is a good choice to discrete differential equations. In this paper, we focus on the efficient alternating direction technique for solving second-order wave equations. Because the compact method in spatial direction is standard, the scheme is effective.

The computer language used for the programming is Fortran, and the programs are performed on professional computer (CPU is 3.10 GHz, and Memory is 3.47 G). For convenience, we denote the present second-order ADI scheme (16)–(18) by PR, the present compact ADI scheme (41)–(43) by CPR, the second-order ADI scheme (21)–(22) by Dou, the compact ADI scheme (46)–(47) by CDou, and the three-level LOD scheme by LOD.

Example 5. Let , and in (1), then the true solution is . We chose different grids and compared the accuracy of the computed solutions with other schemes. The solutions were obtained for . The quantities that we compared are the maximum -norm and the total elapsed time (CPU) in seconds.

Tables 1 and 2 display the -norm errors and the CPU time. From Table 1, one can easily see that the error from the present second-order scheme is smaller than that from other schemes, and it converges as fast as other schemes. From Table 2, we can find the superiority of the present compact ADI scheme, which has the highest accuracy and fastest computational efficiency. In Figures 1 and 2, we plot the errors and cost time at various grids. The figures show the superiority of the compact ADI over other schemes (second-order scheme). The CPR has much higher and more efficiency than CDou, which may be the best scheme to solve above questions.

Example 6. Let , and in (1). The exact solution is , and the initial and boundary conditions can be obtained based on the exact solution. We chose the grids and , and the time step with . The solutions were obtained for . We compared the accuracy of the computed solutions from the present ADI scheme and other four ADI schemes. The quantities that we compared are the -norm and the total elapsed time (CPU) in seconds.

Table 3 lists the total elapsed time (CPU) in seconds and the -norm error are listed in Table 3 and shown in Figures 3 and 4. One can see that the error from the same order scheme is very close. From the table and figures, we can see that the present fourth-order scheme not only has high accuracy but also converges as fast as other schemes, especially for CPR scheme.

From Figures 1 and 3, it is easily to find that the tested methods degrade to first-order method as the grid gets coarse. In all schemes, we add perturbing term that is, an approximation to . When step becomes large, the time step varies correspondingly because of for the second-order schemes or for the compact schemes. Hence, the effect of perturbing term is enhanced, which results in the schemes seem to degrade to first-order methods as the grid gets coarse. We can choose suitable and get required accuracy.

6. Conclusions

In this paper, we proposed two new ADI schemes for solving nonhomogeneous wave problems. It has been proved that they are unconditionally stable. The compact scheme proposed in this paper is fourth-order accurate in space and second-order accurate in time and allows a considerable saving in computing time. Numerical examples are given to test their high accuracy and to show their superiority over some other schemes in terms of accuracy and computational costs.

The present scheme can be applied to the following variable coefficient differential models on domain : where and are diagonal, nonnegative diffusion tensors.

Acknowledgment

This work is partly supported by National Magnetic Confinement Fusion Science Program, Grant no. 2011GB112004.