Insecticidal Efficacy of Syzygium aromaticum, Tephrosia vogelii and Croton dichogamus Extracts against Plutella xylostella and Trichoplusia ni on Brassica oleracea crop in Northern Tanzania

1.   Introduction

Consider the following singularly perturbed Fredholm integro-differential equation (SPFIDE) in the interval $\bar{I} = [0, T]$:

where $0 < \varepsilon \ll 1$ is a perturbation parameter, $A$ is a given constant and $\lambda$ is a real parameter. We assume that $f\left (t, u \right)\in C^1\left(\bar{I}\times R\right)$, $K\left (t, s, u \right)\in C^1\left(\bar{I}\times\bar{I}\times R\right)$ and there exist constants $\alpha$, $\beta$ such that $0 < \alpha\le\left | \partial f/\partial u \right |$, $\left | \partial K/\partial u \right |\leq \beta$. Under these assumptions, the problem (1.1) has a unique solution (see ^[1]).

It is well known that the SPFIDEs arise widely in scientific fields such as mathematical biology ^[2], material mechanics ^[3], hydrodynamic ^[4] and so on.These problems depend on such a small positive parameter $\varepsilon$ that the solution varies rapidly when $\varepsilon \rightarrow 0$. Due to the presence of this perturbation parameter $\varepsilon$, classical numerical methods on a uniform mesh fail to give accurate results. Therefore, it is necessary to develop suitable numerical methods that are $\varepsilon$-uniformly convergent for solving these problems.

Over the past few years, there has been a growing interest in the numerical methods for Volterra integro-differential equations (see, e.g., ^{[5,6,7,8,9,10]}) and Fredholm integro-differential equations (see, e.g., ^[11,12]). When the differential term of these integro-differential equations contains a small positive perturbation parameter $\varepsilon$, these problems are called singularly perturbed integro-differential equations. Recently, some robust numerical methods are proposed to solve singularly perturbed Volterra integro-differential equations^{[13,14,15,16]}. Meanwhile, the authors in ^[17,18] developed fitted finite difference schemes on a uniform mesh for second-order SPFIDEs and gave some convergence results based on the prior information of the exact solution. Durmaz, et.al., ^[19] proposed a second-order uniformly convergent finite difference scheme on a Shishkin mesh for a singularly perturbed Fredholm integro-differential equation with the reduced second type Fredholm equation. In ^[20], the authors presented a fitted finite difference approach on a Shishkin mesh for a first-order singularly perturbed Fredholm integro-differential initial value problem with integral condition. Kumar et al. ^[21] proposed a non-standard finite difference scheme with Haar wavelet basis functions for a singularly perturbed partial integro-differential equation. Recently, Cakir et al., ^[22] solved first-order nonlinear SPFIDEs on a Sinshkin mesh with first-order convergence rate.

From the literatures we have mentioned above, the existing numerical methods of SPFIDEs given in ^[19,20,21] are layer-adapted mesh approaches, which require a priori information about the location and width of the boundary layer. Thus, adaptive grid methods by equidistributing monitor functions are widely used to solve some singularly perturbed problems, see ^{[25,26,27,28,29]} for example. The advantages of these adaptive grid methods is to cluster automatically the grid points within the boundary layer. To the best of our knowledge, there is no report about this adaptive grid method for problem (1.1). Therefore, the aim of this paper is to solve problem (1.1) numerically by a finite difference scheme on an adaptive grid obtained by equidistributing a positive monitor function. The discrete scheme is constructed by using the backward Euler formula and right rectangle formula to approximate derivative term and nonlinear integral term, respectively. It is proved under some additional conditions that the proposed adaptive grid method is first-order uniformly convergent, with respect to $\varepsilon$.

The rest of this paper is as follows. In Section 2, preliminary results of the exact solution are laid out. A discretization scheme is established in Section 3, in which a prior error analysis and a posterior error estimate are carried out successively. Numerical results obtained by the adaptive gird algorithm are given in Section 4 to support the theoretical analyses. The paper ends with a summary of the main conclusions in Section 5.

