/ / Article
Special Issue

## Recent Advances in Function Spaces and its Applications in Fractional Differential Equations 2020

View this Special Issue

Research Article | Open Access

Volume 2020 |Article ID 8571625 | https://doi.org/10.1155/2020/8571625

Guanyu Xue, Yunjie Gong, Hui Feng, "The Splitting Crank–Nicolson Scheme with Intrinsic Parallelism for Solving Parabolic Equations", Journal of Function Spaces, vol. 2020, Article ID 8571625, 12 pages, 2020. https://doi.org/10.1155/2020/8571625

# The Splitting Crank–Nicolson Scheme with Intrinsic Parallelism for Solving Parabolic Equations

Accepted28 Feb 2020
Published30 Mar 2020

#### Abstract

In this paper, a splitting Crank–Nicolson (SC-N) scheme with intrinsic parallelism is proposed for parabolic equations. The new algorithm splits the Crank–Nicolson scheme into two domain decomposition methods, each one is applied to compute the values at (n + 1)th time level by use of known numerical solutions at n-th time level, respectively. Then, the average of the above two values is chosen to be the numerical solutions at (n + 1)th time level. The new algorithm obtains accuracy of the Crank–Nicolson scheme while maintaining parallelism and unconditional stability. This algorithm can be extended to solve two-dimensional parabolic equations by alternating direction implicit (ADI) technique. Numerical experiments illustrate the accuracy and efficiency of the new algorithm.

#### 1. Introduction

The parallel numerical schemes for parabolic equations have been studied rapidly. In 1985, Evans [1] proposed the Alternating Group Explicit (AGE) scheme for the diffusion equation by Saul’yev asymmetric schemes [2]. The Alternating Segment Crank–Nicolson (ASC-N) scheme was designed in [3]. Afterwards, the alternating segment algorithms (AGE scheme and ASC-N scheme) above became very effective methods for parabolic equations, such as convection-diffusion equation [4], dispersive equation [58], and fourth-order parabolic equation [9, 10]. Meanwhile, domain decomposition methods (DDMs) for the partial differential equations have been developed. Since the advantages of the low computation and communication costs at each time step, the nonoverlapping DDMs have been studied extensively [1120]. The concept called “intrinsic parallelism” was presented in [2123]. In 1999, the alternating difference schemes were presented, and the unconditional stability analysis was given in [24]. The unconditionally stable domain decomposition method was obtained by the alternating technique in [2530]. Recently, the numerical methods for parabolic equations have attracted great attention of scholars [3142]. Meanwhile, the finite volume element methods for elliptic problems are studied by Bi et al. [43, 44], and the finite volume element method for second-order hyperbolic equations is proposed by Chen et al. [45]. Obviously, the Crank–Nicolson scheme is one of the most classical methods for PDEs [46, 47]. But, there is litter work on parallel algorithms that satisfy the accuracy and stability of the Crank–Nicolson scheme.

On this basis, a new parallel algorithm called splitting Crank–Nicolson scheme for parabolic equations will be presented in this paper. The idea of the new algorithm is to divide the classical Crank–Nicolson scheme into two parts, which are DDMs, each of which is used in computations at (n + 1)th time level utilizing the numerical solution at time level n. Then, the average of the above two values is chosen to be the numerical solutions at (n + 1)th time level. It can be described as follows:(1)Split the Crank–Nicolson scheme into DDM I and DDM II by Saul’yev asymmetric schemes.(2)DDM I is applied to compute the values at (n + 1)th time level noted as Vn+1 by use of known value Un at n-th time level. DDM II is also used to compute the values at (n + 1)th time level noted as Wn+1 by use of Un at n-th time level.(3)The value Un+1 = (Vn+1 + Wn+1)/2 are set as numerical solutions at (n + 1)th time level.

The advantage of the SC-N scheme is spitting the C-N scheme into two parallel algorithms, which can be computed by parallel computers. Then, the average value obtained is restored to C-N scheme approximately. This paper is organized as follows: in Section 2, we introduce a SC-N scheme for parabolic equations. For simplicity of presentation, we focus on a model problem, namely, one-dimensional parabolic equations. The new algorithm and detailed presentations are given. Then, we extend the new algorithm to solve two-dimensional parabolic equations by ADI technique. Finally, numerical experiments illustrated the accuracy of SC-N scheme is approximate to the C-N scheme and the new algorithm is efficient.

