International Journal of Differential Equations

Volume 2018, Article ID 6402576, 13 pages

https://doi.org/10.1155/2018/6402576

## Linear -Method and Compact -Method for Generalised Reaction-Diffusion Equation with Delay

^{1}Center for Mathematical Sciences, Huazhong University of Science and Technology, Wuhan 430074, China^{2}School of Mathematics and Statistics, Huazhong University of Science and Technology, Wuhan 430074, China

Correspondence should be addressed to Xiujun Cheng; nc.ude.tsuh@gnehcnujuix

Received 7 March 2018; Accepted 15 May 2018; Published 11 June 2018

Academic Editor: Jiwei Zhang

Copyright © 2018 Fengyan Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper is concerned with the analysis of the linear -method and compact -method for solving delay reaction-diffusion equation. Solvability, consistence, stability, and convergence of the two methods are studied. When , sufficient and necessary conditions are given to show that the two methods are asymptotically stable. When , the two methods are proven to be unconditionally asymptotically stable. Finally, several examples are carried out to confirm the theoretical results.

#### 1. Introduction

Partial functional differential equations (PFDEs) are widely used to model many natural phenomena in various scientific fields [1–9]. In order to gain a better understanding of the complicated dynamics, numerous researchers have investigated PFDEs. For instance, Garrido-Atienza and Real discussed the existence and uniqueness of solutions for delay evolution equations [10]. Mei et al. analysed the stability of travelling waves for nonlocal time-delayed reaction-diffusion equations [11]. Polyanin and Zhurov constructed exact solutions for delay reaction-diffusion equations and more complex nonlinear equations by the functional constraints method [12].

However, the exact solutions are difficult to be obtained [1]. Most researchers have to seek efficient and effective numerical methods to numerically solve PFDEs. Jackiewicz and Zubik-Kowal utilised spectral collocation and waveform relaxation methods to study nonlinear delay partial differential equations [13]. Chen and Wang utilised the variational iteration method to solve a neutral functional-differential equation with proportional delays [14]. Li et al. used the discontinuous Galerkin methods to solve the delay differential equations [15–17]. Bhrawy et al. applied an accurate Chebyshev pseudospectral scheme to study the multidimensional parabolic problems with time delays [18]. Aziz and Amin employed the Haar wavelet to study the numerical solution of a class of delay differential and delay partial differential equations [19].

When it comes to solving PFDEs numerically, here comes one question, that is, whether the numerical solution approximates the exact solution in a stable manner, especially for a long time. In this study, we use the following model as the test equation for analysing stability of the numerical method, which is an extension to the previous work [20–22].Here and hereafter parameters and denote the diffusion coefficients, , , and is the delay term. In particular, when , the above model (1) is reduced to the original test equation in [20–22].

For the case where , model (1) has been studied by many researchers [2, 20–27]. In this work, we will examine the case where , , , and , which is a generalisation of above mentioned work, and analyse the stability condition of the numerical method. The standard second-order central difference method and compact finite difference method are utilised to discrete the diffusion operator, respectively, and the linear -method is utilised to discrete the temporal direction. For convenience, we name the standard second-order central difference version as linear -method and the compact finite difference method version as compact -method. With the spectral radius condition, we consider the stability of the linear -method and compact -method, respectively.

The rest of this paper is organized as follows. In Section 2, we give a sufficient delay-independent condition for Problem (1) to be asymptotically stable. In Section 3, we propose the linear -method for solving Problem (1); solvability, stability, and convergence of the method are discussed. In Section 4, we extend the compact -method to solve Problem (1). In Section 5, several numerical tests are performed to validate the theoretical results.

#### 2. Stability of PFDE (1)

In this section, based on Tian’s work [20], we give a sufficient condition for the trivial solution of Problem (1) to be asymptotically stable.

*Definition 1. *The trivial solution of PFDE (1) is called asymptotically stable if its solution corresponding to a sufficiently differentiable function with satisfies