Notation Throughout this paper, $C$ which is not necessarily the same at each occurrence, indicates a positive constant independent of the mesh division parameter $N$ or the singular perturbation parameter $\varepsilon$. To simplify the notation, we set $v_{k} = v\left (t_{k} \right)$ for any function $v(t)$. In our estimates, the maximum norm of a continuous function $v(t)$ with the domain $[0, T]$ is defined as $\left \| v\left (t \right) \right \|_{\infty} = \mathrm{ess} \underset{t\in \left [0, T \right]}{\sup} \left | v\left (t \right) \right |$ as well as the maximum norm of a discrete vector $\mathit{\boldsymbol{x}} = \left \{ x_i \right \}_{i = 0}^{N}$ with $N+1$ elements is defined as $\left \| \mathit{\boldsymbol{x}} \right \|_{\infty} = \underset{i = 0, 1, 2, \cdots, N}{\max }\left | x_{i} \right |$.

2.   Preliminary results

In this section, we list the bounds for the exact solution $u\left(t\right)$ and its first-order derivative.

Lemma 2.1. [22, Lemma 1] Assume the constant $\lambda$ satisfies

Then we have

where

Corollary 2.1. For any two functions $v\left(t\right)$ and $w\left(t\right)$ satisfying

and

where $\tilde{F}(t)$ is a bounded piece-wise continuous function, we have

Proof. The proof is similar to [15, Corollary 2.1].

3.   Discretization and error analysis

3.1.   Discrete scheme

Let $\bar{\Omega } _{N}: = \left\{0 = t_{0} < t_{1} < \dots < t_{N} = T \right\}$ be an arbitrary non-uniform mesh and $h_{i} = t_{i}-t_{i-1}$ be the local mesh size for $i = 1, 2, \cdots, N$. For a given mesh function $\left \{ v_{i} \right \} _{i = 0}^{N}$, define the backward finite difference operator as follows:

Then to construct the discretization scheme for problem (1.1), we integrate Eq (1.1) over $\left(t_{i-1}, t_i \right)$ and use the right rectangle rule to approximate the integral part, which yield,

where

and

Neglecting the truncation error $R_i$ in Eq (3.2), we obtain the discretization scheme of problem (1.1)

where $u_i^N$ is the approximation of $u(t)$ at point $t = t_i$.

3.2.   A prior error analysis

Let $e_i^N: = u_i^N-u_i$, $i = 0, 1, \cdots, N$, be the absolute error at $t_i$ of the numerical solution. Then we can obtain the following error equations

where $R_i$ is the local truncation error defined in Eq (3.3) at $t_i$.

Lemma 3.1. For $i = 1, 2, \cdots, N$, the truncation error $R_i$ defined in Eq (3.3) satisfies

Proof. At first, based on the conditions $f\left(t, u\right)\in C^1(\bar{I}\times R)$ and $0 < \alpha\le\left | \partial f/\partial u \right |$, we obtain

Then, since $K\left(t, s, u\right)\in C^1\left(\bar{I}\times\bar{I}\times R\right)$ and $\left | \partial K /\partial u \right | \le \beta$, we have

and

Finally, the desired result of this lemma can be followed by Eqs (3.7), (3.8) and (3.9).

Lemma 3.2. Under the assumption

we have

where $\mathit{\boldsymbol{e}}^N = \left \{ e_i^N \right \} _{i = 0}^{N}$, $\mathit{\boldsymbol{R}} = \left \{ R_i \right \} _{i = 0}^{N}$ and $G_{ij} = \frac{\partial }{\partial u}K\left(t_i, s_j, u_j+\zeta e_j^N\right), \ 0 < \zeta < 1$.

Proof. Applying the mean value theorem to Eq (3.5), we get

where

According to maximum principle for the operator $\varepsilon D^-e_i^N+a_ie_i^N$, we have

