Exponential finite difference methods for solving Newell–Whitehead–Segel equation

This work presents two different finite difference methods to compute the numerical solutions for Newell–Whitehead–Segel partial differential equation, which are implicit exponential finite difference method and fully implicit exponential finite difference method. Implicit exponential methods lead to nonlinear systems. Newton method is used to solve the resulting systems. Stability and consistency are discussed. To illustrate the accuracy of the proposed numerical methods, some examples are delivered at the end.

For the numerical solution of Problem (1.2), Ruiz-Ramírez and Macías-Díaz [12] used non-standard symmetry-preserving method to compute bounded solution of a generalized NWS problem, Zahraa et al. [24] found numerical solutions by Cubic B-Spline methods, Patade and Bhalekar [17] used a new iterative method which was found by Jafari and Daftardar-Gejji [5] to give analytical solutions for NWS equation with initial condition, and Akinlabi and Edeki [2] used perturbation iteration transform method and gave approximate solutions for the initial value problems of NWS equation.
Different finite difference schemes have been developed for solving different differential equations, Bahadir [3] applied exponential finite difference method to KDV equation for small times, Ramos [21] used explicit finite difference methods for the equal width (EW) and regularized long-wave (RLW) equations, Inan and Bahadir [9] used Hopf-Cole transform to linearize Burgers' equation, then they applied an explicit exponential finite difference method to find the numerical solution, also they presented an implicit exponential finite difference scheme for solving generalized Burgers-Huxley equation [10], Huang and Abduwali [7] used Crank-Nicolson method to modify the numerical scheme of generalized Burgers-Huxley equation, Celikten et al. [4] presented four different explicit exponential finite difference methods to solve modified Burgers' equation, and Inan [8] applied Crank-Nicolson exponential finite difference scheme to generalized Fitzhugh-Nagumo equation.
The aim of this manuscript is to introduce two different finite difference schemes to compute the numerical solutions of Problem (1.2). The first one is implicit exponential finite difference scheme and the second one is fully implicit exponential finite difference scheme. Stability and consistency of both schemes are discussed. Moreover, the rate and order of convergence are discussed numerically. Some examples are presented to show the efficiency of these methods to solve the equation.

Numerical methods
In general, finite difference methods for solving partial differential equations depend on transforming a calculus problem into an algebra problem by discretizing the continuous domain into a discrete difference grid (x i , t j ), where x i = i x; 0 ≤ i ≤ N , t j = j t; j = 0, 1, 2, . . . , x is the spatial mesh size and t is the time step. Then, replacing the individual exact partial derivatives by algebraic finite difference approximations. In this work, we use the difference operators: where u j i is the numerical approximation of the exact solution at point (x i , t j ). The numerical solution of the proposed problem is obtained by solving the resulting system of algebraic equations [6].

Implicit exponential finite difference scheme (I-EFD)
The implicit exponential finite difference scheme of Eq. (1.2) is given by the form: (2.3)

Fully implicit exponential finite difference scheme (FI-EFD)
The fully implicit exponential finite difference scheme of Eq. (1.2) is given by the form: An iterative method is applied to solve the nonlinear systems of algebraic equations (Eqs. (2.3) and (2.4)). Suppose these nonlinear systems are given by the form: Newton method is used to solve the system (2.5) by the following way: 1. Set u (0) , an initial estimate. 2. For K = 0, 1, 2, . . . until convergence do: where J (u (K ) ) is the Jacobian matrix. The solution at every time level is considered an initial estimate to the solution at the next time level. At each time step, Newton iteration stops when G(u (K ) ) ∞ ≤ 10 −5 ; it usually needs two or three iterations.
Absolute, L ∞ and L 2 norms will be used to measure the accuracy of both proposed methods which are defined, respectively, by: where U is the exact solution of the proposed problem and u is the numerical exponential finite difference approximation.

Local truncation error (LTE)
Since the schemes are exponential, the investigation will be developed by expanding the exponential term of the schemes into a Taylor series, and using the first two terms of the expansion, then substituting the coefficients u

LTE of implicit exponential finite difference scheme (I-EFD)
The Eq. (2.3) can be written as: 3) into the resulting system (3.4), we get: Therefore, LTE of (3.5) is:

LTE of fully implicit exponential finite difference scheme (FI-EFD)
The Eq. (2.4) can be written as: As the previous discussion in 3.1.1, we find:

Consistency
Since the difference between the PDE and the finite difference scheme gives LTE, and according to (3.6) and (3.9), the proposed schemes are consistent with Eq. (1.2). And they are first order in time and second order in space.

Stability analysis
We consider Von-Neumann stability analysis to investigate stability of the linear form of NWS equation.

Stability of implicit exponential finite difference scheme (I-EFD)
We suppose (u j i ) q−1 = α = constant, so the linear form of (3.4) can be written as: By substituting the Fourier mode u j i = ζ j e Iβi x ; I 2 = −1 into (4.1), we get: Suppose that α = 1, so g has the form: The stability condition is |g| ≤ 1.
When a ≤ b, the scheme is unconditionally stable.
Therefore, the stability condition is:

Stability of fully implicit exponential finite difference scheme (FI-EFD)
We suppose (u j+1 i ) q−1 = α = constant, so the linear form of (3.7) can be written as: By substituting the Fourier mode u j i = ζ j e Iβi x ; I 2 = −1 into (4.3), we get: Suppose that α = 1, so g has the form: The stability condition is |g| ≤ 1.
When a ≤ b, the scheme is unconditionally stable. When a > b, the stability condition is −1 ≤ t }, so the stability condition is: Arab. J. Math.

Numerical results and stability discussion
In this section, we will discuss three different standard examples to test the both proposed methods.
The initial condition is: with the boundary conditions: The exact solution is given as: Stability of Example 5.1.
• Stability of I-EFD scheme In this problem, we have a = 1, b = 1; so, g in (4.2) is given as g = and the scheme is also unconditionally stable. Table 1 shows absolute errors of I-EFD, FI-EFD methods, and the methods of [24], where T = 1, x = 0.0125 and t = 10 −4 (for finite difference methods). It also shows that the presented methods offer better results than the methods of [24]. Tables 2, 3 show L ∞ and L 2 errors for T = 10, x = 0.05 and two different choices of t. These tables show that the errors of I-EFD and FI-EFD methods are almost equal, and they offer high accurate solutions. Figure 1 shows exact and numerical solutions computed by I-EFD method for T = 5, t = 0.001, and x = 0.05. Figure 2 shows numerical solution computed by I-EFD method for T = 1, t = 0.05, and x = 0.1.
The initial condition is: with the boundary conditions: The exact solution is given as: .

Stability of Example 5.2.
• Stability of I-EFD scheme In this problem, we have a = 3, b = 4, and so, g in (4.2) is given as g = which satisfies the condition |g| ≤ 1 and the scheme is unconditionally stable. • Stability of FI-EFD scheme g in (4.4) is given as g = and the scheme is also unconditionally stable.    Table 4 shows absolute errors of I-EFD, FI-EFD methods, and the methods of [24], where T = 1, x = 0.0125 and t = 10 −4 (for finite difference methods). It also shows that I-EFD and FI-EFD methods give more accurate results than the methods of [24]. Tables 5, 6 show L ∞ and L 2 errors for T = 10, x = 0.05 and two different choices of t. These tables also show the high accuracy of the solutions. Figure 3 shows exact and numerical solutions computed by I-EFD method for T = 5, t = 0.001, and x = 0.05. Figure 4 shows numerical solution computed by I-EFD method for T = 1, t = 0.05, and x = 0.1.
The initial condition is: with the boundary conditions: The exact solution is given as: Stability of Example 5.3.   In this problem, we have a = 1, b = 1, so as Example 5.1, both of the methods are unconditionally stable. Table 7 shows absolute errors of I-EFD, FI-EFD methods, and the methods of [24], where T = 1, x = 0.0125 and t = 10 −4 (for finite difference methods). It also shows that the results of the presented methods are better than the results of [24]. Tables 8, 9 show L ∞ and L 2 errors for T = 10, x = 0.05 and two different choices of t. These tables clearly show that the numerical results of I-EFD and FI-EFD methods are in good agreement with the exact solution. Figure 5 shows exact and numerical solutions computed by I-EFD method for T = 5, t = 0.001, and x = 0.05. Figure 6 shows numerical solution computed by I-EFD method for T = 1, t = 0.05, and x = 0.1.
Arab. J. Math. To compute the rate of convergence, we half the grid size h, and then use the formula: where E is a norm given by: where k 0 ≥ 0 is a suitable integer. To estimate p, we suppose x (k+1) − α = ε k+1 , x (k) − α = ε k , and so, the previous inequality will be ε k+1 ≤ Cε p k . Therefore: Table 10 shows rate and order of convergence of Example 5.1 using I-EFD and FI-EFD methods for T = 4, t = 10 −4 , and x changes as N changes. It also shows that I-EFD and FI-EFD are second-order accurate in space, and that the methods are consistent, because the error goes to zero as x is getting smaller. Table 11 shows rate and order of convergence of Example 5.1 using I-EFD and FI-EFD methods for T = 2, x = 0.1, and t changes as N changes. It also shows that I-EFD and FI-EFD are first-order accurate in time, and that the methods are consistent, because the error goes to zero as t is getting smaller.

Conclusion
This manuscript introduced two different exponential finite difference methods, which are implicit exponential finite difference method and fully implicit exponential finite difference method for solving the NWS equation in (1.2). It is shown that both schemes are consistent. Furthermore, it is shown that the local truncation errors are first-order accurate in time and second-order accurate in space. Moreover, the numerical results confirmed the order of convergence in time and in space. The presented methods are computationally consistent, stable, convergent, and offer better accuracy than other methods.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.