#### 2. Algorithm Presentation

Considering the model problem of one-dimensional parabolic equations,with the initial and boundary conditionswhere a > 0 is a constant.

Let h and τ be the spatial and temporal step sizes, respectively. Denote xj = jh, j = 0, 1, …, m and tn = , n = 0, 1, …, N. Let be the approximate solution at (xj, tn). u (x, t) represents the exact solution of (1).

The well-known Crank–Nicolson scheme can be written aswhere r = τ/h2.

Let μ = ar, and (3) can be written as the matrix formwhere and .

The matrices A and B are as follows:

Splitting Crank–Nicolson scheme (4), we obtainwhere A1 and A2 are block diagonal matrices, respectively.

V n+1 and Wn+1 can be defined as follows:where Vn+1 and Wn+1 approximate to Un+1, respectively. Then,

Scheme (8) is DDM I, and scheme (9) is called DDM II. The two DDMs aforementioned are suitable for parallel computing.

In order to construct two domain decomposition methods, DDM I and DDM II, at (n + 1)th time level, we need to consider four forms of Saul’yev asymmetric difference schemes corresponding to (3) as follows:

The flow chart of schemes (11)–(14) are displayed in Figure 1.

Assume m − 1 = 6K, where K is a positive integer.

##### 2.1. DDM I

For the values , we use the formulas as follows:

Find the values by using the following formulas (k = 1, 2, …, K − 1):

Obviously, each subdomain contains 6 nodes which can be computed by (16) independently.

For the values by using the formulas as follows:

DDM I can be written as the matrix formwhere , A1 = (I + μG1), and B1 = (I − μG2).

The matrices G1 and G2 are block diagonal matrices which are as follows:where

Each block matrix system (i.e., each subdomain) can be solved independently. It is evident that DDM I (18) has intrinsic parallelism.

##### 2.2. DDM II

For the values by using the following formulas:

Find the values by using the formulas as follows (k = 1, 2, …, K − 2):

Obviously, each subdomain contains 6 nodes which can be computed by (22) independently.

Find the values by using the formulas as follows:

DDM II can be written as the matrix formwhere A2 = (I + μG2) and B2 = (I − μG1).

The matrices G1 and G2 are block diagonal matrices which are as follows:

Each block matrix system (i.e., each subdomain) can be solved independently. It is evident that DDM II (24) has intrinsic parallelism.

Schemes (15)–(17) and schemes (21)–(23) construct two domain decomposition methods (18) and (24), respectively. The corresponding algorithm can be described in Algorithm 1. The matrix form of Algorithm 1 can be written as follows:where , , and .

 Require: Initialization U0 (xj) ⟵ u0 (xj). for n = 0, 1, ⋯, N do for j = 0, 1, ⋯, m do Solve the values by using DDM I (18). Solve the values by using DDM II (24). The average of two values will be calculated, i.e. . end for end for Ensure: Output UN (xj).

Remark 1. Obviously, C-N scheme (4) is equal to .

Remark 2. Because the SC-N scheme is derived from the C-N scheme, it also has the properties of the C-N scheme, i.e., the SC-N scheme is unconditionally stable and maintains the second-order numerical accuracy O (τ2 + h2).

#### 3. Extension to Two-Dimensional Parabolic Equations

In this section, we will extend Algorithm 1 to solve two-dimensional parabolic equations:where domain Ω ∈ (0, Lx) × (0, Ly) and a > 0 and b > 0 are diffusion coefficients.

Let be the approximate solution at (xi, yj, tn), and u (x, y, t) represents the exact solution of (27). With the same time and space discretization of Algorithm 1, we obtain its extended algorithm by alternating direction implicit (ADI) technique [48] for equations (27)–(29).

##### 3.1. x-Direction