which immediately leads to the desired result with the assumption (3.10).

Based on the above Lemmas 3.1–3.2, we get the following convergence results.

Theorem 3.1. Let $u(t)$ be the solution of problem (1.1) and $u_i^N$ be the solution of discrete scheme (3.4). Then

Corollary 3.1. Under the conditions of Theorem 3.1, there exists an adaptive grid $\left \{ t_i \right \} _{i = 0}^{N}$ such that

Proof. Based on the mesh equidistribution principle presented in ^[29], the mesh $\left \{ t_i \right \}_{i = 0}^{N}$ given by our adaptive grid algorithm satisfies

where $M(t)$ is called the monitor function, which can be chosen as

Therefore, it follows from Lemma 2.1 that

3.3.   A posteriori error analysis

In this section, we shall derive an a posteriori error estimation for the numerical solution $\left \{ u_i^N \right \} _{i = 0}^{N}$. Recall that $\tilde{u}^N\left(t\right)$ is a piece-wise linear interpolation function through knots $\left(t_i, u_i^N\right), \ i = 0, 1, \cdots, N$. Then, for any $t\in J_i: = \left [t_{i-1}, t_i \right]$, we obtain

Theorem 3.2. Let $u(t)$ be the exact solution of problem (1.1), $\left \{ u_i^N \right \} _{i = 0}^{N}$ be the discrete solution of problem (3.4) and $\tilde{u}^N(t)$ be its piece-wise linear interpolation function defined in Eq (3.21). Then we have

Proof. For any $t\in\left (t_{i-1}, t_i \right]$, it follows from Eq (1.1) and Eq (3.4) that

where

With the assumptions of functions $f\left(t, u\right)$, $K\left(t, s, u\right)$ and the definition of $\tilde{u}^N\left(t\right)$, we have

and

where $0 < \xi_1 < 1$, $0 < \xi_2 < 1$, and $0 < \xi_3 < 1$. The result can be derived from Eqs (3.23), (3.26), (3.27) and Corollary 2.1.

From Corollary 3.1, it is easy to conclude that there exists a mesh $\left \{ t_i \right \}_{i = 0}^{N}$ and a monitor function $M\left(t\right)$ given in Eq (3.19) such that the inequality (3.17) holds true. However, ${u}'\left(t\right)$ is not available. Therefore, based on the a posterior error estimation (3.22), we choose the discrete analogue of $M\left(t\right)$ as

Therefore, the idea is to adaptively design a mesh in which the values of monitor function $tilde{M}_i$ are the same on each mesh interval. This is equivalent to find $\left \{ \left(t_i, u_i^N\right) \right \}_{i = 0}^{N}$, such that

Furthermore, to obtain this equidistributed mesh $\left\{t_i\right\}_{i = 0}^N$ and the corresponding numerical solution $u_i^N$, we give the following iteration algorithm:

4.   Numerical experiments and discussion

In Section 4.1, We first present the iterative scheme. Then numerical experiments are given in Section 4.2 to validate the theoretical result of this paper. All experiments were performed on a Windows 10 (64 bit) PC-Intel(R) Core(TM) i5-4200H CPU 2.80 GHz, 8 GB of RAM using MATLAB R2021a.

4.1.   Iterative scheme

In order to avoid solving the nonlinear equations (3.4), we apply the quasilinearization technique that performs a first-order Taylor expansion on the last iteration values and obtain

where

4.2.   Numerical examples

For all the numerical experiments below, we choose $\mu^* = 1.1$, which is defined in Step 4 in Algorithm 1.

Example 4.1. We consider a SPFIDE in the form ^[22]

Since the analytic solution of this problem is not available, we use the following formulas to calculate the errors and the corresponding convergence rates:

where $\hat{\mathit{\boldsymbol{u}}}^{2N}$ is the numerical solution obtained on the fine mesh $\bar{\Omega } _{2N} = \bar{\Omega } _{N}\bigcup \left\{\frac{t_{i}+t_{i+1}}{2}\right\}_{i = 0}^{N-1}$. The maximum errors and $\varepsilon$-uniform rates of the convergence are respectively defined as

