This section focuses on establishing discrete minimum principle, demonstrating discrete stability result of the proposed method and proving its first-order convergence.
11.1. Error Estimate
Analogous to the continuous case, the discrete solution
is split into two distinct components
and
.
Lemma 11.3.
If is the solution of (7), (9) and (12) and is the solution of (40), then
Proof.
Determining the local truncation error
for
. It is established that
. In this case
, from (
22) and (
24),
Using Lemma 11.2, consider mesh function,
Provided that the value of
C is sufficiently large , it follows that
Thus,
The proof of the lemma is complete. □
The error bounds for singular components
are estimated for the case
, utilizing the mesh functions
for
considered over
,
Lemma 11.4.
For the case , the layer components , satisfy the following bounds on ,
Proof. This result can be demonstrated by defining the mesh functions and noticing that and . Furthermore, , . Therefore, the discrete minimum principle provides the desired outcome. The proof of the lemma is complete. □
Lemma 11.5.
Assume that , for . Let satisfy (13) , satisfy (41). Then,
Proof. The local truncation error is given by
where
. Since
, the mesh
is uniform, then the value of
. In this instance,
and
.
Let the barrier function
be
on
, where
is a constant and it satisfies
,
The mesh functions described above is inspired by those constructed in [
14]. Now, that
,
,
,
and
. Then, define
. It is easy to observe that
and
. Hence, by applying minimum principle,
The proof of the theorem is complete. □
Lemma 11.6.
Let satisfy (13) , satisfy (41). Then,
Proof. This is demonstrated for each mesh point by partitioning into small subintervals In each case, the local truncation error is estimated and a corresponding barrier function is constructed. Lastly, the desired estimate is derived by utilizing barrier functions.
Case (a):
Clearly
. Using standard local truncation error analysis applied in Taylor expansions, the estimates hold for
and
,
For
and
, the mesh functions are considered as
Utilizing the minimum principle and barrier function
, it has been derived that
Case (b):.
There are two possible cases
Case (b1): and
Case (b2):.
Case (b1): , since the mesh is uniform over the interval
. In this case, it follows that
, for
. Then,
Now for
and
, specify
Utilizing the minimum principle and barrier function
, it has been derived that
Case (b2):. For this case,
, and hence for
, by applying the standard local truncation approach, which is based on Taylor expansions,
then,
Now using Lemma 8.1, it is not hard to derive that
and for
,
Define
and for
,
Case (c):.
The three possibilities
Case (c1):
,
Case (c2): and
for some
q,
,
Case (c3):.
Case (c1): . Since
and the mesh remains uniform within the interval
, it implies that for
,
and hence
Utilizing the minimum principle and barrier function
, it has been derived that
Case (c2): and
for some
q,
. Since
, the mesh is uniform in
, it follows that
, for
. By applying the standard local truncation approach, which is based on Taylor expansions,
Now, using Lemma 8.1, for
,
and for
,
Now specify, for
,
and for
,
Case (c3):. Substituting
m for
q in the arguments of the previous case (c2) yields the following and using
, the estimates hold for
. For
,
and for
,
For
, define
and for
,
Case (d): There are three possible scenarios,
Case (d1): ,
Case (d2): and
for some
q,
and
Case (d3):.
Case (d1): . The mesh is uniform over
and the result is from Lemma 11.5.
Case (d2): and
for some
q,
. In this context based on the definition of
, it follows that
and utilizing analogous arguments to Case (c2), which lead to the estimates for
. For
,
and for
,
Now specifying, for
,
and for
,
Case (d3): . let
, therefore, for
,
Thus, for each of the cases, the barrier function is constructed and using minimum principle, it has been derived that
The proof of the lemma is complete.□
To determine estimate of error bound, the mesh functions are defined on
with
, for
. For the case
, the error in the component
is bounded.
Lemma 11.7.
Let satisfy (10), satisfy (41). Then,
Proof. Assume that
, for
, the local truncation error is given by
where
. Since
, the mesh
is uniform, then the value of
. In this instance,
This is demonstrated for each mesh point by partitioning into small subintervals In each case, the local truncation error is estimated and a corresponding barrier function is considered. Lastly, the desired estimate is derived by utilizing barrier functions.
Case (a):
Clearly
. Using standard local truncation error analysis applied in Taylor expansions, the estimates hold for
and
,
Case (b):.
There are two possible cases
Case (b1): and
Case (b2):.
Case (b1): . Since the mesh is uniform over the interval
. In this case, it follows that
, for
. Then,
Case (b2):. For this case,
, and Therefore, for
, by the local truncation utilized in Taylor expansions,
then, using Lemma 8.2
Case (c):.
The three possibilities
Case (c1):
,
Case (c2): and
for some
q,
and
Case (c3):.
Case (c1): , since
and the mesh is uniform in
. In this case, it follows that for
,
and hence
Case (c2): and
for some
q,
. Since
, the mesh is uniform in
, it follows that
, for
. By utilizing the method of calculating local truncation error and analyzed using Taylor expansions, as given in Lemma 8.2
Case (c3):. Substituting
m by
q in the arguments of the previous case (c2) yields the following and using
, the following hold for
,
Case (d):
There are three possible scenarios,
Case (d1): ,
Case (d2): and
for some
q,
and
Case (d3):.
Case (d1): , the mesh is uniform over
and is established above.
Case (d2): and
for some
q,
. In this context, based on the definition of
, it follows that
and utilizing analogous arguments to Case (c2), which lead to the estimates for
.
Case (d3): . Let
. Therefore, on
, Therefore,
The proof of the lemma is complete. □
To establish the bounds on the error
, the mesh function is defined over
Lemma 11.8.
For the case , the layer components , satisfy the following bounds on ,
Proof. This result can be demonstrated by defining the mesh functions . Also, since then, . Hence, . Also, for an appropriate choice of C, it follows that . Further, . Hence, by the minimum principle, for . Hence, it can be said that The proof of the lemma is complete. □
Lemma 11.9. At each point , , for the case .
Proof. The local truncation error is given by
where
. Consider the case
then,
Consider the case
. Hence,
Examine the mesh region
. It is known that
, then,
The proof of the lemma is complete. □
Theorem 11.1.
Let be the solution of (1) and be the solution of (39). Then, for each mesh point ,
for both of the cases and .
Proof. The proof follows Lemmas 11.3, 11.5, 11.7 and 11.9.