Next Article in Journal
Computational Fluid Dynamics-Based Systems Engineering for Ground-Based Astronomy
Next Article in Special Issue
Natural Convection Fluid Flow and Heat Transfer in a Valley-Shaped Cavity
Previous Article in Journal / Special Issue
Hybrid Nanofluid Flow over a Shrinking Rotating Disk: Response Surface Methodology
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Theory and Computation of the Semi-Linear Reaction–Diffusion Equation with Dirichlet Boundaries

Department of Mathematics and Applied Mathematics, Sefako Makgatho Health Sciences University, Medunsa, Ga-Rankuwa, Pretoria 0204, South Africa
Computation 2024, 12(7), 142; https://doi.org/10.3390/computation12070142
Submission received: 6 June 2024 / Revised: 4 July 2024 / Accepted: 8 July 2024 / Published: 11 July 2024

Abstract

:
In this article, we study the semi-linear two-dimensional reaction–diffusion equation with Dirichlet boundaries. A reliable numerical scheme is designed, coupling the nonstandard finite difference method in the time together with the Galerkin in combination with the compactness method in the space variables. The aforementioned equation is analyzed to show that the weak or variational solution exists uniquely in specified space. The a priori estimate obtained from the existence of the weak or variational solution is used to show that the designed scheme is stable and converges optimally in specified norms. Furthermore, we show that the scheme preserves the qualitative properties of the exact solution. Numerical experiments are presented with a carefully chosen example to validate our proposed theory.

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:
u t Δ u + ( | u | 2 1 ) u = 0 , ( x , t ) Ω × ( 0 , T )
u ( x , t ) = 0 on Ω × ( 0 , T )
u ( x , 0 ) = u 0 ( x ) for x Ω t = 0 ,
where Ω R 2 is an open-bounded set contained in R 2 with D as a matrix with positive constant and u : Ω R 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 L 2 - as well as the H 1 -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 D ( Ω ) . 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 R 2 . The above mentioned space D ( Ω ) is followed by the space of distributions D ( Ω ) , which is its pair. The duality pairing of these two spaces is denoted by · , · . In between these two spaces are the L p ( Ω ) spaces which are also essential, and this, in summary, is defined by
L p ( Ω ) : = v : Ω | v ( x ) | p d x 1 / p < .
for 1 < p < + . The L p ( Ω ) space is known to be a Banach space with the norm defined by
v L p ( Ω ) = Ω | v ( x ) | p d x 1 / p .
For more on these spaces, see [31,32,33]. Another very important function space is the Sobolev space, denoted and defined by
W m , p ( Ω ) : = v L p ( Ω ) : D α v L p ( Ω ) , for   all   multi   index | α | m .
for m N and p R with 1 < p . The above space (5) with the norm defined by
v m , p , Ω = | α | m D α v L p ( Ω ) 1 / p , p <
or
v m , , Ω = sup | α | m e s s sup x Ω | D α v ( x ) | , p = .
which is also a Banach space. When p = 2 in the above Sobolev space, the notation W m , 2 ( Ω ) is applied and often denoted by H m ( Ω ) and called a Hilbert space. Most often, we use the superscript p = 2 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 H m [ ( 0 , T ) ; X ] , 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 [ 0 , T ] to X. The norm of this space is defined by
v H m [ ( 0 , T ) ; X ] : = | α | m 0 T D α v ( x ) X 2 d t 1 / 2 .
In view of (8), X could be seen as either L p or W m , p space and in a particular situation of ours, H 0 1 , L 2 , L 4 and H 0 m . 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 V h , needed for the analysis of the discrete problem. This space is finite-dimensional and is defined by
V h : = v h C 0 ( Ω ¯ ) : v h | Ω = 0 , v h | J P 1 , J J h
where P 1 is the space of a polynomial of a degree less than or equal to 1. J h , as stated above, will be a regular mesh of the domain Ω , consisting of compatible triangles J of sizes h J < h . For more details on this see [34]. In view of (9), we observe that, for each J h , we associate a finite element space V of a continuous linear piece-wise test function with a value of 1 or zero at every other node of V . That is, if { P j } j = 1 n are the interior nodes of J h , then any function in V h is uniquely determined by its values at the point P j and it should also be noted that V h H 0 1 ( Ω ) .

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
L ( 0 , T ) ; L 2 ( Ω ) L 2 ( 0 , T ) ; H 0 1 ( Ω ) L 4 ( 0 , T ) ; L 4 ( Ω ) and u t L 2 ( 0 , T ) ; H 1 ( Ω )
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 u ( x , t ) L ( 0 , T ) ; L 2 ( Ω ) L 2 ( 0 , T ) ; H 0 1 ( Ω ) L 4 ( 0 , T ) ; L 4 ( Ω ) such that
u t , v + u , v + ( | u | 2 1 ) u , v = 0
u ( x , 0 ) , v = u 0 , v .
for all u 0 , v H 0 1 ( Ω ) . This is undertaken by making use of the orthonormal basis of L 2 functions denoted by e 1 , e 2 , , e m H 0 1 H 2 ( Ω ) , where m N . With these basic functions, we can make use of the test function v spanned by v s p a n e 1 , e 2 , , e m to denote and define the approximation of the solution u of the equation through
u m = i = 1 m γ i ( t ) e i .
We can then proceed to apply the above Galerkin framework (13) to the semi-linear reaction–diffusion Equations (1)–(3). The approximation { u m } , m N of the said equation satisfies the following Galerkin system of equations:
u m t Δ u m + P m ( | u m | 2 1 ) u m = 0 , on Ω × ( 0 , T )
u m ( x , t ) = 0 on Ω × ( 0 , T )
u ( x , 0 ) = P m u 0 on Ω
where the above projection P m denotes the orthogonal projection
P m : H 1 ( Ω ) V m H 1 ( Ω ) .
and V m is defined in Equation (9). This means that the operator is extended from L 2 ( Ω ) into H 1 ( Ω ) and defined on the H 1 ( Ω ) by
P m k m γ m k ( t ) u k = k = 1 m γ m k ( t ) u k .
At this point, we should state that Equations (14)–(16) are also satisfied, with the discrete solution u m taking values in the finite dimensional subspace V m . 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 u 0 H 0 1 ( Ω ) , 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 v H 0 1 ( Ω ) in Equations (11) and (12), the yield of the variational Equations (14)–(16) will be
1 2 d d t u m L 2 2 + u m L 2 2 + Ω | u m | 2 u m u m u m d x = 0
where v = u m was set. Proceeding to use the Sobolev embedding Theorem and the fact that L 4 H 1 , we bound the third term of (19) as follows:
Ω u m 2 ( | u m | 2 1 ) d x u m L 4 4 u m L 2 2
and introducing it back into Equation (19), yielded
1 2 d d t u m L 2 2 + u m L 2 2 + u m L 4 4 u m L 2 2 .
after taking D = 1 for simplicity’s sake. Hence, taking the integral of both sides of (20) with respect to the time interval t yields
u m L 2 2 + 0 t u m L 2 2 + u m ( s ) L 2 4 d s u 0 L 2 2 + 0 t u m ( s ) L 2 2 d s .
Applying the Gronwall inequalities, keeping only the term u m ( t ) L 2 2 on the left-hand side of (21), we obtain
u m L 2 2 C u 0 L 2 2 e T .
Using (22) in (21), we find
0 t u m ( s ) L 2 2 + u m ( s ) L 4 4 d s C u 0 L 2 2 .
Hence, in view of the inequalities (22) and (23), this shows that the apprimate solution u m is uniformly bounded in the space (10). We are now left to estimate the fact that u m t H 1 is also uniformly bounded in (11). To this end, we show, in view of (11),
0 T u m t , v d x 0 T | u m | L 2 2 , | v | L 2 2 d x + 0 T u m ( | u m | 2 1 ) , v d x
We proceed with (28) to bound the first and second terms of the right-hand side of the inequality, to produce
0 T u m t , v d x 0 T | u m | L 2 2 , | v | L 2 2 d x + 0 T u m , v d x + 0 T u m L 4 3 v L 2 d x 0 T | u m | L 2 2 , | v | L 2 2 d x + 0 T u m L 4 v L 2 d x + 0 T u m L 4 3 v L 2 d x
Using the inequalities (22) and (23), the Sobolev embedding Theorem H 1 L 2 , 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:
0 T u m t , v d x C 1 + C 2 sup 0 t T u L 2 1 / 2 0 T u m L 2 1 / 2 + C 3 sup 0 t T u m L 2 3 / 2 0 T u m L 2 3 / 2 C
after using the fact that w H 1 = sup v H 0 1 | < w , v > | and v H 1 1 , and hence we conclude from above that
0 T u m ( s ) t H 1 d s C .
All the analysis resulting in (22), (23) and (27), above, concludes that the sequence of solutions { u m } , m N 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 { u m } will converge strongly to the solution u ( t ) . To this end, we proceed by recalling the fact that we have obtained the following approximate solution { u m } defined on the [ 0 , T ] :
u m is   uniformly   bounded   in L ( 0 , T ) ; L 2 ( Ω ) u m is   uniformly   bounded   in L 2 ( 0 , T ) ; H 0 1 ( Ω ) u m is   uniformly   bounded   in L 4 ( 0 , T ) ; L 4 ( Ω ) u m t is   uniformly   bounded   in L 2 ( 0 , T ) ; H 1 . ( Ω )
In view of the embedding of
H 0 1 ( Ω ) L 2 ( Ω ) H 1 ( Ω )
by Banach–Alaoglu’s Theorem found in [36], there exists a subsequence of u m still denoted by u m , such that
u m u weakly   star   in L ( 0 , T ) ; L 2 ( Ω ) u m u weakly   in L 2 ( 0 , T ) ; H 0 1 ( Ω ) u m u weakly   in L 4 ( 0 , T ) ; L 4 ( Ω ) u m t u t weakly   in L 2 ( 0 , T ) ; H 1 . ( Ω )
and in view of the following Theorem 2 found in [36], u m u strongly   in L 2 ( 0 , T ) ; L 2 ( Ω ) .
Theorem 2.
Suppose that X Y Z are Banach spaces in which X , Z are reflexive and X is compactly embedded in Y. Let 1 < p < . If the functions w N : ( 0 , T ) X are such that w N is uniformly bounded in L 2 ( 0 , T ) ; X and u t is uniformly bounded in L p ( 0 , T ) ; Z , then there is a subsequence that converges strongly in L 2 ( 0 , T ) ; Y .
With the strong convergence of the approximate solution u m in L 2 ( 0 , T ) ; L 2 ( Ω ) , what remains to be shown now is that the solution satisfies Equation (12). To achieve this, we introduce another test function ψ ( t ) with values ψ ( 0 ) = 1 and ψ ( T ) = 0 and also continuously differentiable on the interval [ 0 , T ] . With this in place, we proceed in view of Equation (19) and the function ψ ( t ) :
u m t , v ψ ( t ) + u m , v ψ ( t ) + u m ( | u m | 2 1 ) , v ψ ( t ) = 0 .
If, in Equation (28), integration by parts with respect to t over the interval [ 0 , T ] is applied, then we obtain
0 T u m t , ψ ( t ) v d t + 0 T u m , v ψ ( t ) d t + 0 T u m ( | u m | 2 1 ) , v ψ ( t ) d t = u ( 0 ) , v ψ ( t ) .
Using Theorem 2, the approximate solution u m is uniformly bounded. Then, passing to the limit, we have a yield in view of (29) as follows:
0 T u t , ψ ( t ) v d t + 0 T u , v ψ ( t ) d t + 0 T u ( | u | 2 1 ) , v ψ ( t ) d t = u ( 0 ) , v ψ ( t ) .
which holds in particular for ψ ( t ) D ( 0 , T ) . 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
u ( 0 ) u 0 , v = 0 v H 0 1 ( Ω )
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 u 1 and u 2 be two solutions of the equations, such that u : = u 1 u 2 and u | Ω = 0 . Since u satisfies Equations (1) and (2), then u ( 0 ) = u 1 ( 0 ) u 2 ( 0 ) = 0 . In view of this, we proceed, using Equation (1), to obtain
u t Δ u + u 1 | u 1 | 2 u 1 ( u 2 | u 2 | 2 u 2 ) = 0
from which, after factorizing | u 1 | 2 | u 2 | 2 = ( | u 1 | + | u 2 | ) ( | u 1 | | u 2 | ) and multiplying throughout by u, we obtain
1 2 u L 2 2 + u L 2 2 Ω u | | L 4 2 | u 1 | 2 + 1 d x + Ω | u | L 4 2 | u 2 | | u 1 | d x + Ω | u | L 4 2 | u 2 | 2 d x
after using Hölder’s inequality. Estimating the right hand side of Inequality (32) thanks to the Gagliardo–Nirenberg inequality, we obtain
Ω | u | L 4 2 | u 1 | 2 + | u 1 | | u 2 | + | u 2 | 2 + 1 d x 1 2 u L 2 2 + u L 2 2 | u | 2 + | u 1 | | u 2 | + | u 2 | 2 + 1 2
after using the Young inequality. Introducing (33) back into (32) yields
1 2 u L 2 2 + 1 2 u L 2 2 C u L 2 2 Y
where Y = | u | 2 + | u 1 | | u 2 | + | u 2 | 2 + 1 . Integrating the inequality (34) with respect to t over the interval ( 0 , T ) and keeping only the term u L 2 2 on the left-hand side yields
u ( t ) L 2 2 C u ( 0 ) L 2 2 e 0 T Y 2 d t = 0 , t 0
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 L 2 - as well as the H 1 -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 v h : [ 0 , T ] V h , and the discrete solution such that
u h t , v h + u h , v h + | u h | 2 1 u h , v h = 0
u h ( x , 0 ) , v h = P h , v h V h
where P h is the orthogonal projection onto V h .
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 V h H 0 1 ( Ω ) , as seen in [34]. Other useful inequalities to be used in this analysis will be
P h v v C h 2 v H 2 , for v H 0 1 H 2
where · is the usual norm in L 2 and H 1 is a standard Sobolev space with some constant C. Also, if u is sufficiently smooth for a closed time interval [ 0 , T ] , then it is well-known in view of [37] that
| u ( t ) u h ( t ) | C 1 ( u , C 2 , C 3 ) h 2 , t [ 0 , T ]
where C 2 is the bound on U and u with C 3 as the constant in (38).
Setting in place the above desired framework, we continue and let the time step size t n = n Δ t for n = 0 , 1 , 2 , , N over the time interval [ 0 , T ] . This then led us to find the NSFD-GM-approximate solution U h n such that U h n u h n at each discrete time t n in the space V h 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 U h n V h such that for v h V h H 0 1 ( Ω ) ,
δ n U h n ( t ) , v h + U h n , v h + U h n | U h n | 2 1 , v h = 0 ,
U h n , v h = P h u 0 , v h ,
are satisfied, where
δ n U h n = U h n U h n 1 ϕ ( Δ t ) and ϕ ( Δ t ) = e λ Δ t 1 λ .
The above new framework needs the following components:
(a)
The special and complicated function ϕ ( Δ t ) where λ > 0 is in such a way that
0 < ϕ ( Δ t ) < 1 for n = 1 , 2 , 3 , , N
(b)
If the nonlinear function | U h n | 2 1 U h n is made in such a way that its effect is negligible or even zero, then the scheme (39) will coincide with the exact scheme
U h n + 1 U h n ϕ ( Δ t ) + U h n , v h = 0
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 U h 0 V h , the numerical solution U h n ( t ) of the scheme (39) and (40) will remain bounded and satisfy the following estimates:
| U h 0 | 2 | U h 0 | 2 + 2 ϕ ( Δ t ) C ( Ω ) ,
n = 1 N | U n U h n 1 | 2 | U h 0 | 2 + 2 ϕ ( Δ t ) C ( Ω ) .
Proof. 
We prove the above theorem by first letting v h = U h n ( t ) in Equation (39) yield
U h n ( t ) U n n 1 ( t ) , U h n ( t ) + ϕ ( Δ t ) U h n ( t ) L 2 2 + ϕ ( Δ t ) U h n ( t ) L 4 4 ϕ ( Δ t ) | U h n ( t ) | L 2 2 = 0
from where we have, in view of (20),
U h n ( t ) U n n 1 ( t ) , U h n ( t ) + ϕ ( Δ t ) U h n ( t ) L 2 2 + ϕ ( Δ t ) U h n ( t ) L 4 4 ϕ ( Δ t ) U 0 1 ( t ) L 2 2
It is well-known, in view of the first term of the left-hand side of the inequality (58), that
U h n ( t ) U h n 1 ( t ) , U h n ( t ) = 1 2 | U h n | 2 1 2 | U h n 1 | 2 + 1 2 | U h n U h n 1 | 2 .
and re-introducing this equality back into (58) yields
| U h n | 2 | U h n 1 | 2 + | U h n U h n 1 | 2 + 2 ϕ ( Δ t ) U h n L 2 2 + 2 ϕ ( Δ t ) U h n L 4 4 2 ϕ ( Δ t ) U h n L 2 2 .
Taking the sum to N of the above inequality (47), we obtain
| U h n | 2 + n = 1 N | U h n U h n 1 | 2 + 2 ϕ ( Δ t ) n = 1 N U h n L 2 2 + 2 ϕ ( Δ t ) n = 1 N U h n L 4 4 2 ϕ ( Δ t ) n = 1 N U h n L 2 2 + | U h 0 | 2 .
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 L 2 - and H 1 -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 Δ t , γ and a k , b k , d k , γ k for the integer k 0 be non-negative numbers such that
a J + k = 0 J b k Δ t k = 0 J d k a J Δ t + k = 0 J γ k Δ t + γ , J 0 .
Suppose that
d k Δ t < 1 a n d   s e t σ k = ( 1 d k Δ t ) 1 , k 0 .
Then, we have
a J + k = 0 J b k Δ t exp k = 0 J d k Δ t k = 0 J γ k Δ t + γ J 0 .
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 Φ k 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
Φ k ϕ ( Δ t ) < 1 a n d σ k = 1 Φ k ϕ ( Δ t ) 1 , k 0 .
Then, the following error estimate
u ( t J ) U h ( t J ) + ϕ ( Δ t ) k = 0 J ( u ( t J ) U h ( t J ) ) 2 C ( t J ) ( ϕ ( Δ t ) ) 2 , J 0 .
is satisfied.
Proof. 
The above Theorem is proved by using the implicit non-standard finite difference method in the time as follows:
U n + 1 U n ϕ ( Δ t ) = Δ U n + 1 + U n + 1 1 | U n + 1 | 2 .
In view of the non-standard Taylor’s integral Theorem, we find
u ( t n + 1 u ( t n ) ) ϕ ( Δ t ) = u ( t n + 1 ) t 1 2 t n t n + 1 2 u ( t ) t 2 ( t n + 1 t ) d t = Δ u ( t n + 1 ) + u ( t n + 1 ) 1 | u ( t n + 1 ) | 2 1 2 t n t n + 1 2 u ( t ) t 2 ( t n + 1 t ) d t .
Subtracting Equation (54) from (53) and noting that Θ n = u ( t n ) U n yields
1 ϕ ( Δ t ) Θ n + 1 Θ n , Θ n + 1 = u n + 1 1 | u n + 1 | 2 U n + 1 1 | U n + 1 | 2 , Θ n + 1 Θ n + 1 L 2 2 + 1 2 t n t n + 1 2 u ( t ) t 2 , Θ n + 1 ( t t n + 1 ) d t
after setting u n + 1 = u ( t n + 1 ) and multiplying Equation (53) by Θ n + 1 . Estimating the first term of the right-hand side of Equation (55), we find
Ω u n + 1 1 | u n + 1 | 2 U n + 1 1 | U n + 1 | 2 , Θ n + 1 d x Ω | Θ n + 1 | L 4 2 1 | u n + 1 | 2 2 d x + Ω | Θ n + 1 | L 4 2 | U n + 1 | H 1 2 d x + Ω | Θ n + 1 | L 4 2 | U n + 2 | H 1 | u n + 1 | d x
after using the fact that | U n + 1 | 2 | u n + 1 | 2 = ( | U n + 1 | | u n + 1 | ) ( | U n + 1 | + | u n + 1 | ) . Estimating each term on the right-hand side of the inequality (56) using Gagliardo–Nirenberg and Young’s inequality with the fact that H 1 L yields the following inequality, beginning with the third term:
Ω | Θ n + 1 | L 4 2 | U n + 1 | | u n + 1 | d x ϵ 2 Θ n + 1 2 + 1 2 ϵ Θ n + 1 L 2 2 U n + 1 L 2 u n + 1 L 2 2 .
This is followed by the second term, as follows,
Ω | Θ n + 1 | L 4 2 | U n + 1 | 2 d x ϵ 2 Θ n + 1 L 2 2 + 1 2 ϵ Θ n + 1 L 2 2 U n + 1 L 2
and lastly by the first term:
Ω | Θ n + 1 | L 4 2 1 | u n + 1 | 2 2 d x ϵ 2 Θ n + 1 L 2 2 + 1 2 ϵ Θ n + 1 L 2 2 1 | u n + 1 | 2 2
Re-introducing (57)–(59) into inequality (56) yields
  Ω u n + 1 1 | u n + 1 | 2 U n + 1 1 | U n + 1 | 2 , Θ n + 1 d x 3 ϵ 2 Θ n + 1 L 2 2 + 3 2 ϵ Θ n + 1 L 2 2 | u n + 1 | H 1 2 + | U n + 1 | H 1 2 + | U n + 1 | H 1 2 | u n + 1 | H 1 2 + 1