Let r1 = /(2h2) and r2 = /(2h2), and the matrix form of the SC-N scheme in x-direction can be written as follows:where

##### 3.2. y-Direction

The matrix form of the SC-N scheme in y-direction can be written as follows:where

The corresponding algorithm can be described in Algorithm 2.

 Require: Initialization U0 (xi, yj) ⟵ u0 (xi, yj). for n = 0, 1, ⋯, N do for i = 0, 1, ⋯, m do for j = 0, 1, ⋯, m do Solve the values by using the scheme (30). Solve the values again by using the scheme (32). end for end for end for Ensure: Output UN (xi, yj).

Similar to Algorithm 1, it is obvious that Algorithm 2 has unconditional stability and parallelism.

Remark 3. In fact, is the C-N scheme in x-direction, and is the C-N scheme in y-direction.

Remark 4. In Algorithm 2, the domain is divided into many subdomains by using two DDMs. In each time interval, we first solve the values along x-direction by (30) at the half-time step and then solve the values along y-direction by (32) at the next half-time step. Schemes (30) and (32) lead to block diagonal algebraic systems that can be solved independently. So, Algorithm 2 not only is suitable for parallel computation but also maintains the accuracy. Based on the advantage of ADI technique, Algorithm 2 reduces computational complexities. Though it is developed for two-dimensional problems, Algorithm 2 can be easily extended to solve high-dimensional parabolic equations.

#### 4. Numerical Experiments

To illustrate the efficiency of the SC-N scheme for parabolic equations, we will compare the accuracy of the new algorithm with the existing method.

