1. Introduction
Many physical and mathematical developments that have taken place recently (due to various chemical as well as diffusion-like systems) in the sciences, ecology, population dynamics, biochemistry and engineering, to mention a few fields, have attracted extensive attention. These physical developments correspond to several phenomena in which chemical substances are transformed into each other. For more on these, see [
1,
2]. All these activities are modeled to mathematical equations describing semi-linear parabolic partial differential equation, where the reaction–diffusion equation occurs. In this paper, we are concerned with the study of the following two-dimensional semi-linear reaction–diffusion equation of the following type:
where
is an open-bounded set contained in
with
D as a matrix with positive constant and
as an unknown scalar function.
In addition to the description of the formation of the semi-linear reaction–diffusion equation stated above, these equations originate naturally in systems consisting of many interesting components in a variety of biological, chemical, physical and population dynamics fields. In certain situations, as in [
2], the patterns are seen as phase-field transitional systems. This is a situation in which the phase function
u describes the transition between the solid and liquid phases in the solidification process of a material occupying a region
. The above reaction–diffusion equation could be seen to be exhibiting a type of Allen–Cahn equation in [
3,
4,
5], which is used to describe the motion of anti-phase boundaries in crystalline solids. This has been widely applied to many complex moving interface problems, for example the mixture of two incompressible fluids and the nucleation of solids and vesicle membranes; see [
6] for more. Specifically, the Equations (
1)–(
3) arise in the study of the superconductivity of liquids and have been studied in J. Smoller [
7]. A great deal of work has been undertaken on the nonlinear reaction–diffusion equation, and for more on this see [
8,
9,
10,
11,
12].
The above class of partial differential equations have been analyzed using several methods, such as the fixed node finite difference methods in [
13] and the spectral method in [
14]. This was followed by some other methods, which have good numerical stability and can be used for multi-dimensional purposes, as presented in [
15]. These methods include the method by Sharifi and Rashidian [
16], who applied an explicit finite difference associated with extended cubic
B-spline collocation method. There is also a method by Wang et al. [
17] called the compact boundary value method (CBVM), which is a combination of a compact fourth-order differential method (CFODM) and the
P-order boundary value method (POBVM). This method is locally stable and when applied to the equation will obtain a unique solution. Another method is the one by Wu et al. [
18], called the variational iteration method (VIM), used for structuring equations, and the Lagrange multipliers and numerical integral formulas are used with this method. Last but not the least is the method by Biazar and Mehriatifan in [
19], which solved the equation using the compact finite difference method.
In contrast to the above good methods stated for the analysis of the problem, only very few or none have used the coupling technique as a tool for the analysis of this problem, to the best of this author’s knowledge. To this end, we exploited the gap and designed a very reliable and efficient scheme, consisting of the nonstandard finite difference method in time and the Galerkin combined with the compactness method in the space variables (NSFD-GM) in a two-dimensional setting. This method can be used to show that the solution obtained from the semi-linear reaction–diffusion equation exists uniquely. We also proceed to show, using the a priori estimates obtained from the existence of the variational or weak solution, that the designed scheme is stable. The stability of the scheme is further tested for its optimal convergence with the - as well as the -norms to be defined later. Furthermore, we show that the designed scheme (NSFD-GM) preserves or replicates the decaying properties of the exact solution. Numerical experiments are then presented with a carefully chosen example to justify that the numerical results obtained from the above experiments indeed validate the theory presented in the work.
The above method has been used extensively in a one-dimensional situation such as in [
20]. It should, however, be noted that the aforementioned one-dimensional case was an extension of the pioneering work in [
21], from where the method was initiated in a linear situation over a non-smooth geometry. Our goal in this article was to see whether or not the method could be applicable in a two- or higher-dimensional setting. The relevance of the method could be deduced from the fact that the designed schemes that have in the past emanated from this method preserve or replicate all the qualitative properties of the exact solution of the problems that they have solved. In addition, where the method has been used, it has also performed better than the traditional Euler method. One could also attempt to remark that since real life problems such as this appear mostly in higher dimensional settings, if the method is found to perform exceptionally well, then that will be a remarkable achievement for the method in that framework. The founder of the NSFD method was Mickens [
22] and major contributions to the foundation and application to the method can be found in [
23,
24,
25,
26]. As for the overview of the method, see [
27]. The comparison of the finite and nonstandard finite difference methods can be seen in [
22].
The organization of this article begins from
Section 2, where we briefly outline the notations and tools to be used subsequently in the article. This is followed by
Section 3, which addresses the existence and uniqueness of the solution of the problem. We proceed to design the numerical scheme in which convergence analysis is established in
Section 4.
Section 5 is then devoted to carrying out the numerical experiments with a carefully chosen example to justify the theory. Conclusions and future remarks are finally stated in
Section 6.
2. Notations and Preliminaries
In this section, for the sake of completeness, we gather some important notations with tools such as definitions, concepts and inequalities that will play some important roles in the analysis of the problem. Some of these preliminary tools may duplicate some tools from these papers [
20,
28,
29,
30], the reason being that these papers deal with related subjects that need the same tools. Among these tools are function spaces such as the space
. This space, in summary, is defined as a linear space of infinitely differentiable functions with compact support in the domain
, where
in our case will be a two-dimensional open set contained in
. The above mentioned space
is followed by the space of distributions
, which is its pair. The duality pairing of these two spaces is denoted by
. In between these two spaces are the
spaces which are also essential, and this, in summary, is defined by
for
. The
space is known to be a Banach space with the norm defined by
For more on these spaces, see [
31,
32,
33]. Another very important function space is the Sobolev space, denoted and defined by
for
and
with
. The above space (
5) with the norm defined by
or
which is also a Banach space. When
in the above Sobolev space, the notation
is applied and often denoted by
and called a Hilbert space. Most often, we use the superscript
when referring to its norm and semi-norm, especially where there is no ambiguity. See Lions and Magenes [
33] for more details. Continuing in the gathering of tools, we would like to introduce another, more general Sobolev space denoted by
, where
X is a Hilbert space. The above space, as viewed by Lions and Magenes [
33], is defined in summary as the space of square integrable functions taking values from
to
X. The norm of this space is defined by
In view of (
8),
X could be seen as either
or
space and in a particular situation of ours,
and
. The following inequalities will be used in this paper: Hölder, Gronwall’s, Young’s, Poincaré and Gagliador-Nirenburg inequality. For more inequalities not listed here, we will refer to standard reference materials such as in [
31,
32,
33,
34,
35] when required.
We conclude the assembly of the tools by introducing the following numerical space, denoted by
, needed for the analysis of the discrete problem. This space is finite-dimensional and is defined by
where
is the space of a polynomial of a degree less than or equal to 1.
, as stated above, will be a regular mesh of the domain
, consisting of compatible triangles
of sizes
. For more details on this see [
34]. In view of (
9), we observe that, for each
, we associate a finite element space
of a continuous linear piece-wise test function with a value of 1 or zero at every other node of
. That is, if
are the interior nodes of
, then any function in
is uniquely determined by its values at the point
and it should also be noted that
.
3. The Semi-Linear Reaction–Diffusion Equation
This section is set aside to show that by using Galerkin in combination with the compactness methods, the solution of the two-dimensional semi-linear reaction–diffusion Equations (
1)–(
3) exits uniquely in the space
for initial data given in (
3). The a priori estimates obtained in the above analysis of the theoretical framework will be crucial to the NSFD-GM numerical scheme, which will be outlined in
Section 4. In view of this, we proceed to show this by first stating the following variational or weak problem of the semi-linear reaction–diffusion Equations (
1)–(
3), finding
such that
for all
. This is undertaken by making use of the orthonormal basis of
functions denoted by
, where
. With these basic functions, we can make use of the test function
v spanned by
to denote and define the approximation of the solution
u of the equation through
We can then proceed to apply the above Galerkin framework (
13) to the semi-linear reaction–diffusion Equations (
1)–(
3). The approximation
of the said equation satisfies the following Galerkin system of equations:
where the above projection
denotes the orthogonal projection
and
is defined in Equation (
9). This means that the operator is extended from
into
and defined on the
by
At this point, we should state that Equations (
14)–(
16) are also satisfied, with the discrete solution
taking values in the finite dimensional subspace
. The connection between the semi-linear reaction–diffusion Equations (
1)–(
3) and their approximate Galerkin system of Equations (
14)–(
16) stated above validate the fact that these equations are equivalent, as seen classically in Temam, 1997 [
11], and Evans, 1998 [
32]. The above connection provides the framework to proceed and shows that the solution of the semi-linear reaction–diffusion equation exists uniquely. This can be achieved thanks to the next Theorem 1.
Theorem 1. There exists a unique solution u of the semi-linear reaction–diffusion Equations (1)–(3) in the space given in (10), such that the variational solutions of Equations (11) and (12) are satisfied for the initial solution , with its Dirichlet boundary conditions. We will use three subsections to prove this Theorem. These will be
Section 3.1, where we will address the uniform approximation of the solution, followed by
Section 3.2, where the boundedness of the approximate solution and passage to the limit will be achieved using the compactness method. The uniqueness of the solution of the problem will be shown in
Section 3.3.
3.1. Uniform Approximate Solution Estimates of the Equation
To show the uniform approximation estimate of the semi-linear reaction–diffusion equation, we will first consider, here and after, that
C will denote all constants independent of
m. With this in mind, and
in Equations (
11) and (
12), the yield of the variational Equations (
14)–(
16) will be
where
was set. Proceeding to use the Sobolev embedding Theorem and the fact that
, we bound the third term of (
19) as follows:
and introducing it back into Equation (
19), yielded
after taking
for simplicity’s sake. Hence, taking the integral of both sides of (
20) with respect to the time interval
t yields
Applying the Gronwall inequalities, keeping only the term
on the left-hand side of (
21), we obtain
Using (
22) in (
21), we find
Hence, in view of the inequalities (
22) and (
23), this shows that the apprimate solution
is uniformly bounded in the space (
10). We are now left to estimate the fact that
is also uniformly bounded in (
11). To this end, we show, in view of (
11),
We proceed with (
28) to bound the first and second terms of the right-hand side of the inequality, to produce
Using the inequalities (
22) and (
23), the Sobolev embedding Theorem
, the supremum over the time interval
t and the Gagliardo Nirenberg inequality, the first, second and third terms on the right-hand side of (
25) are bounded as follows:
after using the fact that
and
, and hence we conclude from above that
All the analysis resulting in (
22), (
23) and (
27), above, concludes that the sequence of solutions
is uniformly bounded in the following space (
10).
3.2. Boundedness and Passage to the Limit of Approximate Solution of the Equation
In view of the analysis of the uniform boundedness of the approximate solution in
Section 3.1, we proceed to show that the sequences of solution
will converge strongly to the solution
. To this end, we proceed by recalling the fact that we have obtained the following approximate solution
defined on the
:
In view of the embedding of
by Banach–Alaoglu’s Theorem found in [
36], there exists a subsequence of
still denoted by
, such that
and in view of the following Theorem 2 found in [
36],
Theorem 2. Suppose that are Banach spaces in which are reflexive and X is compactly embedded in Y. Let . If the functions are such that is uniformly bounded in and is uniformly bounded in , then there is a subsequence that converges strongly in .
With the strong convergence of the approximate solution
in
, what remains to be shown now is that the solution satisfies Equation (
12). To achieve this, we introduce another test function
with values
and
and also continuously differentiable on the interval
. With this in place, we proceed in view of Equation (
19) and the function
:
If, in Equation (
28), integration by parts with respect to
t over the interval
is applied, then we obtain
Using Theorem 2, the approximate solution
is uniformly bounded. Then, passing to the limit, we have a yield in view of (
29) as follows:
which holds in particular for
. This therefore means that the solution
u in Equation (
30) is satisfield in the distributional sense. Therefore, in view of Equations (
28) and (
30), this yields
and Equation (
12) is obtained as required.
3.3. Uniqueness of the Solution of the Equation
We devote this subsection to the uniqueness of the solution of the semi-linear reaction–diffusion Equations (
1)–(
3). We address this by letting
and
be two solutions of the equations, such that
and
. Since
u satisfies Equations (
1) and (
2), then
In view of this, we proceed, using Equation (
1), to obtain
from which, after factorizing
and multiplying throughout by
u, we obtain
after using Hölder’s inequality. Estimating the right hand side of Inequality (
32) thanks to the Gagliardo–Nirenberg inequality, we obtain
after using the Young inequality. Introducing (
33) back into (
32) yields
where
. Integrating the inequality (
34) with respect to
t over the interval
and keeping only the term
on the left-hand side yields
after applying the Gronwall inequality. Hence, this proves the uniqueness of the solution of the problem.
4. The Design of the Coupled NSFD-GM Numerical Scheme
Instead of the theoretical analysis of the two-dimensional semi-linear reaction–diffusion equation in
Section 3, we apply the a priori estimates obtained from the above section to analyze this section. In view of the complexity that comes from the analysis of the two-dimensional situation of semi-linear equations such as ours, we proceed to use the one-dimensional case in [
20] as a reference model to analyze the stability and the convergence results from the designed NSFD-GM numerical scheme. In view of this, we have set aside this section to design and analyze the NSFD-GM numerical scheme mentioned in
Section 1. This analysis will be achieved in two subsections, which are
Section 4.1, where we will address the stability of the scheme and the optimal convergence of the scheme in both the
- as well as the
-norms, and
Section 4.2, which will show that the scheme preserves the decaying properties of the exact solution. In view of the above three objectives, we start by stating the discrete version of the variational or weak forms (
11) and (
12), as follows: find
, and the discrete solution such that
where
is the orthogonal projection onto
.
The above discrete form connects us from the continuous to the discrete framework, which is geared toward the analysis of the numerical solution of (
35) and (
36). The above framework can proceed by assuming the regularity of the solution
u of (
11) and (
12) and the subspace
, as seen in [
34]. Other useful inequalities to be used in this analysis will be
where
is the usual norm in
and
is a standard Sobolev space with some constant
C. Also, if
u is sufficiently smooth for a closed time interval
, then it is well-known in view of [
37] that
where
is the bound on
U and
with
as the constant in (
38).
Setting in place the above desired framework, we continue and let the time step size
for
over the time interval
. This then led us to find the NSFD-GM-approximate solution
such that
at each discrete time
in the space
for sufficiently smooth functions. The stated approximation permits us to define the NSFD-GM scheme of the semi-linear reaction–diffusion equation as one which consists of a fully discrete solution
such that for
,
are satisfied, where
The above new framework needs the following components:
- (a)
The special and complicated function
where
is in such a way that
- (b)
If the nonlinear function
is made in such a way that its effect is negligible or even zero, then the scheme (
39) will coincide with the exact scheme
which, in view of Michens [
22], replicates or preserves the decaying-to-zero property of the scheme under investigation; this is actually the main point of the novelty of the method.
4.1. The Stability of the Coupled NSFD-GM Numerical Scheme
In this subsection, we show that the NSFD-GM scheme of (
39) and (
40) is stable. That is, we show that the numerical solution of the above scheme is uniformly bounded as the following Theorem 3:
Theorem 3. If we assume that the semi-linear reaction–diffusion equation u in Equations (11) and (12) is regular, then for a given initial solution , the numerical solution of the scheme (39) and (40) will remain bounded and satisfy the following estimates: Proof. We prove the above theorem by first letting
in Equation (
39) yield
from where we have, in view of (
20),
It is well-known, in view of the first term of the left-hand side of the inequality (
58), that
and re-introducing this equality back into (
58) yields
Taking the sum to
of the above inequality (
47), we obtain
In view of (
22) and (
23), we can immediately read the results (
44) and (
45) from (
48) as required. □
4.2. Optimal Convergence of the Coupled NSFD-GM Numerical Scheme
We devote this subsection to showing that the numerical solution obtained from the NSFD-GM scheme converges optimally in both
- and
-norms, and also that these solutions replicate or preserve the decay-to-zero properties of the exact solution. To achieve these two objectives, we first state without proof the following results from Shen [
38].
Lemma 1. Let and for the integer be non-negative numbers such that With the above Lemma 1 and NSFD-GM framework in mind, we can then state and prove the error estimate in Theorem 4, next.
Theorem 4. We assume that is a non-negative number and that the continuous and discrete solutions of the semi-linear reaction–diffusion Equations (39) and (40), respectively, exist uniquely and satisfy Then, the following error estimateis satisfied. Proof. The above Theorem is proved by using the implicit non-standard finite difference method in the time as follows:
In view of the non-standard Taylor’s integral Theorem, we find
Subtracting Equation (
54) from (
53) and noting that
yields
after setting
and multiplying Equation (
53) by
. Estimating the first term of the right-hand side of Equation (
55), we find
after using the fact that
. Estimating each term on the right-hand side of the inequality (
56) using Gagliardo–Nirenberg and Young’s inequality with the fact that
yields the following inequality, beginning with the third term:
This is followed by the second term, as follows,
and lastly by the first term:
Re-introducing (
57)–(
59) into inequality (
56) yields
By estimating the third term of the right-hand side of the inequality (
55), we find
because according to Poincare inequality,
. Using the fact that there exists a function
yields
Introducing this and Hölder’s inequality in (
61), we obtain
after using Young’s inequality for arbitrary
. Re-introducing the inequalities (
60) and (
62) into (
55) produces the following for
:
where
and
In view of inequality (
63), it is well known that the first term of the left-hand side is
and introducing this back into inequality (
63),
Arranging the terms in inequality (
64) and setting
and
and summing partially for
and also using the fact that
, we obtain
Applying Lemma 1 in inequality (
65) yields
provided that
and
Since
and
are all positive series, then in view of Lemma 1,
and the proof of the theorem is completed. □
The error estimate shown above leads to the following optimal rate of convergence in both the - and -norms, as follows.
Theorem 5. Assuming that the above error estimate in Theorem 4 is satisfied, then the numerical solution of the semi-linear reaction–diffusion scheme (39) and (40) has the following optimal rate of convergence:using the NSFD-GM method, where depends on t. Furthermore, the discrete solution replicates all the qualitative properties of the exact solution of the equation under investigation. Proof. We proceed to prove the above theorem by using the following error decomposition equation:
where
and
. In view of the above inequality (
68), the estimate
represents the error inherent in the Galerkin approximation of the linearized reaction–diffusion equation, and that of the estimate
is the error caused by the nonlinearity in the problem. The above error decomposition in Equation (
68) further leads to the following inequality:
after using inequalities (
38) and (
67). With these inequalities in place, we conclude without difficulty that inequality (
69) is indeed optimal.
To complete the preserving of the qualitative properties of the exact solution, we proceed to show, in view of the remark from Mickens [
22], that the above scheme was designed for
Based on the above approximation (
70), we observe that as
, the function
. In view of this, we deduced that the numerical schemes (
39) and (
40) converge point-wise in
to the solution
u as
according to the compactness Theorem. We justify this as follows: If we choose the source term of our scheme (
39) to be
and
, then we have
If we, in addition, let the support of
be very small, so much so that the test function
far inside the support, say
and
F, is regular, then integrating Equation (
71) over
will culminate in the fact that the solution over
is equivalent to the point-wise convergence of the scheme (
71). In view of [
31], the assertion that the scheme NSFD-GM replicates the qualitative properties of the exact scheme (
43) is achieved. For more on this, see [
20,
28,
29,
30]. This completes the second part of the proof. □
5. Numerical Experiments
Numerical experiments will be performed in this section to compute the numerical solution of the nonlinear reaction–diffusion Equations (
1)–(
3). These experiments will be computed over a two-dimensional domain
and the time interval
. The domain
will be regularly discretized into uniform triangular meshes denoted by
, where
h is the mesh size and the basic functions used will be linear Lagrange-type functions. The mesh size will be defined by
, where
M is the number of nodes in the triangulations. The time space
will be discretized with a step size of
. The right-hand side of Equations (
1)–(
3), denoted by
, will be determined by introducing a carefully chosen example:
We will proceed to use
in the NSFD-GM scheme of the semi-linear reaction–diffusion Equation (
39) to give the following numerical computable scheme:
where
- (a)
M is the mass matrix;
- (b)
A is the stiffness matrix;
- (c)
is the mass matrix with respect to the semi-linear function ;
- (d)
is the prescribed right hand side of the Equation (
39).
In view of the above scheme (
73),
is the Jacobian matrix and
is the Residual vector. With the above scheme, we proceed by evaluating the matrices
and
locally over a reference element and the basic function
. Using this, together with Newton’s iterative method using the following initial solution (
74), the numerical solution from the scheme can be obtained:
The above experiments were conducted using the software Matblab 7.100(R2014a). The following specifications were used:
, denoting the value of the parameter on the complicated denominator function
; the final time
and
; and
M ranging from
, and 240 to 280. With the above data, the Newton’s iterative method will yield the results in
Figure 1,
Figure 2 and
Figure 3.
After the figures follow the tabular illustrations of the error and rate of convergence in the solutions, shown in
Table 1 and
Table 2 for a specified value of
.
Observations 1. Our expectations were that the rate of convergence in the -norm would be 2 and that in the -norm it would be 1, using both the NSFD-GM and SFD-GM schemes. To our great surprise, the results tended to be approximately 2 and 1 for both the - and -norms, respectively. Even though these values were not far from their expected values, the values of the NSFD-GM scheme in both norms were larger than those from their given counterpart SFD-GM scheme. This advantage of the NSFD-GM scheme over the SFD-GM scheme might be because of the principle of its design, keeping aside its effectiveness, accuracy and viability. It is also well-known and shown in the proof of Theorem 5, above, that the numerical solution from the NSFD-GM scheme exhibits the preservation or replication of the qualitative properties of the exact solution of the problem under investigation. These two reasons are what make the study very interesting, and the properties convince one to consider the NSFD-GM scheme to be a favorite in terms of a fair alternative over a more traditional SFD-GM scheme. The major advantage of the NSFD-GM over the more traditional SFD-GM scheme could be drawn from their rates of convergence, found in the two tables above. These rates of convergence values or results are clear and speak for themselves.