By estimating the third term of the right-hand side of the inequality (55), we find
1 2 ϕ ( Δ t ) t n t n + 1 2 u ( t ) t 2 , Θ n + 1 ( t t n + 1 ) d t C 2 ϕ ( Δ t ) | Θ n + 1 | t n t n + 1 2 u t 2 | t t n + 1 | d t .
because according to Poincare inequality, | Θ n + 1 | H 0 1 C | Θ n + 1 | L 2 . Using the fact that there exists a function
ϕ ( Δ t n ) < ϕ ( Δ t ) < ϕ ( Δ t n + 1 ) for t n < t < t n + 1
yields
t n t n + 1 | t t n + 1 | 1 / 2 ϕ ( Δ t ) ( t t n + 1 ) 1 / 2 ( ϕ ( Δ t ) ) 1 / 2 .
Introducing this and Hölder’s inequality in (61), we obtain
1 2 ϕ ( Δ t ) 2 u t 2 , Θ n + 1 ( t t n + 1 ) d t ϵ 2 Θ n + 1 | L 2 2 + C 2 ϵ ϕ ( Δ t ) t n t n + 1 2 t 2 H 1 2 d t ,
after using Young’s inequality for arbitrary ϵ > 0 . Re-introducing the inequalities (60) and (62) into (55) produces the following for ϵ = 1 / 2 :
1 ϕ ( Δ t ) Θ n + 1 Θ n , Θ n + 1 + 1 2 Θ n + 1 L 2 2 C Θ n + 1 L 2 2 Ψ n + 1 + C Φ n + 1 ϕ ( Δ t )
where
Ψ n + 1 = | U n + 1 | H 1 2 + | U n + 1 | H 1 2 | u n + 1 | H 1 2 + | | H H 1 2 + 1
and
Φ n + 1 = t n t n + 1 2 u t 2 H 1 2 d t .
In view of inequality (63), it is well known that the first term of the left-hand side is
Θ n + 1 Θ n , Θ n + 1 = 1 2 | Θ n + 1 | L 2 2 | Θ n | L 2 2 + | Θ n + 1 + Θ n | L 2 2
and introducing this back into inequality (63),
| Θ n + 1 | L 2 2 | Θ n | L 2 2 + | Θ n + 1 Θ n | L 2 2 + ϕ ( Δ t ) Θ n + 1 L 2 2 C ϕ ( Δ t ) Θ n + 1 L 2 2 Ψ n + 1 + C ϕ ( Δ t ) 2 Φ n + 1 .
Arranging the terms in inequality (64) and setting a k = Θ n + 1 L 2 2 and b k = Θ n + 1 L 2 2 and summing partially for k = 0 , 1 , 2 , , n 1 and also using the fact that a 0 = Θ 0 = u 0 U 0 = 0 , we obtain
a n + k = 0 n b k ϕ ( Δ t ) k = 0 n a k ϕ ( Δ t ) Ψ n + 1 + k = 0 n ϕ ( Δ t ) 2 Φ n + 1 .
Applying Lemma 1 in inequality (65) yields
a n + k = 0 n b k ϕ ( Δ t ) exp k = 0 n σ k ϕ ( Δ t ) Ψ n + 1 k = 0 n Φ n + 1 ( ϕ ( Δ t ) ) 2
provided that Ψ n + 1 ϕ ( Δ t ) < 1 and σ k = 1 Ψ n + 1 ϕ ( Δ t ) 1 k 0 . Since a n , b k , Ψ n + 1 and Φ n + 1 are all positive series, then in view of Lemma 1,
a n + k = 0 n b k ϕ ( Δ t ) C ( ϕ ( Δ t ) ) 2
and the proof of the theorem is completed. □
The error estimate shown above leads to the following optimal rate of convergence in both the L 2 - and H 1 -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:
u ( t ) U h ( t ) L 2 C ( t ) h 2 + ϕ ( Δ t )
using the NSFD-GM method, where C ( t ) depends on t. Furthermore, the discrete solution U h ( t ) 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:
u ( t ) U h ( t ) L 2 = u ( t ) P h u ( t ) + P h u ( t ) U h ( t ) L 2 ξ n L 2 + η n L 2
where ξ n L 2 = u ( t ) P h u ( t ) L 2 and η n L 2 = P h u ( t ) U h ( t ) L 2 . In view of the above inequality (68), the estimate ξ n L 2 represents the error inherent in the Galerkin approximation of the linearized reaction–diffusion equation, and that of the estimate η n L 2 is the error caused by the nonlinearity in the problem. The above error decomposition in Equation (68) further leads to the following inequality:
u ( t ) U h ( t ) L 2 C ( t n ) h 2 + C ( t n ) ( ϕ ( Δ t ) ) 2 , t [ t n , t n + 1 ]
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
ϕ ( Δ t ) = e λ Δ t 1 λ Δ t + O ( ( Δ t ) 2 ) .
Based on the above approximation (70), we observe that as Δ t 0 , the function ϕ ( Δ t ) Δ t . In view of this, we deduced that the numerical schemes (39) and (40) converge point-wise in V h H 0 1 ( Ω ) to the solution u as Δ t 0 according to the compactness Theorem. We justify this as follows: If we choose the source term of our scheme (39) to be U h 0 H 0 1 ( Ω ) and F L 2 ( 0 , T ) ; H 1 ( Ω ) , then we have
δ n U h n ( t ) , v h + U h n , v h + U h n | U h n | 2 1 , v h = F .
If we, in addition, let the support of F be very small, so much so that the test function v h = 1 far inside the support, say Ω 1 Ω 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 Ω = [ 0 , 1 ] × [ 0 , 1 ] and the time interval [ 0 , T ] . The domain Ω will be regularly discretized into uniform triangular meshes denoted by J h , where h is the mesh size and the basic functions used will be linear Lagrange-type functions. The mesh size will be defined by h = 1 M , where M is the number of nodes in the triangulations. The time space [ 0 , T ] will be discretized with a step size of Δ t . The right-hand side of Equations (1)–(3), denoted by f ( x , t ) , will be determined by introducing a carefully chosen example:
u ( x 1 , x 2 , t ) = ( 1 + 2 t 2 ) cos ( 2 π x 1 2 ) cos ( 2 π x 2 2 ) .
We will proceed to use f ( x , t ) in the NSFD-GM scheme of the semi-linear reaction–diffusion Equation (39) to give the following numerical computable scheme:
( M + ϕ ( Δ t ) A ) ϕ ( Δ t ) M = f ( x , t ) + ( M + ϕ ( Δ t ) A ) + M u 0 ϕ ( Δ t ) F ( u )
where
(a)
M is the mass matrix;
(b)
A is the stiffness matrix;
(c)
M F is the mass matrix with respect to the semi-linear function F ( u ) ;
(d)
f ( x , t ) is the prescribed right hand side of the Equation (39).
In view of the above scheme (73), ( M + ϕ ( Δ t ) A ) ϕ ( Δ t ) M is the Jacobian matrix and ( M + ϕ ( Δ t ) A ) + M u n 1 ϕ ( Δ t ) F ( u ) is the Residual vector. With the above scheme, we proceed by evaluating the matrices M , A and M F locally over a reference element and the basic function v h . Using this, together with Newton’s iterative method using the following initial solution (74), the numerical solution from the scheme can be obtained:
u 0 = u ( x 1 , x 2 , 0 ) = cos ( 2 π x 1 2 ) cos ( 2 π x 2 2 ) .
The above experiments were conducted using the software Matblab 7.100(R2014a). The following specifications were used: λ = 4 , denoting the value of the parameter on the complicated denominator function ϕ ( Δ t ) ; the final time T = 1.0 and Δ t = 0.01 ; and M ranging from 40 , 80 , 120 , 160 , 200 , 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 T = 1.0 .
Observations 1.
Our expectations were that the rate of convergence in the  L 2 -norm would be 2 and that in the  H 1 -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  L 2 - and H 1 -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.