Example 1. The exact solution of Example 1 isFirstly, we examine the convergence rate of Algorithm 1. We divide the mesh point into many segments, such as K = 3, K = 4, K = 5, and K = 6. We calculate errors taking τ = 0.001, and the following rate of convergence in the space isClearly, the errors appear to be of order O (h2) in Table 1.
Next, we present the error results of the SC-N scheme in terms of the absolute errors and the relative errors, where the absolute error (A. E.) is defined byand the relative error (R. E.) is defined byTables 2 and 3 display the absolute errors and the relative errors obtained by presented Algorithm 1 for h = 1/19 (i.e., K = 3) and h = 1/25 (i.e., K = 4) at t = 0.2, t = 0.4, and t = 0.8 when taking r = 1.5 (r = τ/h2). From Tables 2 and 3, it is obvious that our algorithm has high accuracy.
We compare Algorithm 1 with the ASC-N scheme in [3] and C-N scheme (3) by the maximum errors for h = 1/19 (i.e., K = 3) and h = 1/25 (i.e., K = 4) at different times t = 0.2, t = 0.4, t = 0.6, and t = 0.8. With the increasing of computation time, the errors of the ASC-N scheme in [3] increase more than those of Algorithm 1 for different r (r = τ/h2) in Tables 4 and 5. Moreover, the results show that Algorithm 1 can achieve the same accuracy as the classic C-N scheme while maintaining parallelism. We consider an example for h = 1/121 (i.e., K = 20) with large grid ratio r = 15 (r = τ/h2). Table 6 shows that Algorithm 1 has a better accuracy than two others, and it is indicated that Algorithm 1 is stable.

 h L ∞ error Rate 1/19 (K = 3) 4.998746e − 4 — 1/25 (K = 4) 3.085232e − 4 2.0167 1/31 (K = 5) 2.002844e − 4 1.9955 1/37 (K = 6) 1.412289e − 4 1.9903
 x j Algorithm 1 (t = 0.2) Algorithm 1 (t = 0.4) Algorithm 1 (t = 0.8) A.E. R. E. A. E. R. E. A. E. R. E. 0.11 0.3731e − 3 1.7559e − 2 0.5021e − 3 1.9312e − 2 0.7577e − 3 1.9534e − 2 0.21 0.6184e − 3 1.5420e − 2 0.8428e − 3 1.7176e − 2 1.2739e − 3 1.7399e − 2 0.31 0.8750e − 3 1.5999e − 2 1.1881e − 3 1.7754e − 2 1.7950e − 3 1.7976e − 2 0.42 0.9753e − 3 1.5409e − 2 1.3294e − 3 1.7165e − 2 2.0093e − 3 1.7388e − 2 0.52 1.0066e − 3 1.5469e − 2 1.3715e − 3 1.7225e − 2 2.0729e − 3 1.7447e − 2 0.63 0.9135e − 3 1.5280e − 2 1.2463e − 3 1.7037e − 2 1.8839e − 3 1.7259e − 2 0.73 0.7582e − 3 1.5778e − 2 1.0310e − 3 1.7534e − 2 1.5579e − 3 1.7757e − 2 0.84 0.5469e − 3 1.7563e − 2 0.7361e − 3 1.9316e − 2 1.1109e − 3 1.9538e − 2 0.95 0.1891e − 3 1.7556e − 2 0.2545e − 3 1.9309e − 2 0.3841e − 3 1.9532e − 2
 x j Algorithm 1 (t = 0.2) Algorithm 1 (t = 0.4) Algorithm 1 (t = 0.8) A.E. R. E. A. E. R. E. A. E. R. E. 0.04 0.5579e − 4 9.0292e − 3 0.7499e − 4 9.9277e − 3 1.1317e − 4 1.0041e − 2 0.12 1.6391e − 4 9.0313e − 3 2.2031e − 4 9.9298e − 3 3.3247e − 4 1.0043e − 2 0.24 2.7890e − 4 8.2703e − 3 3.7803e − 4 9.1694e − 3 5.7102e − 4 0.9283e − 2 0.36 3.5674e − 4 8.0054e − 3 4.8512e − 4 8.9048e − 3 7.3305e − 4 0.9018e − 2 0.48 3.8737e − 4 7.8818e − 3 5.2760e − 4 8.7813e − 3 7.9739e − 4 0.8895e − 2 0.60 3.6642e − 4 7.8242e − 3 4.9945e − 4 8.7237e − 3 7.5491e − 4 0.8837e − 2 0.72 2.9685e − 4 7.8239e − 3 4.0462e − 4 8.7235e − 3 6.1158e − 4 0.8837e − 2 0.84 1.8851e − 4 7.9457e − 3 2.5655e − 4 8.8452e − 3 3.8769e − 4 0.8959e − 2 0.96 0.5579e − 4 9.0292e − 3 0.7499e − 4 9.9277e − 3 1.1317e − 4 1.0041e − 2
 Methods r t = 0.2 t = 0.4 t = 0.6 t = 0.8 Algorithm 1 0.36 3.5539e − 4 4.8387e − 4 5.9795e − 4 7.3131e − 4 ASC-N scheme [3] 4.7468e − 4 7.1743e − 4 1.0705e − 3 1.5969e − 3 C-N scheme 3.5468e − 4 4.7723e − 4 5.7998e − 4 7.0232e − 4 Algorithm 1 0.72 5.7866e − 4 7.8813e − 4 9.7397e − 4 1.1912e − 3 ASC-N scheme [3] 7.3439e − 4 1.1100e − 3 1.6563e − 3 2.4709e − 3 C-N scheme 5.7499e − 4 7.8239e − 4 9.6534e − 4 1.0928e − 3 Algorithm 1 1.45 1.0066e − 3 1.3715e − 3 1.6949e − 3 2.0729e − 3 ASC-N scheme [3] 1.0999e − 3 1.6591e − 3 2.4754e − 3 3.6929e − 3 C-N scheme 9.9823e − 4 1.3421e − 3 1.6034e − 3 1.8807e − 3 Algorithm 1 1.80 1.2153e − 3 1.6560e − 3 2.0465e − 3 2.5029e − 3 ASC-N scheme [3] 1.2843e − 3 1.9356e − 3 2.8880e − 3 4.3084e − 3 C-N scheme 1.2031e − 3 1.6423e − 3 1.9034e − 3 2.2222e − 3
 Methods r t = 0.2 t = 0.4 t = 0.6 t = 0.8 Algorithm 1 0.63 2.2660e − 4 3.0852e − 4 3.8124e − 4 4.6627e − 4 ASC-N scheme [3] 2.8997e − 4 4.3826e − 4 6.5392e − 4 9.7553e − 4 C-N scheme 2.2632e − 4 3.0324e − 4 3.7834e − 4 4.5342e − 4 Algorithm 1 0.94 3.0760e − 4 4.1963e − 4 5.1826e − 4 6.3353e − 4 ASC-N scheme [3] 4.5949e − 4 6.9190e − 4 8.3264e − 4 1.5416e − 3 C-N scheme 3.0642e − 4 4.1823e − 4 5.1654e − 4 6.1278e − 4 Algorithm 1 1.35 3.8737e − 4 5.2761e − 4 6.5199e − 4 7.9740e − 4 ASC-N scheme [3] 4.2810e − 4 6.4710e − 4 9.6552e − 4 1.4404e − 3 C-N scheme 3.8535e − 4 5.2252e − 4 6.4721e − 4 7.7627e − 4 Algorithm 1 1.76 4.6541e − 4 6.3397e − 4 7.8343e − 4 9.5815e − 4 ASC-N scheme [3] 4.6674e − 4 7.0553e − 4 1.0527e − 3 1.5704e − 3 C-N scheme 4.5121e − 4 6.2937e − 4 7.6320e − 4 9.3729e − 4
 Algorithm 1 ASC-N method [3] AGE method [1] t = 0.2 1.3994e − 4 1.4759e − 4 1.2717e − 3 t = 0.4 3.2238e − 4 2.8034e − 4 3.2242e − 3 t = 0.6 5.0639e − 4 6.5004e − 4 6.2125e − 3 t = 0.8 6.9237e − 4 8.3824e − 4 9.2284e − 3