Lemma 2 (cf. [3]). *All the roots of , where and are real, have negative real parts if and only if*(1)*,*(2)*,** where is the root of such that If , we take *

*Theorem 3. Assume that the solution of Problem (1) is , where , , , and Then the sufficient condition for the trivial solution of Problem (1) to be asymptotically stable is that(1),(2), where is the root of such that If , we take *

*Proof. *Let denote the Banach space equipped with the maximum norm, and , and

Let be the eigenvalues of According to [1, 28], if all zeros of the characteristic equations have negative real part, then the trivial solution is asymptotically stable. Meanwhile, if at least one zero has positive real part, then it is unstable.

Let ; that is,

Multiplying by , we have Setting , we get Denote , and , and rewrite the above equation as Applying Lemma 2, if(1),(2), then the real parts of all zeros of the characteristic equations are negative. Therefore, the trivial solution of Problem (1) is asymptotically stable. Otherwise, there exists a zero whose real part is positive such that Hence, the trivial solution is unstable. It completes the proof.

*3. Linear -Method*

*3. Linear -Method*

*In this section, the linear -method is presented to solve Problem (1).*

*Denote as a uniform partition on the time interval , where is the time step size and Denote as a uniform mesh on the space interval , where is the space step size and Here and are two positive integers. Let be the numerical approximation of and let be the grid function defined on . For any grid function , we use the following notations: *

*Now, applying the standard second-order central difference method to discrete the diffusion operator, we obtain the following linear -method:*

*We can rewrite the linear -method (8) as the following matrix form:where and the eigenvalues of matrix are , *

*3.1. Solvability of Linear -Method*

*3.1. Solvability of Linear -Method*

*Theorem 4. The linear -method (8) is solvable and has a unique solution.*

*Proof. *The mathematical induction is utilised to prove it. We can obtain the solution of according to the initial condition. Now, assume that the solution of has been determined. Then we can derive the solution of with (9). It follows from (9) that the coefficient matrix of the linear system is It is easy to verify that the matrix is symmetric positive definite. Therefore, the solution of is determined uniquely. By mathematical induction, the existence and uniqueness of the solution of difference system (8) are obtained immediately.

*3.2. Asymptotic Stability of Linear -Method*

*3.2. Asymptotic Stability of Linear -Method*

*Section 2 gives the sufficient condition for the trivial solution of Problem (1) to be asymptotically stable. Next, we will analyse the numerical stability of the linear -method (8) under this condition.*

*Definition 5. *A numerical method applied to Problem (1) is called asymptotically stable about the trivial solution if its approximate solution corresponding to a sufficiently differentiable function with satisfiesIn order to prove that a polynomial is a Schur polynomial, the following lemma is needed.

*Lemma 6 (cf. [29]). Let be a polynomial, where and are polynomials of constant degree. Then, the polynomial is a Schur polynomial for any if and only if the following conditions hold: (i),(ii), for all ,(iii), for all *

*Taking the analytical technique in [20–22], we know that the linear -method (8) is asymptotically stable about the trivial solution if and only ifis a Schur polynomial for any *

*Basic calculations give where *

*With the help of Lemma 6, we obtain the following theorem when , which offers a sufficient and necessary condition of asymptotic stability for the linear -method.*

*Theorem 7. Suppose that , , and Then the linear -method (8) is asymptotically stable about the trivial solution for if and only ifwhere , , , and .*

*Proof. * First, let us verify item of Lemma 6. According to , we derive thatBy the same technique used in [22], one can check that .

Next, to verify the rest of items of Lemma 6, that is, , , for all , , we define the following complex variable function:Letting and , after some basic calculations (see [20–22]), we find The value of will be discussed in the following two different cases.*Case a * By conditions , , and , and noting that , we have . Therefore, for all , , we find *Case b * It follows from condition (16) that Noticing the fact that and condition (16), we haveIn brief, combining** Case a** and** Case b**, we conclude that, for all , , , holds, which implies that items and of Lemma 6 hold.