6. Conclusions and Future Remarks

The design of a reliable scheme consisting of the nonstandard finite difference method in time and the Galerkin combined with the compactness method in the space variables to analyze the semi-linear reaction–diffusion equation is presented in this paper. The analysis of the scheme began with the use of the Galerkin in combination with the compactness method to show that the weak solution of the problem existed uniquely in the space (10). We proceeded using a priori estimates from the existence of the solution process to show that the numerical scheme was stable and converged optimally in the L 2 - and H 1 -norms. Additionally, it was also shown that the numerical scheme preserves the decaying properties of the exact solution. Finally, with a prescribed example, numerical experiments were presented to validate the proposed theory. The results obtained from the study speak for themselves, for they were accurate and viable, as expected. In view of the results, the designed scheme could be seen as a fair and a justified alternative to some of the traditional coupling schemes, consisting of the finite difference method in the time, in combination with either the Galerkin or the finite element or even another finite difference method in the space variable itself.
In future, we intend to extend the technique to systems of semi- or quasi-linear parabolic problems such as the ones in [39,40] that have meaning in real life; in addition to this, we would also like to carry out some comparison studies with some similar schemes. We can also try out the technique with hyperbolic problems, as well. Another form of interesting study we would like to conduct is a study of some semi- or quasi-linear problems over non-smooth geometry using weighted Sobolev spaces.