Example 2. where the domain is Ω = (0, 1) × (0, 1), and the right side function isThe corresponding exact solution isLet h = 1/19 (i.e., K = 3), h = 1/25 (i.e., K = 4), h = 1/31 (i.e., K = 5), and h = 1/37 (i.e., K = 6), and the maximum errors of Algorithm 2 for τ = 0.0004 at different times are displayed in Table 7. It is obvious that the accuracy of Algorithm 2 is satisfied. Table 8shows the comparison of the CPU calculation time among Algorithm 2, the classical C-N scheme, and the ASC-N scheme. Algorithm 2 not only has high accuracy but also has good parallel efficiency.

 h = 1/19 h = 1/25 h = 1/31 h = 1/37 t = 0.2 6.0275e − 4 1.5451e − 4 8.0677e − 5 4.9096e − 5 t = 0.4 4.4976e − 4 1.9272e − 4 1.0052e − 4 6.1127e − 5 t = 0.5 5.1593e − 4 2.1305e − 4 1.1113e − 4 6.7574e − 5 t = 0.6 5.7284e − 4 2.3546e − 4 1.2282e − 4 7.4684e − 5 t = 0.8 7.0014e − 4 2.8760e − 4 1.5001e − 4 9.1219e − 5
 h Algorithm 2 C-N scheme ASC-N scheme 1/37 (K = 6) 6.4121s 20.2625s 16.7089s 1/49 (K = 8) 21.4226s 49.9863s 41.0513s 1/61 (K = 10) 53.2623s 175.2632s 146.0665s 1/91 (K = 15) 341.5628s 1167.2047s 966.9273s

#### 5. Conclusion

We have proposed and analyzed the SC-N scheme for parabolic equations. This algorithm consists of two DDMs, which split the Crank–Nicolson scheme; each one is used to solve the values at the same time level. Then, the average of two values is calculated. The SC-N scheme maintains the properties of the C-N scheme, i.e., unconditional stability and second-order numerical accuracy. Then, we extend the new algorithm to two-dimensional parabolic equations by ADI technique, which means that high-dimensional parabolic equations can be solved by the proposed algorithm in this paper. Numerical experiments illustrate the good performance of the new algorithm.

#### Data Availability

All data generated or analyzed during this study are included in this article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Acknowledgments

The authors would like to thank the anonymous referees for helpful comments and suggestions. This research was supported by the PhD research startup foundation of Yantai University (no. 2219002).

#### References