In the numerical experiments, we apply the presented adaptive grid algorithm to solve this problem. The resulting errors $e_{\varepsilon }^N$ and the orders of the convergence $p_{\varepsilon }^N$, for particular values of $\varepsilon$ and $N$ are listed in Table 1. In addition, to compare the performance of the presented adaptive mesh with the Shishkin mesh ^[22] and the Bakhvalov mesh ^[23], some numerical results are given in Table 2.

Table 1.  The errors and corresponding convergence rates for Example 4.1.

$\varepsilon$	$N=64$	$N=128$	$N=256$	$N=512$	$N=1024$
$2^{-2}$	0.004663	0.002384	0.001222	0.000619	0.000312
	0.9680	0.9637	0.9811	0.9903	-
$2^{-4}$	0.00595	0.003152	0.00163	0.000801	0.000412
	0.9167	0.9515	1.0244	0.9610	-
$2^{-6}$	0.006539	0.003482	0.001818	0.000939	0.000477
	0.9089	0.9373	0.9532	0.9769	-
$2^{-8}$	0.006711	0.003633	0.001893	0.000979	0.000501
	0.8853	0.9404	0.9514	0.9667	-
$2^{-10}$	0.006799	0.003635	0.001913	0.000996	0.000509
	0.9035	0.9258	0.9424	0.9667	-
$2^{-12}$	0.006881	0.003649	0.001926	0.000996	0.000512
	0.9151	0.9221	0.9505	0.9606	-
$2^{-14}$	0.006854	0.003683	0.001924	0.001	0.000513
	0.8963	0.9365	0.9447	0.9633	-
$2^{-16}$	0.00672	0.003752	0.001934	0.000999	0.000515
	0.8411	0.9562	0.9526	0.9560	-
$e^N$	0.006881	0.003752	0.001934	0.001	0.000515
$p^N$	0.8751	0.9562	0.9517	0.9569	-

---

 | Show Table

DownLoad: CSV

Table 2.  Comparisons of errors and corresponding convergence rates for Example 4.1.

$N$		$\varepsilon=2^{-6}$			$\varepsilon=2^{-8}$
	Adaptive	Bakhvalov	Shishkin	Adaptive	Bakhvalov	Shishkin
$3\times2^5$	4.53E-03	2.81E-03	7.18E-03	4.66E-03	2.83E-03	7.16E-03
	0.93	0.98	0.75	0.91	0.98	0.75
$3\times2^6$	2.39E-03	1.42E-03	4.26E-03	2.48E-03	1.44E-03	4.25E-03
	0.94	0.99	0.79	0.95	0.99	0.79
$3\times2^7$	1.24E-03	7.16E-04	2.46E-03	1.29E-03	7.23E-04	2.45E-03
	0.97	0.99	0.83	0.96	0.99	0.83
$3\times2^8$	6.33E-04	3.59E-04	1.39E-03	6.62E-04	3.63E-04	1.38E-03
	0.98	1.00	0.85	0.97	1.00	0.85
$3\times2^9$	3.20E-04	1.80E-04	7.71E-04	3.37E-04	1.82E-04	7.69E-04
	1.05	1.00	0.86	0.98	1.00	0.86
$3\times2^{10}$	1.54E-04	9.01E-05	4.23E-04	1.71E-04	9.09E-05	4.22E-04

---

 | Show Table

DownLoad: CSV

According to the results in Table 1, for fixed $N$, the error increases with a diminishing speed and the convergence rate goes away from 1 as $\varepsilon$ decreases, while for fixed $\varepsilon$, the error deceases to half as $N$ doubles and the convergence rate is getting closer to 1. According to the results in Table 2, our adaptive mesh demonstrates both less error and more accurate first-order convergence rate than Shishkin mesh. In general, the performance of our adaptive grid algorithm is better when $\mu^*$ which is used to distribute the grid uniformly is closer to 1. However, the enhance becomes very limited after certain threshold and it can not work out successfully when $\mu^*$ is so close to 1 due to the enormous amount of calculations. Here the limitation of the adaptive mesh lies.

