Next Article in Journal
Static Response of Nanocomposite Electromagnetic Sandwich Plates with Honeycomb Core via a Quasi 3-D Plate Theory
Previous Article in Journal
An Optimization of Home Delivery Services in a Stochastic Modeling with Self and Compulsory Vacation Interruption
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Computational Methods for Solving Higher-Order (1+1) Dimensional Mixed-Difference Integro-Differential Equations with Variable Coefficients

by
Amr M. S. Mahdy
1,2,*,
Mohamed A. Abdou
3 and
Doaa Sh. Mohamed
1
1
Department of Mathematics, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
2
Department of Mathematics & Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
3
Department of Mathematics, Faculty of Education, Alexandria University, Alexandria 21526, Egypt
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(9), 2045; https://doi.org/10.3390/math11092045
Submission received: 28 March 2023 / Revised: 22 April 2023 / Accepted: 23 April 2023 / Published: 26 April 2023

Abstract

:
The main purpose of this article is to present a new technique for solving (1+1) mixeddimensional difference integro-differential Equations (2D-MDeIDEs) in position and time with coefficients of variables under mixed conditions. The equations proposed for the solution represent a link between time and delay in position that has not been previously studied. Therefore, the authors used the technique of separation of variables to transform the 2D-MDeIDE into one-dimensional Fredholm difference integro-differential Equations (FDeIDEs), and then using the Bernoulli polynomial method (BPM), we obtained a system of linear algebraic equations (SLAE). The other aspect of the technique of separation of variables is explicitly obtaining the necessary and appropriate time function to obtain the best numerical results. Some numerical experiments are performed to show the simplicity and efficiency of the presented method, and all results are performed by Maple 18.

1. Introduction

Many important problems in various sciences, such as engineering, physics, and biology, have been reduced to integral and integro-differential equations in general. The importance of these integro-differential equations increases, in particular if they are associated with delay. In these types of equations, it is not possible to obtain a single solution, but rather several solutions, the best of which can be chosen. Since these equations are difficult to solve analytically, there are many different semi-analytical approaches and numerical approaches for solving integro-differential Equations (IDEs). Aghazadeh and Khajehnasiri in [1], used block-pulse functions for solving two-dimensional IDEs. Tari and Shahmorad, in [2], introduced differential transform method for solving system of IDEs. Hussain et al., in [3], applied the variational iteration method to solve two-dimensional partial integro-differential equations (PIDEs). Hamoud et al., in [4], studied the numerical solution of IDEs by Adomian decomposition method. Khajehnasiri, in [5], presented triangular function to obtain the solution of two-dimensional IDEs. Mirzaee et al., in [6], applied Bernstein polynomials for solving PIDEs. Rivaz et al., in [7], used Chebyshev polynomials to obtain the solution of IDEs. Behzadi, in [8], used some iterative techniques for solving Volterra-Fredholm integro-differential equations (VFIDEs). Ahmed and Elzaki, in [9], studied the solution of IDEs by difference numerical methods. Pandey, in [10], introduced the finite difference strategy to obtain the solution of Fredholm integro-differential Equations (FIDEs). Abdel-Aty et al., in [11], used the optimal axillary function method for solving FIDEs. Al-Bugami in [12], applied the Toeplitz matrix and product Nystrom methods for solving two-dimensional FIDEs with singular kernels. Abdou et al., in [13], applied the Adomian decomposition method for solving fractional IDEs. Abdou and Elsayed, in [14], studied the existence of a unique solution of the fractional IDEs in Hilbert space. ALmostafa et al., in [15], introduced the Aboodh and Double Aboodh transform methods to obtain the solution of PIDEs. Al-Bugami, in [16], used the Homotopy analysis strategy and Adomian decomposition strategy to obtain the numerical solution of FIDEs.
Recently, difference integro-differential equations (DeIDEs) drew the interest of numerous scholars, such as Saadatmandi and Dehghan, in [17], who introduced the numerical solution of DeIDEs using the Tau method. Sezer et al. [18] presented the Chebyshev collocation method for solving DeIDEs, while in [19], Sezer et al. used the Bernoulli polynomial method for solving DeIDEs. Moreover, Sezer et al. [20] used the Taylor expansion approach to obtain the solution of mixed DeIDEs. Furthermore, Sezer and Mollaoglu [21] applied Gegenbauer polynomials for solving high-order linear DeIDEs. Finally, Sezer et al. [22] applied Lucas polynomials to obtain the solution of functional DeIDEs. Özkol and Yavuz, in [23], used the differential transform method for solving DeIDEs.
In the present paper, the solution of 2D-MDeIDE, is investigated by using the separation of variables and BPM. Abdelkawy et al., in [24], used the Bernoulli collocation method for solving hyperbolic telegraph equations. Sezer and Dascioglu, in [25], studied the solution of high-order generalized pantograph equations by BPM. Mirzaee, in [26], used BPM for solving integral-algebraic equations. Bhrawy et al., in [27], presented BPM for solving two-dimensional mixed Volterra–Fredholm integral equations (MVFIEs). Toutounian et al., in [28], applied BPM to obtain the solution of complex differential equations.
In the late twenty-first century, some authors began to study the effect of the time function in solving all kinds of integral equations (IEs). For more information, see [29,30,31,32]. Three-dimensional MVFIEs are solved computationally by Mahdy et al., in [33]. Mahdy and Mohamed, in [34], used Lucas polynomials to obtain the solution of Cauchy IEs. Mahdy et al. [35] applied a Chelyshkov polynomial approach to solve the first class of two-dimensional nonlinear Volterra integral equations.
The rest of this essay is structured as follows: in Section 2, separation of variables is applied to transform the 2D-MDeIDE into a one-dimensional FDeIDE. The separation of variables depends on the physical meanings of the problem, and each of them has its own uses, whether these uses are in basic sciences or in economics. Therefore, the authors covered this problem scientifically, as the technique of separating the variables has two important bases. The first is that the time of the free (given) function is the same as the time of the unknown function that needs to be known. The second is that the time of the unknown function differs from the time of the known function.
In Section 3, we describe how we used the Bernoulli polynomial method, as a numerical method, to obtain a system of (N + 1) linear algebraic equations with (N + 1) unknown in position. It is known that the product formula of the algebraic system depends on the separation of variables technique. The authors used Bernoulli’s method to obtain (N + 1) from linear algebraic equations, so the error in this case is the absolute difference between the analytical solution and the numerical solution. Since the analytical solution is not known in this type of problem, the error is defined as the algebraic equation following the last equation calculated. In Section 4, the authors solve some numerical examples that correspond to the chosen appropriate time. Through computer programs, the authors were able to obtain numerical results for each example as well as the resulting error for each case.
In the last section, a summary of the important conclusions is presented, which includes in each example the highest and lowest error values, and the relationship of the authors’ choice of time to the increase or decrease of the error.
Consider the following nth difference integro-differential equations with variable coefficients:
L [ Y ( x , t ) ] = k = 0 n A k ( x ) k Y ( x , t ) x k + k = 0 m A k * ( x ) k Y ( x + α , t ) x k
0 t a b G ( t , τ ) M ( x , u ) Y ( u β , τ ) d u d τ = F ( x , t ) , n m ,
under (n − 1)determines the initial boundary conditions. For the difference equations and their initial boundary conditions, please see references [17,18,19,20]).
k = 0 n 1 [ ρ i k k Y ( a , t ) x k + σ i k k Y ( b , t ) x k + ϱ i k k Y ( c , t ) x k ] = μ i ( t ) , a c b , t [ 0 , 1 ] , μ i ( 0 ) 0 , i = 1 , 2 , , n 1 ,
where A k ( x ) , A k * ( x ) , G ( t , τ ) , M ( x , u ) , F ( x , t ) , and μ i ( t ) are known continuous functions, the coefficients ρ i k , σ i k ,   ϱ i k are constants, and Y ( x , t ) is the unknown function.
This type of problem associated with the mixed condition of the study of hysteresis cannot find a single solution. However, the only solution that can be found when certain conditions are imposed on the free function is the given function. It is known that the unknown function behaves the same way as the known function. Thus, when imposing certain conditions on the known function, they will apply to the unknown function, and it will have the only solution that applies and agrees with it.