1. D. J. Evans, “Alternating group explicit method for the diffusion equation,” Applied Mathematical Modelling, vol. 9, no. 3, pp. 201–206, 1985. View at: Publisher Site | Google Scholar
2. V. K. Saul’yev, Integration of Equations of Parabolic Type by Method of Nets, Elsevier, Amsterdam, Netherlands, 1964.
3. B. Zhang and W. Li, “On alternating segment Crank-Nicolson scheme,” Parallel Computing, vol. 20, no. 6, pp. 897–902, 1994. View at: Publisher Site | Google Scholar
4. W. Wang, “A class of alternating segment Crank-Nicolson methods for solving convection-diffusion equations,” Computing, vol. 73, pp. 41–55, 2004. View at: Publisher Site | Google Scholar
5. W. Wang and S. Fu, “An unconditionally stable alternating segment difference scheme of eight points for the dispersive equation,” International Journal for Numerical Methods in Engineering, vol. 67, no. 3, pp. 435–447, 2006. View at: Publisher Site | Google Scholar
6. Q. Zhang and W. Wang, “A four-order alternating segment Crank-Nicolson scheme for the dispersive equation,” Computers & Mathematics with Applications, vol. 57, no. 2, pp. 283–289, 2009. View at: Publisher Site | Google Scholar
7. W.-Q. Wang and Q. Zhang, “A highly accurate alternating 6-point group method for the dispersive equation,” International Journal of Computer Mathematics, vol. 87, no. 7, pp. 1512–1521, 2010. View at: Publisher Site | Google Scholar
8. G. Guo, S. Lü, and B. Liu, “Unconditional stability of alternating difference schemes with variable time steplengthes for dispersive equation,” Applied Mathematics and Computation, vol. 262, pp. 249–259, 2015. View at: Publisher Site | Google Scholar
9. G. Guo and B. Liu, “Unconditional stability of alternating difference schemes with intrinsic parallelism for the fourth-order parabolic equation,” Applied Mathematics and Computation, vol. 219, no. 14, pp. 7319–7328, 2013. View at: Publisher Site | Google Scholar
10. G. Guo and S. Lü, “Unconditional stability of alternating difference schemes with intrinsic parallelism for two-dimensional fourth-order diffusion equation,” Computers & Mathematics with Applications, vol. 71, no. 10, pp. 1944–1959, 2016. View at: Publisher Site | Google Scholar
11. Y. Bonbendir, X. Antonie, and C. Geuzaine, “A quasi-optimal non-overlapping domain decomposition algorithm for Helmholtz equations,” Journal of Computational Physics, vol. 231, pp. 262–280, 2012. View at: Publisher Site | Google Scholar
12. S. Zhu, “Conservative domain decomposition procedure with unconditional stability and second-order accuracy,” Applied Mathematics and Computation, vol. 216, no. 11, pp. 3275–3282, 2010. View at: Publisher Site | Google Scholar
13. W. Hao and S. Zhu, “Domain decomposition schemes with high-order accuracy and unconditional stability,” Applied Mathematics and Computation, vol. 219, no. 11, pp. 6170–6181, 2013. View at: Publisher Site | Google Scholar
14. Q. Du, M. Mu, and Z. Wu, “Efficient parallel algorithms for parabolic problems,” SIAM Journal on Numerical Analysis, vol. 39, no. 5, pp. 1469–1487, 2001. View at: Publisher Site | Google Scholar
15. H. S. Shi and H.-L. Liao, “Unconditional stability of corrected explicit-implicit domain decomposition algorithms for parallel approximation of heat equations,” SIAM Journal on Numerical Analysis, vol. 44, no. 4, pp. 1584–1611, 2006. View at: Publisher Site | Google Scholar
16. M. Dryja and X. Tu, “A domain decomposition discretization of parabolic problems,” Numerische Mathematik, vol. 107, no. 4, pp. 625–640, 2007. View at: Publisher Site | Google Scholar
17. C. Li and Y. Yuan, “A modified upwind difference domain decomposition method for convection-diffusion equations,” Applied Numerical Mathematics, vol. 59, no. 7, pp. 1584–1598, 2009. View at: Publisher Site | Google Scholar
18. D. Liang and C. Du, “The efficient S-DDM scheme and its analysis for solving parabolic equations,” Journal of Computational Physics, vol. 272, pp. 46–69, 2014. View at: Publisher Site | Google Scholar
19. S. Kumar and M. Kumar, “An analysis of overlapping domain decomposition methods for singularly perturbed reaction-diffusion problems,” Journal of Computational and Applied Mathematics, vol. 281, pp. 250–262, 2015. View at: Publisher Site | Google Scholar
20. Z. Zhou and D. Liang, “A time second-order mass-conserved implicit-explicit domain decomposition scheme for solving the diffusion equations,” Advances in Applied Mathematics and Mechanics, vol. 9, no. 4, pp. 795–817, 2017. View at: Publisher Site | Google Scholar
21. Y. Zhou, “Finite difference method with intrinsic parallelism for quasilinear parabolic systems,” Beijing Math, vol. 2, pp. 1–19, 1996. View at: Google Scholar
22. Y. Zhou, “General finite difference schemes with intrinsic parallelism for nonlinear parabolic system,” Beijing Math, vol. 2, pp. 20–36, 1996. View at: Google Scholar
23. Y. Zhou, L. Shen, and G. Yuan, “Some practical difference schemes with intrinsic parallelism for nonlinear parabolic systems,” Chinese Journal of Numerical Mathematics and Applications, vol. 19, pp. 46–57, 1997. View at: Google Scholar
24. G.-W. Yuan, L.-J. Shen, and Y.-L. Zhou, “Unconditional stability of alternating difference schemes with intrinsic parallelism for two-dimensional parabolic systems,” Numerical Methods for Partial Differential Equations, vol. 15, no. 6, pp. 625–636, 1999. View at: Publisher Site | Google Scholar
25. Z. Sheng, G. Yuan, and X. Hang, “Unconditional stability of parallel difference schemes with second order accuracy for parabolic equation,” Applied Mathematics and Computation, vol. 184, no. 2, pp. 1015–1031, 2007. View at: Publisher Site | Google Scholar
26. G. Yuan, Z. Sheng, and X. Hang, “The unconditional stability of parallel difference schemes with scheme order convergence for nonlinear parabolic system,” Numerical Methods for Partial Differential Equations, vol. 20, no. 1, pp. 45–64, 2007. View at: Google Scholar
27. Y. Zhuang, “An alternating explicit-implicit domain decomposition method for the parallel solution of parabolic equations,” Journal of Computational and Applied Mathematics, vol. 206, no. 1, pp. 549–566, 2007. View at: Publisher Site | Google Scholar
28. G. Xue and H. Feng, “A new parallel algorithm for solving parabolic equations,” Advances in Difference Equations, vol. 174, pp. 1–16, 2018. View at: Google Scholar
29. G. Xue and H. Feng, “New parallel algorithm for convection-dominated diffusion equation,” East Asian Journal on Applied Mathematics, vol. 8, no. 2, pp. 261–279, 2018. View at: Google Scholar
30. G. Xue and H. Feng, “An alternating segment explicit-implicit scheme with intrinsic parallelism for Burgers’ equation,” Journal of Computational and Theoretical Transport, vol. 49, no. 1, pp. 16–30, 2020. View at: Publisher Site | Google Scholar
31. C. Chen and H. Liu, “A two-grid finite volume element method for a nonlinear parabolic problem,” International Journal of Numerical Analysis and Modeling, vol. 12, pp. 197–210, 2015. View at: Publisher Site | Google Scholar
32. C. Chen and X. Zhao, “A posteriori error estimate for finite volume element method of the parabolic equations,” Numerical Methods for Partial Differential Equations, vol. 33, no. 1, pp. 259–275, 2017. View at: Publisher Site | Google Scholar
33. C. Chen, X. Zhang, G. Zhang, and Y. Zhang, “A two-grid finite element method for nonlinear parabolic integro-differential equations,” International Journal of Computer Mathematics, vol. 96, no. 10, pp. 2010–2023, 2019. View at: Publisher Site | Google Scholar
34. C. Chen, W. Liu, and C. Bi, “A two-grid characteristic finite volume element method for semilinear advection-dominated diffusion equations,” Numerical Methods for Partial Differential Equations, vol. 29, no. 5, pp. 1543–1562, 2013. View at: Publisher Site | Google Scholar
35. M. Yang, “Higher-order finite volume element methods based on Barlow points for one-dimensional elliptic and parabolic problems,” Numerical Methods for Partial Differential Equations, vol. 31, no. 4, pp. 977–994, 2015. View at: Publisher Site | Google Scholar
36. W. Gong, M. Hinze, and Z. Zhou, “Finite element method and a priori error estimates for dirichlet boundary control problems governed by parabolic pdes,” Journal of Scientific Computing, vol. 66, no. 3, pp. 941–967, 2016. View at: Publisher Site | Google Scholar
37. N. An, X. Yu, and C. Huang, “Local discontinuous Galerkin methods for parabolic interface problems with homogeneous and non-homogeneous jump conditions,” Computers & Mathematics with Applications, vol. 74, no. 10, pp. 2572–2598, 2017. View at: Publisher Site | Google Scholar
38. X. Wang and Y. Tao, “A new Newton method with memory for solving nonlinear equations,” Mathematics, vol. 8, no. 1, p. 108, 2020. View at: Publisher Site | Google Scholar
39. X. Li, Q. Xu, and A. Zhu, “Weak galerkin mixed finite element methods for parabolic equations with memory,” Discrete & Continuous Dynamical Systems-S, vol. 12, no. 3, pp. 513–531, 2019. View at: Publisher Site | Google Scholar
40. H. Cheng and R. Yuan, “Discontinuous mixed covolume methods for parabolic problems,” The Scientific World Journal, vol. 2014, Article ID 867863, 8 pages, 2017. View at: Publisher Site | Google Scholar
41. W. Gong, M. Hinze, and Z. J. Zhou, “Space-time finite element approximation of parabolic optimal control problems,” Journal of Numerical Mathematics, vol. 20, no. 2, pp. 111–145, 2012. View at: Publisher Site | Google Scholar
42. Q. Yang and X. Zhang, “Discontinuous Galerkin immersed finite element methods for parabolic interface problems,” Journal of Computational and Applied Mathematics, vol. 299, pp. 127–139, 2016. View at: Publisher Site | Google Scholar
43. C. Bi, Y. Lin, and M. Yang, “Finite volume element method for monotone nonlinear elliptic problems,” Numerical Methods for Partial Differential Equations, vol. 29, no. 4, pp. 1097–1120, 2013. View at: Publisher Site | Google Scholar
44. C. Bi and M. Liu, “A discontinuous finite volume element method for second-order elliptic problems,” Numerical Methods for Partial Differential Equations, vol. 28, no. 2, pp. 425–440, 2012. View at: Publisher Site | Google Scholar
45. C. Chen, X. Zhao, and Y. Zhang, “A posteriori error estimate for finite volume element method of the second-order hyperbolic equations,” Mathematical Problems in Engineering, vol. 2015, Article ID 510241, 11 pages, 2015. View at: Publisher Site | Google Scholar
46. X. Shen and A. Zhu, “A Crank-Nicolson linear difference scheme for a BBM equation with a time fractional nonlocal viscous term,” Advances in Difference Equations, vol. 351, pp. 1–12, 2018. View at: Google Scholar
47. C. Chen, K. Li, Y. Chen, and Y. Huang, “Two-grid finite element methods combined with Crank-Nicolson scheme for nonlinear Sobolev equations,” Advances in Computational Mathematics, vol. 45, no. 2, pp. 611–630, 2019. View at: Publisher Site | Google Scholar
48. F. Zeng, Z. Zhang, and G. E. Karniadakis, “Fast difference schemes for solving high-dimensional time-fractional subdiffusion equations,” Journal of Computational Physics, vol. 307, pp. 15–33, 2016. View at: Publisher Site | Google Scholar

Copyright © 2020 Guanyu Xue 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.