The behaviors of the numerical solution are presented in Figures 1, 2. Obviously, it can be seen that in these two figures the solution of the test problem decreases successively near to 0 at first and increases progressively close to 1 then and has a boundary layer at $t = 0$. Figure 3 shows the $\varepsilon$-uniform convergence of the method with different $\varepsilon$. To be more physical, the first-order uniform convergence stands for our method in spite of violent changes of the numerical solution in the bound layer at $t = 0$. From Figure 3, no matter how close $\varepsilon$ tends to zero, the maximum point-wise errors are bounded by $O\left(N^{-1}\right)$ which validates our theoretical analyses. For $\varepsilon = 2^{-8}$, Figure 4 displays how a mesh with $N = 64$ evolves through successive iterations of the algorithm by using monitor function (3.28).

Figure 1.  Numerical results of Example 4.1 for $N = 64$ and $\varepsilon = 2^{-4}$.

DownLoad: Full-Size Img PowerPoint

Figure 2.  Numerical results of Example 4.1 for $N = 256$ and various $\varepsilon$.

DownLoad: Full-Size Img PowerPoint

Figure 3.  Maximum point-wise errors of log-log plot for Example 4.1.

DownLoad: Full-Size Img PowerPoint

Figure 4.  Evolution of the mesh for Example 4.1.

DownLoad: Full-Size Img PowerPoint

Example 4.2. We consider a first-order nonlinear singularly perturbed mixed type integro-differential equation in ^[24] in the form:

where

It is testified that it satisfies the assumption (3.10). The analytic solution of this problem is $u\left(t\right) = e^{-t/\varepsilon}$. We use the following formulas to calculate the errors and the corresponding convergence rates:

The maximum errors and $\varepsilon$-uniform convergence rates are defined in Eq (4.6).

The resulting errors $e_{\varepsilon }^N$ and the orders of the convergence $p_{\varepsilon }^N$, for particular values of $\varepsilon$ and $N$ are listed in Table 3. In addition, to compare the performance of the presented adaptive mesh with the Shishkin mesh ^[22] and the Bakhvalov mesh ^[23], some numerical results are given in Table 4.

Table 3.  The errors and corresponding convergence rates for Example 4.2.

$\varepsilon$	$N=64$	$N=128$	$N=256$	$N=512$	$N=1024$
$2^{-2}$	0.008698	0.004386	0.002202	0.001103	0.000552
	0.9880	0.9939	0.9969	0.9985	-
$2^{-4}$	0.011073	0.00562	0.002799	0.001413	0.00071
	0.9783	1.0057	0.9863	0.9929	-
$2^{-6}$	0.012473	0.00639	0.003247	0.001638	0.0008
	0.9648	0.9767	0.9876	1.0335	-
$2^{-8}$	0.013236	0.006774	0.003463	0.00176	0.000887
	0.9664	0.9681	0.9763	0.9881	-
$2^{-10}$	0.013376	0.006909	0.003559	0.00181	0.000917
	0.9530	0.9570	0.9755	0.9814	-
$2^{-12}$	0.013461	0.006954	0.003575	0.001835	0.000929
	0.9528	0.9601	0.9619	0.9822	-
$2^{-14}$	0.013563	0.007002	0.003592	0.001836	0.000937
	0.9540	0.9631	0.9680	0.9704	-
$2^{-16}$	0.015521	0.007146	0.003596	0.001842	0.000935
	1.1190	0.9908	0.9647	0.9784	-
$e^N$	0.015521	0.007146	0.003596	0.001842	0.000937
$p^N$	1.1190	0.9908	0.9647	0.9755	-

---

 | Show Table

DownLoad: CSV