Funding

This research received no external funding.

Data Availability Statement

Data available on request from the authors.

Acknowledgments

The research contained in this article has been supported by Sefako Makgatho Health Sciences University, Medunsa 0204, Ga-rankuwa, Pretoria, South Africa.

Conflicts of Interest

The author declares that they have no known conflicts of interest or personal relationships that could have appeared to influence the work reported in this article.

References

  1. Kolmogorov, A.; Petrovski, I.; Piskanov, N. Study of a diffusion equation, that is related to the growth of a quality of matter and its application to a biological problem. Mosc. Univ. Math. Bull. 1937, 1, 1–26. [Google Scholar]
  2. Newell Alan, C.; Whitehead, J.A. Finite bandwidth, finite amplitude convection. J. Fluid Mech. 1969, 38, 279–303. [Google Scholar] [CrossRef]
  3. Allen, S.; Cahn, J. Ground state structures in ordered binary alloys with second neighbor interactions. Acta Metall. 1972, 20, 423–433. [Google Scholar] [CrossRef]
  4. Allen, S.M.; Cahn, J.W. A correction to the ground state of FCC binary ordered alloys with first and second neighbor pairwise interactions. Scr. Metall. 1973, 7, 1261–1264. [Google Scholar] [CrossRef]
  5. Allen, S.M.; Cahm, J.W. A microscopic theory for antiphase boundary motion and its application to antiphase domain coarsening. Acta Metall. 1979, 27, 1085–1095. [Google Scholar] [CrossRef]
  6. Chen, X. Generation, propagation and annihilation of metastable patterns. J. Differ. Equ. 2004, 206, 399–437. [Google Scholar] [CrossRef]
  7. Smoller, J. Schock Wave and Reaction-Diffusion Equations; Springer: New York, NY, USA, 1983. [Google Scholar]
  8. Hundsdorfer, W.; Verwer, J. Numerical Solution of Time-Dependent Advection-Diffusion-Reaction Equations; Springer Series in Computational Mathematics; Springer: Berlin/Heidelberg, Germany, 2003; Volume 33. [Google Scholar]
  9. Pao, C.V. Nonlinear Parabolic and Elliptic Eequations; Plenum Press: New York, NY, USA, 1992. [Google Scholar]
  10. Shen, J.; Yang, X. Numerical approximations of Allen-Cahn and Cahn-Hilliard. Discrete Contin. Dyn. Syst. 2010, 28, 1669–1691. [Google Scholar] [CrossRef]
  11. Temam, R. Infinite Dimensional Dynamical System in Mechanics and Physics; Springer: New York, NY, USA, 1997. [Google Scholar]
  12. Yang, X. Error analysis of stabilized semi-implicit method of Allen-Cahn equation. Discrete Contin. Dyn. Syst. Ser. B. 2009, 11, 1057–1070. [Google Scholar] [CrossRef]
  13. Macias-Diaz, J.F. On the numerical and structural properties of a logarithmic scheme for diffusion-reaction equations. Appl. Numer. Math. 2019, 140, 104–114. [Google Scholar] [CrossRef]
  14. Bueno-Orovio, A.; Perez-Garcia, V.M.; Fenton, F.H. Spectral methods for partial differential equations in irregular domains: The spectral smoothed boundary method. SIAM J. Sci. Comput. 2006, 28, 886–900. [Google Scholar] [CrossRef]
  15. Reitz, R.D. A study of numerical methods for reaction-diffusion equations. SIAM J. Sci. Stat. Comput. 1981, 2, 95–106. [Google Scholar] [CrossRef]
  16. Sharifi, S.; Rashidinian, T. Collocationme method for convection-reaction-diffusion equation. J. King Saud Univ.-Sci. 2019, 31, 1115–1121. [Google Scholar] [CrossRef]
  17. Wang, H.; Zhang, C.; Zhou, Y. A class of compact boundary value methods applied to semi-linear reaction-diffusion equations. Appl. Math. Comput. 2018, 325, 69–81. [Google Scholar] [CrossRef]
  18. Wu, G.; Lee, E.W.M.; Li, G. Numerical solutions of the reaction-diffusion equation. Int. J. Numer. Methods Heat Fluid Flow 2015, 25, 265–271. [Google Scholar] [CrossRef]
  19. Biazar, J.; Mehrlatifan, M.B. A compact finite difference scheme for reaction-convection-diffusion equation. Chiang Mac. J. Sci. 2018, 45, 1559–1568. [Google Scholar]
  20. Chin, P.W.M. The analysis of the solution of the Burgers-Huxley equation using the Galerkin method. Numer. Methods Partial Differ. Equ. 2023, 39, 2787–2807. [Google Scholar] [CrossRef]
  21. Chin, P.W.M.; Djoko, J.K.; Lubuma, J.M.-S. Reliable numerical schemes for a linear diffusion equation on a nonsmooth domain. Appl. Math. Lett. 2010, 23, 544–548. [Google Scholar] [CrossRef]
  22. Mickens, R.E. Nonstandard Finite Difference Models of Differential Equations; World Scientific Publishing: River Edge, NJ, USA, 1994. [Google Scholar]
  23. Anguelov, R.; Lubuma, J.M.-S. Contributions to the mathematics of the nonstandard finite difference method and applications. Numer. Methods Partial Differ. Equ. 2001, 17, 518–543. [Google Scholar] [CrossRef]
  24. Anguelov, R.; Lubuma, J.M.-S. Nonstandard finite difference method by nonlocal approximation. Math. Comput. Simul. 2003, 61, 465–475. [Google Scholar] [CrossRef]
  25. Lubuma, J.M.-S.; Mureithi, E.; Terefe, Y.A. Analysis and dynamically consistent numerical scheme for the SIS model and related reaction diffusion equation. AIP Conf. Proc. 2011, 168, 1404. [Google Scholar]
  26. Lubuma, J.M.-S.; Mureithi, E.W.; Terefe, Y.A. Nonstandard discretization of the SIS Epidemiological model with and without diffusion. Contemp. Math. 2014, 618, 113. [Google Scholar]
  27. Partidar, K.C. On the use of nonstandard finite difference methods. J. Differ. Equ. Appl. 2005, 11, 735–758. [Google Scholar] [CrossRef]
  28. Chin, P.W.M. The Galerkin reliable scheme for the numerical analysis of the Burgers’-Fisher equation. Prog. Comput. Fluid Dyn. 2021, 21, 234–247. [Google Scholar] [CrossRef]
  29. Chin, P.W.M. The analysis of an efficient numerical scheme for the Allen-Cahn equations using the Galerkin method. Commun. Nonlinear Sci. Numer. Simul. 2022, 105, 106061. [Google Scholar] [CrossRef]
  30. Chin, P.W.M.; Moutsinga, C.R.B.; Adem, K.R. An analysis of the nonstandard finite difference and Galerkin methods as applied to the Huxley equation. Mathematics 2024, 12, 867. [Google Scholar] [CrossRef]
  31. Adams, A.R. Sobolev Space; Academic Press: New York, NY, USA, 1975. [Google Scholar]
  32. Evans, L.C. Partial Differential Equations. Graduate, Studies in Mathematics; American Mathematical Society: Providence, RI, USA, 1998; Volume 19. [Google Scholar]
  33. Louis, J.-L.; Magenes, E.; Kenneth, P. Non-Homogeneous Boundary Value Problems and Applications; Springer: Berlin/Heidelberg, Germany, 1972; Volume 1. [Google Scholar]
  34. Ciarlet, P.G. The Finite Element Method for Elliptic Problems; Elsevier: Amsterdam, The Netherlands, 1978. [Google Scholar]
  35. Temam, R. Navier-Stokes Equations: Theory and Numerical Analysis; AMS Chelsea Publishing: Amsterdam, The Netherlands, 1984. [Google Scholar]
  36. Rudin, W. Functional Analysis; McGraw-Hill: New York, NY, USA, 1991. [Google Scholar]
  37. Wheeler, M.F. A priori L2 error estimates for Galerkin approximations to parabolic partial differential equations. SIAM J. Numer. Anal. 1973, 10, 723–759. [Google Scholar] [CrossRef]
  38. Shen, J. Long time stability and convergence for the fully discrete nonlinear Galerkin methods. Appl. Anal. 1990, 38, 201–229. [Google Scholar] [CrossRef]
  39. Bondarenko, V.; Markevych, I. Composition method for semi-linear parabolic systems. Int. J. Appl. Math. 2024, 10, 58. [Google Scholar] [CrossRef]
  40. Sun, T.; Sun, H.-W. A stiff-cut splitting technique for stiff semi-linear systems of differential equations. Numer. Algorithms 2024, 95, 1387–1412. [Google Scholar] [CrossRef]