2. Separation of Variables

In mathematical physics problems, we find that researchers have been concerned with finding the indefinite potential function, which is related to time and location. Thus, researchers have been able to use a variety of techniques to utilize the unknown function. One such method is the time division, which converts the mixed equation in position and time into an algebraic system of mixed equations in position only (Alalyani et al. [29]). Here, the authors apply a new separation method to discuss the solution of the mixed boundary value problem (1), (2) utilizing the coefficients of the space functions. In this case, these time coefficients will take the form of an integral operator of the Volterra type. This scheme enables the authors to select the known function of time more easily, according to the nature of the problem at hand and the space used. Thus, the time required to obtain the required results can be chosen. There are two cases for the function of the time when we apply separation of variables:
Case (I): 
when the function of time for the known function (free term) and unknown function is the same, this means that the function of time is known and we use the following technique (Alhazmi and Abdou [36]). Assume that the unknown and known functions in Equation (1), respectively take the following forms:
Y ( x , t ) = y ( x ) Z ( t ) , F ( x , t ) = f ( x ) Z ( t ) , Z ( 0 ) 0 ,
where Z ( t ) is a known function. Hence, the formula (1) yields:
L [ y ( x ) ] = k = 0 n A k ( x ) y ( k ) ( x ) + k = 0 m A k * ( x ) y ( k ) ( x + α ) λ ( t ) a b M ( x , u ) y ( u β ) d u = f ( x ) .
Under the conditions:
k = 0 n 1 [ ρ i k y ( k ) ( a ) + σ i k y ( k ) ( b ) + ϱ i k y ( k ) ( c ) ] = μ i ( t ) Z ( t ) ,
where
λ ( t ) = 1 Z ( t ) 0 t G ( t , τ ) Z ( τ ) d τ .
It is noted that by using this separation technique, the authors were able to obtain the mixed problem (4) and (5) in position. Furthermore, the coefficients of this problem were transformed into an integral term in time (6). The integral term λ ( t ) after knowing the time can be determined.
Case (II): 
when the functions of time for the known and the unknown functions are different, we present the following technique (Abdou [37]).
Y ( x , t ) = Φ ( x ) Ψ ( t ) , F ( x , t ) = f ( x ) γ ( t ) , γ ( 0 ) 0 , Ψ ( 0 ) 0 ,
where Φ ( x ) , Ψ ( t ) are unknown functions and f ( x ) , γ ( t ) are known functions.
Thus, the formula (1) yields:
L [ Φ ( x ) Ψ ( t ) ] = [ k = 0 n A k ( x ) Φ ( k ) ( x ) + k = 0 m A k * ( x ) Φ ( k ) ( x + α ) ] Ψ ( t )
( 0 t G ( t , τ ) Ψ ( τ ) d τ ) × ( a b M ( x , u ) Φ ( u β ) d u ) = f ( x ) γ ( t ) .
Separating the variables, we have:
Ψ ( t ) 0 t G ( t , τ ) Ψ ( τ ) d τ = γ ( t ) ,
which represent Volterra integral equation in time, and
k = 0 n A k ( x ) Φ ( k ) ( x ) + k = 0 m A k * ( x ) Φ ( k ) ( x + α ) a b M ( x , u ) Φ ( u β ) d u = f ( x ) ,
which represent FDeIDE only in position.
Under the conditions:
k = 0 n 1 [ ρ i k Φ ( k ) ( a ) + σ i k Φ ( k ) ( b ) + ϱ i k Φ ( k ) ( c ) ] = μ i ( t ) Ψ ( t ) .
Various methods, whether numerical methods or analytical methods, can be used to solve Volterra integral equation with a continuous kernel. After using one of these methods, multiplying the result by the function of position, the solution of the problem is completely determined.

3. Bernoulli Polynomial Method

In this section, the BPM is applied for solving the difference integro-differential Equations (4) and (10).
The Bernoulli polynomials (BP) B ( ξ ) of degree satisfy the following relations:
B ( ξ ) = r = 0 r B r ξ r ,
where B r , r = 0 , 1 , , are Bernoulli numbers and the first few Bernoulli numbers are defined as [38]:
B 0 = 1 , B 1 = 1 2 , B 2 = 1 6 , B 4 = 1 30 , B 6 = 1 42 , B 8 = 1 30 , , B 2 r + 1 = 0 , r = 1 , 2 , 3 , .
The BP B ( ξ ) of degree are constructed from the following relation:
r = 0 + 1 r B r ( ξ ) = ( 1 ) ξ , = 0 , 1 , .
The first few BP are defined as follows:
B 0 ( ξ ) = 1 ,
B 1 ( ξ ) = ξ 1 2 ,
B 2 ( ξ ) = ξ 2 ξ + 1 6 ,
B 3 ( ξ ) = ξ 3 3 2 ξ 2 + 1 2 ξ ,
B 4 ( ξ ) = ξ 4 2 ξ 3 + ξ 2 1 30 ,
B 5 ( ξ ) = ξ 5 5 2 ξ 4 + 5 3 ξ 3 1 6 ξ ,
B 6 ( ξ ) = ξ 6 3 ξ 5 + 5 2 ξ 4 1 2 ξ 2 + 1 42 .
The BP satisfy the following relations:
(1)
B ( ξ ) = B 1 ( ξ ) .
(2)
B ( ξ + 1 ) B ( ξ ) = ξ 1 , = 1 , 2 , .
(3)
0 1 B ( ξ ) d ξ = 0 , = 1 , 2 , .
Case (I): 
The approximate solution of Equation (4) is truncated by BP as follows:
y ( x ) y N ( x ) = = 0 N a B ( x ) ,
where a , = 0 , 1 , , N are the unknown Bernoulli coefficients and B ( x ) are BP, which is defined by (12).
Similarly y ( x + α ) and y ( k ) ( x ) are defined as follows:
y ( x + α ) y N ( x + α ) = = 0 N a B ( x + α ) ,
y ( k ) ( x ) y N ( k ) ( x ) = = 0 N a B ( k ) ( x ) .
Substituting from (15)–(17) into (4), we obtain:
L [ y N ( x ) ] = = 0 N a { k = 0 n A k ( x ) B ( k ) ( x ) + k = 0 m A k * ( x ) B ( k ) ( x + α ) λ ( t ) a b M ( x , u ) B ( k ) ( u β ) d u } = f ( x ) ,
By using the collocation points:
x s = a + b a N s , s = 0 , 1 , , N .
Thus, we obtain the following system of ( N + 1 ) linear algebraic equations with ( N + 1 ) unknowns:
L [ y N ( x s ) ] = = 0 N a { k = 0 n A k ( x s ) B ( k ) ( x s ) + k = 0 m A k * ( x s ) B ( k ) ( x s + α ) λ ( t ) a b M ( x s , u ) B ( k ) ( u β ) d u } = f ( x s ) ,
with the conditions
= 0 N a { k = 0 n 1 [ ρ i k B ( k ) ( a ) + σ i k B ( k ) ( b ) + ϱ i k B ( k ) ( c ) ] } = μ i ( t ) Z ( t ) .
It can be seen in Equations (20) and (21) that the time function on the right side of the mixed condition (21) fully affects its determination. Therefore, the form of the general solution to Equation (20) will depend on the form of the time function.
Case (II): 
Similarly as in case (I), the approximate solution of Equation (10) after using the collocation points (19) is obtained by solving the following SLAE:
L [ Φ N ( x s ) ] = = 0 N a { k = 0 n A k ( x s ) B ( k ) ( x s ) + k = 0 m A k * ( x s ) B ( k ) ( x s + α ) a b M ( x s , u ) B ( k ) ( u β ) d u } = f ( x s ) ,
with the conditions
= 0 N a { k = 0 n 1 [ ρ i k B ( k ) ( a ) + σ i k B ( k ) ( b ) + ϱ i k B ( k ) ( c ) ] } = μ i ( t ) Ψ ( t ) .
To get the general solution form, firstly, the Volterra Integral Equation (9) is solved to find the time function Ψ ( t ) . Secondly, the position equation Φ ( x ) is solved using the given initial conditions. Finally, we obtain the general solution by multiplying the time function by the position function Y ( x , t ) = Φ ( x ) Ψ ( t ) .

4. Numerical Results

In this section, numerical examples are presented to illustrate the above strategy. Here, the authors are concerned with the four examples of the effect of the time function on the numerical solutions of the problem to be solved. The authors also show the effect of this time on the resulting error function. all numerical results are implemented by Maple software.
Example 1. 
Consider the third-order MDeIDE:
3 x 3 ( Y ( x , t ) ) x 2 x 2 ( Y ( x , t ) ) + x 2 x ( Y ( x , t ) ) + x ( Y ( x + 1 , t ) ) 2 x ( Y ( x + 1 , t ) )
0 t 1 1 e t τ x u Y ( u 1 , τ ) d u d τ = F ( x , t ) ,
under the conditions:
Y ( 1 , t ) + 16 Y ( 0 , t ) Y ( 1 , t ) = 0 , x Y ( 1 , t ) + 8 x Y ( 0 , t ) x Y ( 1 , t ) = 0 ,
2 x 2 Y ( 1 , t ) + 4 2 x 2 Y ( 0 , t ) 2 x 2 Y ( 1 , t ) = 0 ,
where
F ( x , t ) = ( 2 x 5 4 x 4 44 x 3 60 x 2 + 28 x + 56 ) ( 0.01 + t ) .
In this example, we use the two techniques of separation.
Case (I): 
If the time function for the known and the unknown functions are the same, i.e., Z ( t ) = 0.01 + t , we can apply separation of variables and BPM to obtain the approximate solution of Equation (24) when N = 5 for different values of t as follows:
Y 5 ( x , t ) = ( 5.399999982 4.799999946 x + 5.999999939 x 2 + 3.999999988 x 3 + 1.000000006 x 4
2.147891649 × 10 9 x 5 ) ( 0.01 + t ) , t = 0.01 .
Y 5 ( x , t ) = ( 1.033332947 + 4.00000073 x + 4.999999796 x 2 + 5.999999964 x 3 + 1.714303252 × 10 8 x 4
6.587454980 × 10 9 x 5 ) ( 0.01 + t ) , t = 0.2 .
Y 5 ( x , t ) = ( 1.000000388 + 3.99999939 x + 6.000000156 x 2 + 4.000000039 x 3 + 0.9999999835 x 4
+ 5.005378984 × 10 9 x 5 ) ( 0.01 + t ) , t = 0.6 .
Case (II): 
Substituting (7) into (24) and separating variables, we obtain the following Volterra integral equation:
Ψ ( t ) 0 t e t τ Ψ ( τ ) d τ = γ ( t ) = ( 0.01 + t ) , γ ( 0 ) = 0.01 0 ,
and the FDeIDE in position:
d 3 Φ d x 3 x d 2 Φ d x 2 + x 2 d Φ d x + d Φ ( x + 1 ) d x 2 x Φ ( x + 1 ) 1 1 x u Φ ( u 1 ) d u = 2 x 5 4 x 4 44 x 3 60 x 2 + 28 x + 56 .
The solution of Equation (25) is obtained by using Laplace transformation in the following form:
Ψ ( t ) = 0.255 e 2 t 0.245 + 0.5 t .
Moreover the approximate solution of Equation (26) is obtained by using BPM when N = 5 in the form:
Φ 5 ( x ) = ( 0.9999979912 + 4.00000242 x + 5.999999360 x 2 + 3.999999854 x 3 + 1.000000069 x 4 2.153000000 × 10 8 x 5 ) .
Thus, the approximate solution of Equation (24) is given by:
Y 5 ( x , t ) = ( 0.9999979912 + 4.00000242 x + 5.999999360 x 2 + 3.999999854 x 3 + 1.000000069 x 4
2.153000000 × 10 8 x 5 ) ( 0.255 e 2 t 0.245 + 0.5 t ) .
Absolute errors in cases (I) and (II) are presented in Table 1, while a comparison between the errors for different values of t is presented in Figure 1 and Figure 2.
From the above results, it is clear that the first case when the function of time for the known and unknown functions equal the results is better than the second case when the functions of the time for the known and unknown functions are different.
Note that choosing the time of the known function is the same as measuring the unknown function, resulting in less error and faster calculations. Therefore, in the following examples, we will apply this rule.
Example 2. 
Consider the second-order MDeIDE:
2 x 2 ( Y ( x , t ) ) + x 2 x ( Y ( x , t ) ) + ( Y ( x , t ) ) + 2 x 2 ( Y ( x + 1 , t ) ) 2 x x ( Y ( x + 1 , t ) ) + ( Y ( x + 1 , t ) )
0 t 1 1 t 2 τ 2 x u Y ( u 1 , τ ) d u d τ = e t ( 4 4 x ( x + 1 ) + 2 x 3 + x 2 8 3 x t 2 + 4 3 x t 4 + 8 3 x t 2 ) 8 3 x t 3 ,
under the conditions:
Y ( 1 , t ) + Y ( 0 , t ) Y ( 1 , t ) = 0 , x Y ( 1 , t ) + x Y ( 0 , t ) + x Y ( 1 , t ) = 0 .
Comparing (27) with (1), then we have A 0 ( x ) = 1 , A 1 ( x ) = x 2 , A 2 ( x ) = 1 , A 0 * ( x ) = 1 ,
A 1 * ( x ) = 2 x , A 2 * ( x ) = 1 , M ( x , u ) = x u , G ( t , τ ) = t 2 τ 2 , α = 1 , β = 1 .
First, separation of variables is applied for the MDeIDE (27), then we obtain the following FDeIDE:
y ( x ) + x 2 y ( x ) + y ( x ) + y ( x + 1 ) 2 x y ( x ) + y ( x + 1 ) λ ( t ) 1 1 x u y ( u 1 ) d u
= ( 4 4 x ( x + 1 ) + 2 x 3 + x 2 8 3 x t 2 + 4 3 x t 4 + 8 3 x t 2 ) 8 3 x t 3 e t ,
λ ( t ) = t 4 2 t 3 + 2 t 2 2 t 2 e t . Now, BPM can be applied to the FDeIDE (28) for different values of time and different values on N .
The approximate solutions for N = 5 , 6 , t = 0.01 are given in the forms:
y 5 ( x ) = 2.127369662 × 10 10 + 1 × 10 9 x + 0.9999999995 x 2 + 7.642179733 × 10 10 x 3
2 . 60645989110 10 x 4 4.858519901 × 10 11 x 5 ,
y 6 ( x ) = 1.010914771 × 10 8 2.22 × 10 8 x + 1.000000008 x 2 + 1.9435568 × 10 11 x 3
+ 1.325834048 × 10 9 x 4 1.192225178 × 10 9 x 5 + 4.501374133 × 10 10 x 6 .
The approximate solutions for N = 5 , 6 , t = 0.2 are given in the forms:
y 5 ( x ) = 2.496818296 × 10 9 + 2 × 10 9 x + 1.000000001 x 2 + 3.350686332 × 10 10 x 3
+ 7.060534835 × 10 11 x 4 6.642258714 × 10 11 x 5 ,
y 6 ( x ) = 1.440412363 × 10 8 3.64 × 10 8 x + 1.000000001 x 2 2.803323588 × 10 10 x 3
+ 6.943925728 × 10 10 x 4 1.141975694 × 10 9 x 5 + 4.752621505 × 10 10 x 6 .
The approximate solution for N = 5 , 6 , t = 0.6 are given in the forms:
y 5 ( x ) = 6 . 88414636410 8 3.57 × 10 8 x + 0.9999999848 x 2 8.97630878 × 10 10 x 3
2.067424536 × 10 9 x 4 + 3.294061917 × 10 10 x 5 ,
y 6 ( x ) = 2.501614592 × 10 8 2.58 × 10 8 x + 0.9999999969 x 2 2.710147588 × 10 10 x 3
2.983005892 × 10 10 x 4 4.450781141 × 10 10 x 5 + 2.162109574 × 10 10 x 6 .
The approximate solutions with different values of time presented in Figure 3, while the absolute errors of the MDeIDE (28) are presented in Table 2 and Table 3 and Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9.
In Example 2, we deduce that the integral operator of time is λ ( t ) = t 4 2 t 3 + 2 t 2 2 t 2 e t . The corresponding errors with respect to the approximate solution for N = 5 at different times t = 0.01 , t = 0.2 , and t = 0.6 are considered in Table 2). The approximate solutions for the same times t = 0.01 , t = 0.2 , and t = 0.6 and position divisions N = 5 are computed in Figure 3. Figure 4 describes the arithmetic error at time t = 0.01 , N = 5 , Figure 5 at time t = 0.2 , N = 5 , and Figure 6 at time t = 0.6 , N = 5 .
In addition, for the same integral operator λ ( t ) = t 4 2 t 3 + 2 t 2 2 t 2 e t , Table 3 describes the arithmetic error for N = 6 at different times t = 0.01 (Figure 7), t = 0.2 (Figure 8) and t = 0.6 (Figure 9).
Example 3. 
Consider the third-order MDeIDE:
3 x 3 ( Y ( x , t ) ) x 2 x 2 ( Y ( x , t ) ) + x 2 x ( Y ( x , t ) ) + x ( Y ( x + 1 , t ) ) + 2 x ( Y ( x + 1 , t ) )
0 t 1 1 t 2 τ 2 ( x u x 2 ) Y ( u 1 , τ ) d u d τ = F ( x , t ) ,
under the conditions:
Y ( 1 , t ) + Y ( 0 , t ) Y ( 1 , t ) = 0 , x Y ( 1 , t ) + x Y ( 0 , t ) + x Y ( 1 , t ) = 0 ,
2 x 2 Y ( 1 , t ) 2 2 x 2 Y ( 0 , t ) + 2 x 2 Y ( 1 , t ) = 0 ,
where
F ( x , t ) = 2 x cos ( t ) + 2 x 3 cos ( t ) + ( 2 ( x + 1 ) ) cos ( t ) + 2 x ( x + 1 ) 2 cos ( t ) + ( 8 / 3 ) sin ( t ) t 4 x 2 + ( 16 / 3 ) cos ( t ) t 3 x 2
( 16 / 3 ) sin ( t ) t 2 x 2 + ( 4 / 3 ) sin ( t ) t 4 x + ( 8 / 3 ) cos ( t ) t 3 x ( 8 / 3 ) sin ( t ) t 2 x .
Applying separation of variables and BPM with different values of N and time, we obtain the approximate solutions in the following forms and Figure 10, while the absolute errors are presented in Table 4 and Table 5 and Figure 11, Figure 12, Figure 13, Figure 14, Figure 15 and Figure 16.
Approximate solutions of Equation (29), t = 0.01 , N = 5 and 6:
Y 5 ( x , t ) = ( 1.140799711 × 10 8 5.000000000 × 10 10 x + 0.9999999989 x 2 + 5.241201041 × 10 10 x 3
7.770462954 × 10 10 x 4 + 2.148532311 × 10 10 x 5 ) cos ( t ) ,
Y 6 ( x , t ) = ( 1.432847495 × 10 9 + 1.840000000 × 10 8 x + 0.9999999989 x 2 1.449812816 × 10 9 x 3
6.487289109 × 10 10 x 4 4.888468434 × 10 10 x 5 + 2.065982717 × 10 10 x 6 ) cos ( t ) .
Approximate solutions of Equation (29), t = 0.2 , N = 5 and 6:
Y 5 ( x , t ) = ( 2.000000000 × 10 9 x 2.345729037 × 10 9 x 3 + 3.893074478 × 10 9 x 4 5.725221408 × 10 8
9.306607722 × 10 10 x 5 + 1.000000006 x 2 ) cos ( t ) ,
Y 6 ( x , t ) = ( 6.096176508 × 10 10 x 4 7.469512476 × 10 10 x 6 + 6.885277168 × 10 9 x 3 + 2.576454336 × 10 9 x 5
+ 3.761232338 × 10 8 7.180000000 × 10 8 x + 1.000000002 x 2 ) cos ( t ) .
Approximate solutions of Equation (29), t = 0.6 , N = 5 and 6:
Y 5 ( x , t ) = ( 4.700353146 × 10 9 1.100000000 × 10 9 x + 0.9999999999 x 2 + 2.627135909 × 10 10 x 3
2.961940741 × 10 10 x 4 + 1.142398824 × 10 10 x 5 ) cos ( t ) ,
Y 6 ( x , t ) = ( 3.702617288 × 10 10 x 4 8.000128981 × 10 10 x 6 + 5.746239317 × 10 9 x 3 + 2.274022244 × 10 9 x 5
+ 2.521244364 × 10 8 7.210000000 × 10 8 x + 1.000000007 x 2 ) cos ( t ) .
In Example 3, the time integral operator is in the form λ ( t ) = ( t 4 2 t 2 ) tan t + 2 t 3 . We compute the corresponding errors at t = 0.01 , t = 0.2 and t = 0.6 and position divisions N = 5 , 6 are computed in Table 4 and Table 5, respectively. The approximate solutions corresponding to the same times t = 0.01 , t = 0.2 and t = 0.6 and position divisions N = 6 are considered in Figure 10. Figure 11, Figure 12 and Figure 13 descript the error at t = 0.01 , t = 0.2 , and t = 0.6 and position divisions N = 5 , , respectively. In addition, Figure 14, Figure 15 and Figure 16 describe the error at t = 0.01 , t = 0.2 , and t = 0.6 and position divisions N = 6 , respectively.
Example 4. 
Consider the third-order MDeIDE:
3 x 3 ( Y ( x , t ) ) x x ( Y ( x , t ) ) + 2 x 2 ( Y ( x + 1 , t ) ) x ( Y ( x + 1 , t ) )
0 t 1 1 t 2 τ ( x 2 u 2 ) Y ( u 1 , τ ) d u d τ = F ( x , t ) ,
under the conditions:
Y ( 1 , t ) 4 Y ( 0 , t ) + Y ( 1 , t ) = 0 , x Y ( 1 , t ) 2 x Y ( 0 , t ) + x Y ( 1 , t ) = 0 ,
2 x 2 Y ( 1 , t ) + 2 x 2 Y ( 0 , t ) 2 2 x 2 Y ( 1 , t ) = 0 ,
where
F ( x , t ) = 0.50 x ( 2 x 2 ) ( 0.25 + t ) + 2 t x ( 1 + ( x + 1 ) 2 2 x ) ( 0.25 + t ) 1.022222222 t 5 x 2 0.3833333334 t 4 x 2 .
Similarly to Examples 1, 2, and 3, the approximate solutions of Equation (30), t = 0.01 , N = 3 , 4 , and 5 are given by:
Y 3 ( x , t ) = ( 1.000000176 2.000000121 x + 1.000000036 x 2 6.075000639 × 10 9 x 3 ) ( 0.25 + t ) ,
Y 4 ( x , t ) = ( 0.9999997899 1.999999887 x + 0.9999999646 x 2 + 7.075555371 × 10 9 x 3
1.173333295 × 10 9 x 4 ) ( 0.25 + t ) ,
Y 5 ( x , t ) = ( 0.9999999528 1.999999967 x + 0.9999999876 x 2 + 2.145994870 × 10 9 x 3 + 1.846692090 × 10 11 x 4
7.508888151 × 10 11 x 5 ) ( 0.25 + t ) .
Approximate solutions of Equation (30), t = 0.2 , N = 3 , 4 , and 5
Y 3 ( x , t ) = ( 0.9999988592 1.999999213 x + 0.9999997631 x 2 + 3.905624706 × 10 8 x 3 ) ( 0.25 + t ) ,
Y 4 ( x , t ) = ( 0.9999995217 1.999999718 x + 0.9999999134 x 2 + 1.619110957 × 10 8 x 3
1.759999826 × 10 9 x 4 ) ( 0.25 + t ) ,
Y 5 ( x , t ) = ( 0.9999998992 1.999999954 x + 0.9999999815 x 2 + 4.191083322 × 10 9 x 3 8.620453512 × 10 10 x 4
1.172459803 × 10 10 x 5 ) ( 0.25 + t ) .
Approximate solutions of Equation (30), t = 0.6 , N = 3 , 4 , and 5
Y 3 ( x , t ) = ( 1.000000406 2.000000270 x + 1.000000073 x 2 1.207500007 × 10 8 x 3 ) ( 0.25 + t ) ,
Y 4 ( x , t ) = ( 0.9999998495 1.999999909 x + 0.9999999751 x 2 + 4.488888742 × 10 9 x 3
3.555555498 × 10 10 x 4 ) ( 0.25 + t ) ,
Y 5 ( x , t ) = ( 1.000000713 2.000000410 x + 1.000000126 x 2 2.407736935 × 10 8 x 3 + 2.378248116 × 10 9 x 4
+ 4.240676445 × 10 10 x 5 ) ( 0.25 + t ) .
The approximate solution with different values of time presented in Figure 17, while the absolute errors are presented in Table 6, Table 7 and Table 8 and Figure 18, Figure 19, Figure 20, Figure 21, Figure 22, Figure 23, Figure 24 and Figure 25.
In Example 4, for λ ( t ) = 0.3333333333 t 5 + 0.125000000 t 4 0.25 + t and time t = 0.01 . The corresponding error for N = 3 , 4 , and 5 are considered in Table 6, respectively, while for time t = 0.2 and for N = 3 , 4 , and 5, the arithmetic errors are computed in Table 7, respectively. The approximation solutions at t = 0.01 , t = 0.2 , and t = 0.6 and position divisions N = 5 are computed at Figure 17, while Figure 18, Figure 19 and Figure 20 describe the arithmetic errors for N = 4 , t = 0.01 ; N = 5 , t = 0.01 ; and N = 3 , t = 0.2 , respectively. Moreover, at N = 4 , t = 0.2 , see Figure 21, and at N = 5 , t = 0.2 , see Figure 22. At time t = 0.6 , N = 3 , 4 , and 5 , see Figure 23, Figure 24 and Figure 25, respectively.

5. Conclusions

From the above results and discussion, we can establish the following:
1
In the present article, the Bernoulli polynomial method with aid of separation of variables could be applied for solving (1+1) dimensional mixed-difference integro-differential equations with variable coefficients under mixed conditions.
2
Four numerical examples are presented to illustrate the effectively of the method. The numerical results are presented in tables and figures. For example, Figure 3, Figure 10, and Figure 17 included the approximate solution of Examples 2, 3, and 4, respectively, for different values of time and N. Figure 1 and Figure 2, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9, Figure 11, Figure 12, Figure 13, Figure 14, Figure 15 and Figure 16, and Figure 18, Figure 19, Figure 20, Figure 21, Figure 22, Figure 23, Figure 24 and Figure 25 included the absolute errors of each example with different values of time.
3
In the first example, absolute errors in two cases of the time function are presented in Table 1 and Figure 1 and Figure 2.
4
In the second example in Table 2 at t = 0.01 , the error is as high as possible at point x = 1 and its value is 2.781265687 × 10 9 . Furthermore, the error begins to decrease, and when the value of x = 1 , its value is 6.844846536 × 10 10 . It is also clear that the error ratio between the time rates t = 0.01 : t = 0.2 : t = 0.6 at x = 1 is 2.781265687 × 10 9 : 4.734313724 × 10 9 : 1.597552461 × 10 7 . This indicates that choosing the time function enabled the authors to adjust the error amount between the lowest time and the highest time by 10 2 . This ratio is also measured at x = 1 .
5
In the third example from Table 4, we find the following: time can be represented as a linear combination between polynomials and trigonometric functions. This helped to quasi-stabilize the error in t = 0.01 : t = 0.2 : t = 0.6 , where we find the values of the arithmetic errors at x = 1 are, respectively, 9.291457878 × 10 9 , 4.122429603 × 10 8 , and 4.131665385 × 10 9 . Whereas, when x = 1 , the arithmetic errors are as follows: 9.769380656 × 10 9 , 5.156672264 × 10 8 , and 2.938153287 × 10 9 . This continuous convergence in the error rate, whether at the lowest point and the highest point or at different times, confirms that the technique of separating the variables made can reduce the relative error by choosing the appropriate time function. Furthermore, we note that if the value of N increases, the error decreases; for example, in Table 4, when N = 5 , t = 0.01 at the points x = 0.6 , 0.4 , 0.2 , the errors equal 1.10808011 × 10 8 , 1.137578332 × 10 8 , 1.145791700 × 10 8 , while in Table 5, when N = 6 , t = 0.01 at the same points, the errors decrease by 9.725949916 × 10 9 , 6.020827675 × 10 9 , 2.280310495 × 10 9 .
6
It is clear that BPM has an easy methodology and is incredibly simple for computer programming.

Author Contributions

Conceptualization, M.A.A.; Methodology, A.M.S.M., M.A.A. and D.S.M.; Software, A.M.S.M. and D.S.M.; Validation, D.S.M.; Formal analysis, A.M.S.M.; Resources, A.M.S.M. and M.A.A.; Data curation, D.S.M.; Writing—original draft, A.M.S.M., M.A.A. and D.S.M.; Writing—review & editing, A.M.S.M., M.A.A. and D.S.M.; Supervision, M.A.A. All authors developed the approach, completed the analysis, and wrote the manuscript. All authors read the final draft and gave their consent. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

This article’s initial draft beginning or appearance were not affected by any adverse situations.

Future Work

In the forthcoming future work, the authors will discuss two important points, namely: (a) This method can be extended for solving a (2+1) dimensional mixed-difference integro-differential equation; (b) The same equation can be studied when the nucleus of the locus is abnormal and takes a general form.

References

  1. Aghazadeh, N.; Khajehnasiri, A.A. Solving nonlinear two-dimensional Volterra integro-differential equations by block-pulse functions. Math. Sci. 2013, 7, 1–6. [Google Scholar] [CrossRef]
  2. Tari, A.; Shahmorad, S. Differential transform method for the system of two-dimensional nonlinear Volterra integro-differential equations. Comput. Math. Appl. 2011, 61, 2621–2629. [Google Scholar] [CrossRef]
  3. Hussain, A.K.; Fadhel, F.S.; Rusli, N.; Yahya, Z.R. Iteration variational method for solving two-dimensional partial integro-differential equations. J. Phys. Conf. Ser. 2020, 1591, 012091. [Google Scholar] [CrossRef]
  4. Hamoud, A.A.; Mohammed, N.M.; Ghadle, K.P.; Dhondge, S.L. Solving integro-differential equations by using numerical techniques. Int. J. Appl. Eng. Res. 2019, 14, 3219–3225. [Google Scholar]
  5. Khajehnasiri, A.A. Numerical solution of nonlinear 2d Volterra-Fredholm integro-differential equations by two-dimensional triangular function. Int. J. Appl. Comput. Math. 2016, 2, 575–591. [Google Scholar] [CrossRef]
  6. Mirzaee, F.; Alipour, S.; Samadyar, N. A numerical approach for solving weakly singular partial integro-differential equations via two-dimensional-orthonormal Bernstein polynomials with the convergence analysis. Numer. Methods Partial. Differ. Equ. 2019, 35, 615–637. [Google Scholar] [CrossRef]
  7. Rivaz, A.; Jahan, S.; Yousefi, F. Two-dimensional Chebyshev polynomials for solving two-dimensional integro-differential equations. Çankaya Univ. J. Sci. Eng. 2015, 12, 1–11. [Google Scholar]
  8. Behzadi, S. The use of iterative methods to solve two-dimensional nonlinear Volterra-Fredholm integro-differential equations. Commun. Numer. Anal. 2012, 2012, 1–20. [Google Scholar] [CrossRef]
  9. Ahmed, S.A.; Elzaki, T.M. On the comparative study integro-differential equations using difference numerical methods. J. King Saud-Univ.- Sci. 2020, 32, 84–89. [Google Scholar] [CrossRef]
  10. Pandey, P.K. Numerical solution of linear Fredholm integro-differential equations by non-standard finite difference method. Appl. Appl. Math. Int. J. 2015, 10, 1019–1026. [Google Scholar]
  11. Zada, L.; Al-Hamami, M.; Nawaz, R.; Jehanzeb, S.; Morsy, A.; Abdel-Aty, A.; Nisar, K.S. A new approach for solving Fredholm integro-differential equations. Inf. Sci. Lett. 2021, 10, 407–415. [Google Scholar]
  12. Al-Bugami, A.M. Two-dimensional Fredholm integro-differential equation with singular kernel and its numerical solutions. Adv. Math. Phys. 2022, 2022, 2501947. [Google Scholar] [CrossRef]
  13. El-Borai, M.M.; Abdou, M.A.; Youssef, M.I.M. On Adomians decomposition method for solving nonlocal perturbed stochastic fractional integro-differential equations. Life Sci. J. 2013, 10, 550–555. [Google Scholar]
  14. Abdou, M.A.; Elsayed, M.A. Fractional integro differential equation and spectral relationships. Int. J. Comput. Sci. Technol. 2014, 137–139. [Google Scholar]
  15. Aboodh, K.S.; Farah, R.A.; Almardy, I.A.; ALmostafa, F.A. Solution of partial integro-differential equations by using aboodh and double aboodh transform methods. Glob. J. Pure Appl. Math. 2017, 13, 4347–4360. [Google Scholar]
  16. Al-Bugami, A.M. Nonlinear Fredholm integro-differential equation in two-dimensional and its numerical solutions. Aims Math. 2021, 6, 10383–10394. [Google Scholar] [CrossRef]
  17. Saadatmandia, A.; Dehghan, M. Numerical solution of the higher-order linear Fredholm integro-differential-difference equation with variable coefficients. Comput. Math. Appl. 2010, 59, 2996–3004. [Google Scholar] [CrossRef]
  18. Gülsu, M.; Öztürk, Y.; Sezer, M. A new collocation method for solution of mixed linear integro-differential-difference equations. Appl. Math. Comput. 2010, 216, 2183–2198. [Google Scholar] [CrossRef]
  19. Erdem, K.; Yalçinbaş, S.; Sezer, M. A Bernoulli polynomial approach with residual correction for solving mixed linear Fredholm integro-differential-difference equations. J. Differ. Equa. Appl. 2013, 19, 1619–1631. [Google Scholar] [CrossRef]
  20. Aslan, B.; Gurbuz, B.; Sezer, M. A new collocation method for solution of mixed linear integro-differential difference equations. New Trends Math. Sci. 2015, 3, 133–146. [Google Scholar]
  21. Mollaoglu, T.; Sezer, M. A numerical approach with residual error estimation for solution of high-order linear differential-difference equations by using Gegenbauer polynomials. CBU J. Sci. 2017, 13, 39–49. [Google Scholar]
  22. Gümgüm, S.; Sava aneril, N.; Kürkü, O.; Sezer, M. A numerical technique based on Lucas polynomials together with standard and Chebyshev-Lobatto collocation points for solving functional integro-differential equations involving variable delays. Sak. Univ. J. Sci. 2018, 22, 1659–1668. [Google Scholar] [CrossRef]
  23. Yavuz, M.; Özkol, I. Solutions of integro-differential difference equations via differential transform method. J. Sci. Eng. 2021, 18, 33–46. [Google Scholar]
  24. Doha, E.H.; Hafez, R.M.; Abdelkawy, M.A.; Ezz-eldien, S.S.; Taha, T.M.; Amin, A.Z.M.; EL-Kalaawy, A.A.; Baleanu, D. Composite Bernoulli-laguerre collocation method for a class of hyperbolic telegraph-type equations. Rom. Rep. Phys. 2017, 69, 119. [Google Scholar]
  25. Dascioglu, A.; Sezer, M. Bernoulli collocation method for high-order generalized pantograph equations. New Trends Math. Sci. 2015, 3, 96–109. [Google Scholar]
  26. Mirzaee, F. Bernoulli collocation method with residual correction for solving integral-algebraic equations. J. Linear Topol. Algebr. 2015, 4, 193–208. [Google Scholar]
  27. Hafez, R.M.; Doha, E.H.; Bhrawy, A.H.; Baleanu, D. Numerical solutions of two-dimensional mixed Volterra-Fredholm integral equations via Bernoulli collocation method. Rom. Phys. 2017, 62, 1–11. [Google Scholar]
  28. Toutounian, F.; Tohidi, E.; Shateyi, S. A Collocation method based on the Bernoulli operational matrix for solving high-order linear complex differential equations in a rectangular domain. Abstr. Appl. Anal. 2013, 2013, 823098. [Google Scholar] [CrossRef]
  29. Alalyani, A.; Abdou, M.A.; Basseem, M. On a solution of a third kind mixed integro-differential equation with singular kernel using orthogonal polynomial method. J. Appl. Math. 2023, 2023, 5163398. [Google Scholar] [CrossRef]
  30. Alsulaiman, R.E.; Abdou, M.A.; Youssef, E.M.; Taha, M. Solvability of a nonlinear integro-differential equation with fractional order using the Bernoulli matrix approach. Aims Math. 2023, 8, 7515–7534. [Google Scholar] [CrossRef]
  31. Jan, A.R. Numerical solution via a singular mixed integral equation in (2+1) dimensional. Appl. Math. Inf. Sci. 2022, 16, 871–882. [Google Scholar]
  32. Jan, A.R. An asymptotic model for solving mixed integral equation in position and time. J. Math. 2022, 2022, 8063971. [Google Scholar] [CrossRef]
  33. Mahdy, A.M.S.; Nagdy, A.S.; Hashem, K.M.; Mohamed, D.S. A computational technique for solving three-dimensional mixed Volterra-Fredholm integral equations. Fractal Fract. 2023, 7, 196. [Google Scholar]
  34. Mahdy, A.M.S.; Mohamed, D.S. Approximate solution of cauchy integral equations by using Lucas polynomials. Comput. Appl. Math. 2022, 41, 403. [Google Scholar] [CrossRef]
  35. Mahdy, A.M.S.; Shokry, D.; Lotfy, K. Chelyshkov polynomials strategy for solving 2-dimensional nonlinear Volterra integral equations of the first kind. Comput. Appl. Math. 2022, 41, 257. [Google Scholar] [CrossRef]
  36. Alhazmi, S.E.; Abdou, M.A. A physical phenomenon for the fractional nonlinear mixed integro-differential equation using a general discontinuous kernel. Fractal Fract. 2023, 7, 173. [Google Scholar] [CrossRef]
  37. Abdou, M.A. On asymptotic methods for Fredholm- Volterra integral equation of the second kind in contact problems. J. CAM 2003, 154, 431–446. [Google Scholar]
  38. Apostol, T.M. Introduction to Analytic Number Theory; Springer: New York, NY, USA, 1976. [Google Scholar]
Figure 1. Errors of Example 1, case (I).
Figure 1. Errors of Example 1, case (I).
Mathematics 11 02045 g001
Figure 2. Errors of Example 1, case (II).
Figure 2. Errors of Example 1, case (II).
Mathematics 11 02045 g002
Figure 3. Approximate solutions of Example 2, N = 5.
Figure 3. Approximate solutions of Example 2, N = 5.
Mathematics 11 02045 g003
Figure 4. Abs. error of Example 2, N = 5, t = 0.01.
Figure 4. Abs. error of Example 2, N = 5, t = 0.01.
Mathematics 11 02045 g004
Figure 5. Abs. error of Example 2, N = 5, = 0.2.
Figure 5. Abs. error of Example 2, N = 5, = 0.2.
Mathematics 11 02045 g005
Figure 6. Abs. error of Example 2, N = 5, t = 0.6.
Figure 6. Abs. error of Example 2, N = 5, t = 0.6.
Mathematics 11 02045 g006
Figure 7. Abs. error of Example 2, N = 6, t = 0.01.
Figure 7. Abs. error of Example 2, N = 6, t = 0.01.
Mathematics 11 02045 g007
Figure 8. Abs. error of Example 2, N = 6, t = 0.2.
Figure 8. Abs. error of Example 2, N = 6, t = 0.2.
Mathematics 11 02045 g008
Figure 9. Abs. error of Example 2, N = 6, t = 0.6.
Figure 9. Abs. error of Example 2, N = 6, t = 0.6.
Mathematics 11 02045 g009
Figure 10. Approximate solutions of Example 3, N = 6.
Figure 10. Approximate solutions of Example 3, N = 6.
Mathematics 11 02045 g010
Figure 11. Abs. error of Example 3, N = 5, t = 0.01.
Figure 11. Abs. error of Example 3, N = 5, t = 0.01.
Mathematics 11 02045 g011
Figure 12. Abs. error of Example 3, N = 5, t = 0.2.
Figure 12. Abs. error of Example 3, N = 5, t = 0.2.
Mathematics 11 02045 g012
Figure 13. Abs. error of Example 3, N = 5, t = 0.6.
Figure 13. Abs. error of Example 3, N = 5, t = 0.6.
Mathematics 11 02045 g013
Figure 14. Abs. error of Example 3, N = 6, t = 0.01.
Figure 14. Abs. error of Example 3, N = 6, t = 0.01.
Mathematics 11 02045 g014
Figure 15. Abs. error of Example 3, N = 6, t = 0.2.
Figure 15. Abs. error of Example 3, N = 6, t = 0.2.
Mathematics 11 02045 g015
Figure 16. Abs. error of Example 3, N = 6, t = 0.6.
Figure 16. Abs. error of Example 3, N = 6, t = 0.6.
Mathematics 11 02045 g016
Figure 17. Approximate solutions of Example 4, N = 5.
Figure 17. Approximate solutions of Example 4, N = 5.
Mathematics 11 02045 g017
Figure 18. Abs. error of Example 4, N = 4, t = 0.01.
Figure 18. Abs. error of Example 4, N = 4, t = 0.01.
Mathematics 11 02045 g018
Figure 19. Abs. error of Example 4, N = 5, t = 0.01.
Figure 19. Abs. error of Example 4, N = 5, t = 0.01.
Mathematics 11 02045 g019
Figure 20. Abs. error of Example 4, N = 3, t = 0.2.
Figure 20. Abs. error of Example 4, N = 3, t = 0.2.
Mathematics 11 02045 g020
Figure 21. Abs. error of Example 4, N = 4, t = 0.2.
Figure 21. Abs. error of Example 4, N = 4, t = 0.2.
Mathematics 11 02045 g021
Figure 22. Abs. error of Example 4, N = 5, t = 0.2.
Figure 22. Abs. error of Example 4, N = 5, t = 0.2.
Mathematics 11 02045 g022
Figure 23. Abs. error of Example 4, N = 3, t = 0.6.
Figure 23. Abs. error of Example 4, N = 3, t = 0.6.
Mathematics 11 02045 g023
Figure 24. Abs. error of Example 4, N = 4, t = 0.6.
Figure 24. Abs. error of Example 4, N = 4, t = 0.6.
Mathematics 11 02045 g024
Figure 25. Abs. error of Example 4, N = 5, t = 0.6.
Figure 25. Abs. error of Example 4, N = 5, t = 0.6.
Mathematics 11 02045 g025
Table 1. (a) Absolute errors of Example 1, N = 5, Case (I). (b) Absolute errors of Example 1, N = 5, Case (II).
Table 1. (a) Absolute errors of Example 1, N = 5, Case (I). (b) Absolute errors of Example 1, N = 5, Case (II).
a
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 4.295783298 × 10 11 1.383365546 × 10 9 3.053281180 × 10 9
0.8 1.407642271 × 10 11 4.533012221 × 10 10 1.000499177 × 10 9
0.6 3.340401093 × 10 12 1.075705049 × 10 10 2.374231446 × 10 10
0.4 4.398882097 × 10 13 1.416566319 × 10 11 3.126559928 × 10 11
0.2 1.374650655 × 10 14 4.426769747 × 10 13 9.770499776 × 10 13
0 0.0000000000 0.0000000000 0.0000000000
0.2 1.374650655 × 10 14 4.426769747 × 10 13 9.770499776 × 10 13
0.4 4.398882097 × 10 13 1.416566319 × 10 11 3.126559928 × 10 11
0.6 3.340401093 × 10 12 1.075705049 × 10 10 2.374231446 × 10 10
0.8 1.407642271 × 10 11 4.533012221 × 10 10 1.000499177 × 10 9
1 4.295783298 × 10 11 1.383365546 × 10 9   3.053281180 × 10 9
b
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 4.338583868 × 10 10 5.068491366 × 10 9 1.941208993 × 10 8
0.8 1.421667162 × 10 10 1.660843251 × 10 9 6.360953628 × 10 9
0.6 3.373682816 × 10 11 3.941258886 × 10 10 1.509484113 × 10 9
0.4 4.442709881 × 10 12 5.190135159 × 10 11 1.987798009 × 10 10
0.2 1.388346838 × 10 13 1.621917237 × 10 12 6.211868778 × 10 12
0 0.0000000000 0.0000000000 0.0000000000
0.2 1.388346838 × 10 13 1.621917237 × 10 12 6.211868778 × 10 12
0.4 4.442709881 × 10 12 5.190135159 × 10 11 1.987798009 × 10 10
0.6 3.373682816 × 10 11 3.941258886 × 10 10 1.509484113 × 10 9
0.8 1.421667162 × 10 10 1.660843251 × 10 9 6.360953628 × 10 9
1 4.338583868 × 10 10 5.068491366 × 10 9   1.941208993 × 10 8
Table 2. Absolute errors of Example 2, N = 5.
Table 2. Absolute errors of Example 2, N = 5.
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 2.781265687 × 10 9 4.734313724 × 10 9 1.597552461 × 10 7
0.8 1.720130311 × 10 9 4.511495916 × 10 9 1.586547797 × 10 7
0.6 9.481884237 × 10 10 4.226217915 × 10 9 1.542055091 × 10 7
0.4 4.047836470 × 10 10 3.889896759 × 10 9 1.469792755 × 10 7
0.2 3.371573438 × 10 11 3.501291945 × 10 9 1.373341187 × 10 7
0 2.148750082 × 10 10 3.049620753 × 10 9 1.254373251 × 10 7
0.2 3.826233012 × 10 10 2.517673601 × 10 9 1.112884769 × 10 7
0.4 5.010544686 × 10 10 1.884929383 × 10 9 9.474249956 × 10 8
0.6 5.897000161 × 10 10 1.130670813 × 10 9 7.553271053 × 10 8
0.8 6.542132093 × 10 10 2.370997737 × 10 10 5.329386783 × 10 8
1 6.844846536 × 10 10 8.075473518 × 10 10   2.758521792 × 10 8
Table 3. Absolute errors of Example 2, N = 6.
Table 3. Absolute errors of Example 2, N = 6.
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 2.319076399 × 10 8 6.621812720 × 10 8 8.774828405 × 10 8
0.8 1.389999449 × 10 8 5.493241119 × 10 8 7.975014301 × 10 8
0.6 6.407288456 × 10 9 4.494809250 × 10 8 7.174645438 × 10 8
0.4 8.571861948 × 10 11 3.559714676 × 10 8 6.345426391 × 10 8
0.2 5.403723537 × 10 9 2.652962810 × 10 8 5.474788843 × 10 8
0 1.021074633 × 10 8 1.759323633 × 10 8 4.558238978 × 10 8
0.2 1.437342562 × 10 8 8.739632886 × 10 9 3.593520223 × 10 8
0.4 1.787492175 × 10 8 4.249434780 × 10 11 2.576591379 × 10 8
0.6 2.067924577 × 10 8 8.767617410 × 10 9 1.499420122 × 10 8
0.8 2.274607467 × 10 8 1.746680587 × 10 8 3.495918891 × 10 9
1 2.402461611 × 10 8 2.617441554 × 10 8   8.882658608 × 10 9
Table 4. Absolute errors of Example 3, N = 5.
Table 4. Absolute errors of Example 3, N = 5.
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 9.291457878 × 10 9 4.122429603 × 10 8 4.131665385 × 10 9
0.8 1.044640879 × 10 8 4.772810458 × 10 8 4.299622496 × 10 9
0.6 1.10808011 × 10 8 5.174891314 × 10 8 4.302242101 × 10 9
0.4 1.137578332 × 10 8 5.412877805 × 10 8 4.205415949 × 10 9
0.2 1.145791700 × 10 8 5.545816649 × 10 8 4.054786767 × 10 9
0 1.140742671 × 10 8 5.611098152 × 10 8 3.879368854 × 10 9
0.2 1.126645000 × 10 8 5.627958704 × 10 8 3.695168671 × 10 9
0.4 1.104728732 × 10 8 5.600983281 × 10 8 3.508805431 × 10 9
0.6 1.074065198 × 10 8 5.523607952 × 10 8 3.321131699 × 10 9
0.8 1.032392013 × 10 8 5.381622365 × 10 8 3.130853974 × 10 9
1 9.769380656 × 10 9 5.156672264 × 10 8   2.938153287 × 10 9
Table 5. Absolute errors of Example 3, N = 6.
Table 5. Absolute errors of Example 3, N = 6.
xAbsolute Error, t = 0.01Absolute Error, t = 0.2Absolute Error, t = 0.6
1 1.656984996 × 10 8 9.862870670 × 10 8 7.914132905 × 10 8
0.8 1.329959408 × 10 8 8.971856253 × 10 8 6.903496840 × 10 8
0.6 9.725949916 × 10 9 7.803833656 × 10 8 5.743920605 × 10 8
0.4 6.020827675 × 10 9 6.485406861 × 10 8 4.522178179 × 10 8
0.2 2.280310495 × 10 9 5.096054205 × 10 8 3.290397273 × 10 8
0 1.432775853 × 10 9 3.686258106 × 10 8 2.080872767 × 10 8
0.2 5.055812817 × 10 9 2.292261447 × 10 8 9.17837598 × 10 8
0.4 8.502858489 × 10 9 9.47450620 × 10 9 1.73808924 × 10 9
0.6 1.165063663 × 10 8 3.09634776 × 10 9 1.162815370 × 10 9
0.8 1.433404520 × 10 8 1.430665575 × 10 8 2.008935001 × 10 8
1 1.635118460 × 10 8 2.356260025 × 10 8   2.663325160 × 10 8
Table 6. Absolute errors of Example 4, t = 0.01.
Table 6. Absolute errors of Example 4, t = 0.01.
xAbsolute Error, N = 3Absolute Error, N = 4Absolute Error, N = 5
1 8.827950017 × 10 8 9.534471106 × 10 8 2.463363416 × 10 8
0.8 7.782470408 × 10 8 8.507485323 × 10 8 2.150531086 × 10 8
0.6 6.842517204 × 10 8 7.598889983 × 10 8 1.873037869 × 10 8
0.4 6.000508801 × 10 8 6.795754695 × 10 8 1.628738651 × 10 8
0.2 5.248863600 × 10 8 6.086320527 × 10 8 1.415244974 × 10 8
0 4.58 × 10 8 5.46 × 10 8 1.23 × 10 8
0.2 3.986336400 × 10 8 4.907377095 × 10 8 1.070353490 × 10 8
0.4 3.460291199 × 10 8 4.420207247 × 10 8 9.336367646 × 10 9
0.6 2.994282796 × 10 8 3.991417345 × 10 8 8.172376784 × 10 9
0.8 2.580729592 × 10 8 3.615105737 × 10 8 7.186755842 × 10 9
1 2.212049983 × 10 8 3.286542226 × 10 8   6.356763044 × 10 9
Table 7. Absolute errors of Example 4, t = 0.2.
Table 7. Absolute errors of Example 4, t = 0.2.
xAbsolute Error, N = 3Absolute Error, N = 4Absolute Error, N = 5
1 9.917753112 × 10 7 3.891779992 × 10 7 7.662114722 × 10 8
0.8 8.739825593 × 10 7 3.457348348 × 10 7 6.837922918 × 10 8
0.6 7.680922672 × 10 7 3.070564190 × 10 7 6.126154511 × 10 8
0.4 6.732608199 × 10 7 2.726865792 × 10 7 5.513809369 × 10 8
0.2 5.886446025 × 10 7 2.421995552 × 10 7 4.988769169 × 10 8
0 5.134 × 10 7 2.152 × 10 7 4.54 × 10 8
0.2 4.466833975 × 10 7 1.913229792 × 10 7 4.157754965 × 10 8
0.4 3.876511801 × 10 7 1.702339712 × 10 7 3.833776783 × 10 8
0.6 3.354597328 × 10 7 1.516288674 × 10 7 3.561500385 × 10 8
0.8 2.892654407 × 10 7 1.352339716 × 10 7 3.336255522 × 10 8
1 2.482246888 × 10 7 1.208060006 × 10 7   3.155469360 × 10 8
Table 8. Absolute errors of Example 4, t = 0.6.
Table 8. Absolute errors of Example 4, t = 0.6.
xAbsolute Error, N = 3Absolute Error, N = 4Absolute Error, N = 5
1 6.473637501 × 10 7 2.302177776 × 10 7 1.083226818 × 10 6
0.8 5.740350400 × 10 7 2.051453546 × 10 7 9.641323673 × 10 7
0.6 5.076369700 × 10 7 1.825953280 × 10 7 8.580105636 × 10 7
0.4 4.476768800 × 10 7 1.623439324 × 10 7 7.636938685 × 10 7
0.2 3.936621100 × 10 7 1.441790080 × 10 7 6.800508452 × 10 7
0 3.451 × 10 7 1.279 × 10 7 6.060 × 10 7
0.2 3.014978900 × 10 7 1.133179592 × 10 7 5.405236236 × 10 7
0.4 2.623631200 × 10 7 1.002555414 × 10 7 4.826816329 × 10 7
0.6 2.272030300 × 10 7 8.854700803 × 10 8 4.316254120 × 10 7
0.8 1.955249600 × 10 7 7.803822584 × 10 8 3.866116545 × 10 7
1 1.668362499 × 10 7 6.858666679 × 10 8   3.470162044 × 10 7
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

Mahdy, A.M.S.; Abdou, M.A.; Mohamed, D.S. Computational Methods for Solving Higher-Order (1+1) Dimensional Mixed-Difference Integro-Differential Equations with Variable Coefficients. Mathematics 2023, 11, 2045. https://doi.org/10.3390/math11092045

AMA Style

Mahdy AMS, Abdou MA, Mohamed DS. Computational Methods for Solving Higher-Order (1+1) Dimensional Mixed-Difference Integro-Differential Equations with Variable Coefficients. Mathematics. 2023; 11(9):2045. https://doi.org/10.3390/math11092045

Chicago/Turabian Style

Mahdy, Amr M. S., Mohamed A. Abdou, and Doaa Sh. Mohamed. 2023. "Computational Methods for Solving Higher-Order (1+1) Dimensional Mixed-Difference Integro-Differential Equations with Variable Coefficients" Mathematics 11, no. 9: 2045. https://doi.org/10.3390/math11092045

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