Table 4.  Comparisons of errors and corresponding convergence rates for Example 4.2.

$N$		$\varepsilon=2^{-6}$			$\varepsilon=2^{-8}$
	Adaptive	Bakhvalov	Shishkin	Adaptive	Bakhvalov	Shishkin
$3\times2^5$	8.43E-03	2.15E-02	1.91E-02	8.95E-03	2.69E-02	1.67E-02
	0.97	0.90	1.28	0.97	0.65	0.11
$3\times2^6$	4.31E-03	1.15E-02	7.85E-03	4.58E-03	1.72E-02	1.54E-02
	0.98	0.94	1.29	0.97	0.67	0.80
$3\times2^7$	2.18E-03	6.00E-03	3.21E-03	2.33E-03	1.08E-02	8.88E-03
	1.04	0.97	1.00	0.98	0.90	1.28
$3\times2^8$	1.06E-03	3.06E-03	1.61E-03	1.18E-03	5.78E-03	3.65E-03
	0.97	0.98	0.85	0.99	0.93	1.32
$3\times2^9$	5.39E-04	1.55E-03	8.88E-04	5.93E-04	3.02E-03	1.46E-03
	0.98	0.99	0.87	1.00	0.97	1.41
$3\times2^{10}$	2.72E-04	7.78E-04	4.87E-04	2.98E-04	1.54E-03	5.51E-04

---

 | Show Table

DownLoad: CSV

The behaviors of the numerical solution are presented in Figures 5, 6. Obviously, it can be seen that in these two figures the solution of the test problem gradually decreases to zero with a decreasing velocity rate as well as has a boundary layer at $t = 0$. Figure 7 shows the $\varepsilon$-uniform convergence of the method with different $\varepsilon$. From Figure 7, no matter how close $\varepsilon$ tends to zero, the maximum point-wise errors are bounded by $O\left(N^{-1}\right)$ which validates our theoretical analyses. For $\varepsilon = 2^{-8}$, Figure 8 displays how a mesh with $N = 64$ evolves through successive iterations of the algorithm by using monitor function (3.28).

Figure 5.  Numerical results of Example 4.2 for $N = 64$ and $\varepsilon = 2^{-4}$.

DownLoad: Full-Size Img PowerPoint

Figure 6.  Numerical results of Example 4.2 for $N = 256$ and various $\varepsilon$.

DownLoad: Full-Size Img PowerPoint

Figure 7.  Maximum point-wise errors of log-log plot for Example 4.2.

DownLoad: Full-Size Img PowerPoint

Figure 8.  Evolution of the mesh for Example 4.2.

DownLoad: Full-Size Img PowerPoint

The unique but significant difference between these two examples can be found in Table 4. At the situation $\varepsilon = 2^{-8}$, adaptive mesh demonstrates better than Bakhvalov mesh. This is because the construction of the Bakhvalov mesh is based on prior information of the exact solution. Therefore the effect of this method is tightly relevant to the form of equation. The existing Bakhvalov mesh may display wonderful at suitable equations but poor when it is adverse. However, the adaptive mesh based on posterior error estimate requires none of prior information of the exact solution and displays steadily at various equations.

5.   Concluding remarks

This paper considers a nonlinear singularly perturbed Fredholm integro-differential equation for a first-order initial value problem. A first-order $\varepsilon$-uniformly convergent numerical method for solving this problem is presented, which comprises an adaptive grid based on the posterior error estimate and the mesh equidistribution principle. The difference scheme including the weights and the remainders is established using the backward Euler formula for the derivative term, together with the composite right rectangle quadrature rule for the integral term. A theoretical analysis based on prior error bound is conducted to prove the first-order convergence of the proposed method. Two examples show that our adaptive mesh demonstrates better than Shishkin mesh and performs as well as Bakhvalov mesh. In the future, we will try to extend the proposed adaptive grid method for solving other related integro-differential equations which can be found in ^[5,6,31].

Conflict of interest

The authors declare there is no conflict of interest.