Now, with the help of Lemma 6, we derive that the linear -method (8) is asymptotically stable about the trivial solution.

() Next, we prove the necessary part from two points by contradiction:(i)Suppose that Let be even, , and , and then, for , we get that , which indicates that condition of Lemma 6 does not hold. Thus, the linear -method (8) is not asymptotically stable.(ii)Suppose that Let and , and then, after some basic calculations, we arrive at This signifies that condition of Lemma 6 does not hold. Therefore, the linear -method (8) is not asymptotically stable.Then, we know that (16) is a necessary condition for asymptotic stability. This completes the proof.

*Remark 8. *When , the sufficient and necessary condition (16) in Theorem 7 is simplified to which is consistent with the previous work [20].

*Next, when , we will prove that the linear -method (8) is unconditionally asymptotically stable with respect to the trivial solution.*

*Theorem 9. Suppose that , , and Then the linear -method (8) is unconditionally asymptotically stable about the trivial solution for *

*Proof. *We will prove the theorem with Lemma 6. First, it follows from that Similar to the proof of Theorem 7, we get

Then, we check items (ii) and (iii) of Lemma 6. To do that, we introduce the following complex variable function: (i) Set and Basic calculations give It follows from assumptions , , and that . Then, for all , , we find that which indicates that items and of Lemma 6 hold.(ii) Similarly, we can get In this case, for all , , we also obtain that According to Lemma 6, we conclude that the linear -method (8) is asymptotically stable about the trivial solution. This completes the proof of the theorem.

*3.3. Convergence of Linear -Method*

*3.3. Convergence of Linear -Method*

*Here and below, when we discuss the convergence of numerical methods, we will always assume that the solution of Problem (1) is smooth enough and satisfieswhere is a constant.*

*Let , , . Then, we get where is the local truncation error. Taylor expansion yields that there exists a constant such that, for , ,*

*Thus, the consistence of linear -method (8) is obtained. Now, the convergence result is presented in the following theorem.*

*Theorem 10. Assume that the assumptions in Theorems 7 and 9 hold. Then, for , we have the following convergent result:where and is a constant that is independent of .*

*Proof. *It follows from Theorem 4 that difference system (8) is solvable and has a unique solution. Moreover, the assumptions in Theorems 7 and 9 hold, signifying that the method is stable. Together with the consistence of the method, we derive that (33) holds by the Lax equivalence theorem [30, 31].

*4. Extension to Compact -Method*

*4. Extension to Compact -Method*

*In this section, we would like to use the compact -method with a higher convergence order in space to extend our work. We introduce the compact difference operator,and an important lemma below, which will be needed to construct and prove our main results.*

*Lemma 11 (cf. [32]). Assume that . Then where *

*Now, applying the compact difference operator (34) to discrete the diffusion operator, we have the compact -method:*

*The compact -method (36) can be rewritten in the following matrix form:where *

*Similarly, the solvability, asymptotic stability, and convergence of the compact -method (36) can also be obtained. For conciseness, we merely list our main results and omit the details.*

*Theorem 12. Suppose that , , and Then the compact -method (36) is asymptotically stable about the trivial solution for if and only ifwhere , , , and .*

*Remark 13. *When , the sufficient and necessary condition (39) in Theorem 12 is reduced to which is consistent with the previous work [22].

*Theorem 14. Suppose that , , and Then the compact -method (36) is unconditionally asymptotically stable about the trivial solution for *

*Theorem 15. Assume that the assumptions in Theorems 12 and 14 hold. Then, for , we have the following convergent result:where is a constant that is independent of temporal and spatial stepsizes.*

*Remark 16. *The comparison of linear -method and compact -method applied to problem in [20] and Problem (1) is presented in Table 1.