Figure 1. The exact computed solution.
Figure 1. The exact computed solution.
Computation 12 00142 g001
Figure 2. Approximate solution for NSFD-GM scheme.
Figure 2. Approximate solution for NSFD-GM scheme.
Computation 12 00142 g002
Figure 3. Approximate solution for SFD-GM scheme.
Figure 3. Approximate solution for SFD-GM scheme.
Computation 12 00142 g003
Table 1. NSFD-GM error in L 2 -norm and error in H 1 -norm.
Table 1. NSFD-GM error in L 2 -norm and error in H 1 -norm.
MError in L 2 -NormRate of L 2 Error in H 1 -NormRate of H 1
403.0412 × 10 3 2.1902 × 10 1
801.2437 × 10 2 1.291.4550 × 10 1 0.59
1207.2236 × 10 3 1.341.0955 × 10 1 0.70
1604.5851 × 10 3 1.588.6032 × 10 2 0.84
2003.1517 × 10 3 1.687.0851 × 10 2 0.87
2402.2741 × 10 3 1.796.0239 × 10 2 0.89
2801.6993 × 10 3 1.895.2113 × 10 2 0.94
Table 2. SFD-GM error in L 2 -norm and error in H 1 -norm.
Table 2. SFD-GM error in L 2 -norm and error in H 1 -norm.
MError in L 2 -NormRate of L 2 Error in H 1 -NormRate of H 1
403.0103 × 10 2 2.0301 × 10 1
801.2311 × 10 2 1.291.3209 × 10 1 0.62
1207.0352 × 10 3 1.389.6276 × 10 2 0.78
1604.4784 × 10 3 1.577.5826 × 10 2 0.83
2003.0715 × 10 3 1.696.2586 × 10 2 0.86
2402.2203 × 10 3 1.785.3309 × 10 2 0.88
2801.6643 × 10 3 1.894.6331 × 10 2 0.91
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Chin, P.W.M. The Theory and Computation of the Semi-Linear Reaction–Diffusion Equation with Dirichlet Boundaries. Computation 2024, 12, 142. https://doi.org/10.3390/computation12070142

AMA Style

Chin PWM. The Theory and Computation of the Semi-Linear Reaction–Diffusion Equation with Dirichlet Boundaries. Computation. 2024; 12(7):142. https://doi.org/10.3390/computation12070142

Chicago/Turabian Style

Chin, Pius W. M. 2024. "The Theory and Computation of the Semi-Linear Reaction–Diffusion Equation with Dirichlet Boundaries" Computation 12, no. 7: 142. https://doi.org/10.3390/computation12070142

APA Style

Chin, P. W. M. (2024). The Theory and Computation of the Semi-Linear Reaction–Diffusion Equation with Dirichlet Boundaries. Computation, 12(7), 142. https://doi.org/10.3390/computation12070142

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop