Next Article in Journal
Multi-Loop Model Reference Proportional Integral Derivative Controls: Design and Performance Evaluations
Previous Article in Journal
Approximation Algorithm for Shortest Path in Large Social Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations

Department of Mathematics and Statistics, Jordan University of Science & Technology, Irbid 22110, Jordan
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Algorithms 2020, 13(2), 37; https://doi.org/10.3390/a13020037
Submission received: 20 December 2019 / Revised: 30 January 2020 / Accepted: 4 February 2020 / Published: 9 February 2020

Abstract

:
In this paper, we present a robust algorithm to solve numerically a family of two-dimensional fractional integro differential equations. The Haar wavelet method is upgraded to include in its construction the Laplace transform step. This modification has proven to reduce the accumulative errors that will be obtained in case of using the regular Haar wavelet technique. Different examples are discussed to serve two goals, the methodology and the accuracy of our new approach.

1. Introduction

Wavelet on I R is studied by many mathematicians to construct an orthonormal basis for L 2 [ I R ] ; see [1,2,3]. One of the common wavelets is the Haar wavelet on I R . In approximation theory, once we have these bases, we are ready to find approximate solutions for many of the applied problems such as in [4,5]. Let u ( x , t ) be a function defined over [ 0 , 1 ] × [ 0 , 1 ] , and let k ( x , t , y , τ ) be a continuous kernel; in addition, assume 0 < α < 1 . In this work, we are interested in solving the two-dimensional fractional Fredholm integro-differential equation of the form:
D t α u ( x , t ) = f ( x , t ) + 0 1 0 1 k ( x , t , y , τ ) u ( y , τ ) d y d τ ,
where D t α u ( t ) is the fractional derivative in the sense of Caputo definition.
Babolian and Shahsavaran [4] obtained a numerical solution of nonlinear Fredholm integral equations of the second kind using Haar wavelets. In addition, Aziz, Fayyaza, and Islama proposed in [6] a new method for the numerical solution of a one-dimensional nonlinear Fredholm and Volterra using Haar wavelets. This method is the extension of Aziz and Islama work in [7]. Moreover, Aziz, Khan, and Islama also found a numerical solution for the two-dimensional nonlinear integral equation by establishing a new method based on Haar wavelet. In addition, Rehman and Khan in [8] solved fractional differential equations using the Legendre wavelet method. Furthermore, Pedas and Tamme, in [9], used spline collocation methods for multi-term fractional differential equations. In [4], Shesha, Savitha, and Nargund used the Haar wavelet method for the numerical solution of a two-dimensional Fredholm integral equation of the second kind. After awhile, Cattani used Shannon wavelets for the solution of integro-differential equations [10].
In [5], Lepik provided a numerical solution for one-dimensional, fractional integral equations using the Haar wavelet method. A similar approach can be done by replacing functions of one variable by functions of two variables. In this paper, we find numerical solutions for the fractional integro-differential Equation (1) using the Haar wavelet method (HWM); then, we use a modified approach with the help of Laplace transform to solve the same equation. The examples we provide show the efficiency of the second method comparing with the HWM.

2. Preliminaries and Basic Concepts

2.1. Fractional Derivative

There are many definitions that describe the fractional derivative. Here, we use Caputo approach which is defined as follows:
Definition 1.
(Caputo derivative). [11] The fractional derivative of f ( x ) in the Caputo sense is defined by
D x α f ( x ) = 1 Γ ( n α ) 0 x f ( n ) ( t ) ( x t ) n α 1 d t n I N , n 1 < α < n .
It is worth mentioning that a Caputo derivative allows traditional initial and boundary conditions to be included in the formulation of the problem [12] as well as the derivative of the constant being zero. For more information and properties about Caputo derivative, we encourage the reader to see [11,13,14,15].

2.2. Laplace Transform

Definition 2.
We denote the Laplace transform of a function f ( t ) by F ( s ) , which is defined as
F ( s ) = L [ f ( t ) ] ( s ) = 0 e s t f ( t ) d t .
Lemma 1.
The Laplace of the Caputo derivative is given by
L [ D t α f ( t ) ] ( s ) = s α F ( s ) k = 0 n 1 s α k 1 f ( k ) ( 0 ) .
Definition 3.
A function f on 0 t < is said to be exponentially bounded if it satisfies an inequality of the form
| f ( t ) | M e c t ,
for some real constants M > 0 and c, for all sufficiently large t.
Theorem (3.1) given in [16] shows that one can take the Laplace operator over fractional differential equations if the homogeneous part is exponentially bounded. A modification of this mentioned theorem will be adjusted to fit with the proposed Fredholm equation as follows:
Theorem 1.
[16] Assume Equation (1) has a unique continuous solution u ( x , t ) . If f ( x , t ) and k ( x , t , w , y ) are continuous for x , t , w , y [ 0 , 1 ] and exponentially bounded in t, then u ( x , t ) and its Caputo derivative are exponentially bounded in t, and their Laplace transforms exist in t.
As a corollary of this theorem and the Fubini’s Theorem, we have the following result
Corollary 1.
Let k ( x , t , w , y ) be continuous for 0 x , t , y , w 1 and of exponential order in t. If
f ( x , t ) = 0 1 0 1 k ( x , t , y , w ) d y d w , f o r 0 x , t 1 ,
then the Laplace transform of t f ( x , t ) exists and F ( x , s ) = 0 1 0 1 K ( x , s , y , w ) d y d w , where K ( x , s , y , w ) is the Laplace transform of t k ( x , t , y , w ) .

2.3. Haar Wavelet

Wavelet analysis is the tool to construct an orthonormal basis for L 2 [ R ] . One of the common wavelet bases is the Haar basis. In fact, for any i = 2 , 3 , 4 , there are unique j 0 and 0 k 2 j 1 such that i = 2 j + k + 1 . Hence, we define the family { h i } by
h 1 ( x ) = 1 , 0 x < 1 0 , elsewhere .
and
h i ( x ) = ψ j , k ( x ) = 2 j / 2 ψ ( 2 j x k ) , f o r i = 2 , 3 , 4 ,
where
ψ ( x ) = 1 , 0 x < 1 2 1 , 1 2 x < 1 0 , elsewhere .
The family { h i } defines an orthonormal basis for L 2 [ 0 , 1 ] —that is, any f ( x ) in L 2 [ 0 , 1 ] has the expansion f ( x ) = i = 1 a i h i ( x ) . For approximation purposes, the resolution level J is the maximum value for j in i = 2 j + k + 1 . Thus, for given resolution level J, we define the truncated series expansion of f ( x ) by
f ( x ) i = 1 2 J + 1 a i h i ( x )
where i = 2 j + k + 1 , j = 0 , 1 , 2 , 3 , , J , and 0 k 2 j 1 . In Table 1, we compute explicitly the corresponding values of j, k, and i for resolution level J = 3 .
Since we are dealing with both of u ( x ) and its derivative u ( x ) in differential equations, we will introduce the integrating Haar functions [5] by
p i ( x ) = 0 x h i ( x ) d x = x k 2 j , k 2 j x < k + 0.5 2 j k + 1 2 j x , k + 0.5 2 j x < k + 1 2 j 0 , elsewhere .
It follows that, if we approximate u ( x ) i = 1 2 J + 1 a i h i ( x ) , then we have u ( x ) u ( 0 ) i = 1 2 J + 1 a i p i ( x )

3. Haar Wavelet Method and Laplace Haar Wavelet Method

In this section, we propose the methodology of both the Haar wavelet method and the Laplace Haar wavelet method to find a numerical solution to the suggested two-dimensional integro-differential equation
D t α u ( x , t ) = f ( x , t ) + 0 1 0 1 k ( x , t , y , τ ) u ( y , τ ) d y d τ
subject to the initial condition
u ( x , 0 ) = 0 ,
where 0 < α < 1 , and D t α u ( x , t ) is the Caputo derivative.

3.1. Haar Wavelet Method (HWM)

We summarize the Haar wavelet approach in the following steps.
Step 1: After we determine the level of resolution J to approximate u ( x , t ) , we assume
t u ( x , t ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) h j ( t ) ,
where { a i j } are to be determined. Using the initial condition in (8) and integrating with respect to t over [ 0 , t ] , one can write
u ( x , t ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) p j ( t ) .
It follows that the integral term can be estimated by
0 1 0 1 k ( x , t , y , τ ) u ( y , τ ) d y d τ i = 1 2 J + 1 j = 1 2 J + 1 a i j 0 1 0 1 k ( x , t , y , τ ) h i ( y ) p j ( τ ) d y d τ
Step 2: Now, to estimate the term D t α u ( x , t ) , we plug Equation (9) into the definition of D t α u ( x , t ) to get
D t α u ( x , t ) = 1 Γ ( 1 α ) 0 t t u ( x , t ) ( t τ ) α d τ 1 Γ ( 1 α ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) 0 t h j ( τ ) ( t τ ) α d τ
Step 3: Use the results of step (1) and (2) to obtain the equation
1 Γ ( 1 α ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) 0 t h j ( τ ) ( t τ ) α d τ = f ( x , t ) + i = 1 2 J + 1 j = 1 2 J + 1 a i j 0 1 0 1 k ( x , t , y , τ ) h i ( y ) p j ( τ ) d y d τ
Use the equally distance nodes x m = m 0.5 2 J + 1 and t n = n 0.5 2 J + 1 to construct the system:
1 Γ ( 1 α ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x m ) 0 t n h j ( τ ) ( t n τ ) α d τ = f ( x m , t n ) + i = 1 2 J + 1 j = 1 2 J + 1 a i j 0 1 0 1 k ( x m , t n , y , τ ) h i ( y ) p j ( τ ) d y d τ
for m , n = 1 , 2 , 3 , , 2 J + 1 .
The wavelet coefficients a i j are obtained by solving the above the 2 J + 1 × 2 J + 1 system of equations.

3.2. Laplace Haar Wavelet Method (LHWM)

In this section, we summarize the methodology of Laplace Haar wavelet method to the two-dimensional integro-differential Equation (7), where we consider in this approach the more general case, for n 1 < α < n and initial conditions
u ( x , 0 ) = u 0 ( x ) , t u ( x , 0 ) = u 1 ( x ) , , n 1 t n 1 u ( x , 0 ) = u n 1 ( x )
which can be reached in the following steps.
Step 1. Determine the level of resolution J.
Step 2. Applying the Laplace transform to Equation (7), use Lemma 1, Corollary 1, and use the initial conditions u 0 ( x ) = u ( x , 0 ) , u 1 ( x ) = t u ( x , 0 ) ,..., u n 1 ( x ) = n 1 t k 1 u ( x , 0 ) , one gets:
s α U ( x , s ) k = 0 n 1 s α k 1 u k ( x ) = F ( x , s ) + 0 1 0 1 u ( y , w ) K ( x , s , y , w ) d w d y ,
equivalently,
U ( x , s ) = 1 s α F ( x , s ) + k = 0 n 1 s α k 1 u k ( x ) + 0 1 0 1 u ( y , w ) K ( x , s , y , w ) s α d w d y ,
Step 3. Divide by s α and take inverse Laplace transform
u ( x , t ) = g ( x , t ) + 0 1 0 1 u ( y , w ) R ( x , t , y , w ) d w d y ,
where g ( x , t ) = L 1 [ s α F ( x , s ) + k = 0 n 1 s α k 1 u k ( x ) ] and R ( x , t , y , w ) = L 1 [ s α K ( x , s , w , y ) ] .
Step 4. Use the Haar wavelet truncated series u ( x , t ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) h j ( t ) to discretize Equation (10):
i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) h j ( t ) = g ( x , t ) + j = 1 2 J + 1 i = 1 2 J + 1 a i j 0 1 0 1 h i ( y ) h j ( w ) R ( x , t , y , w ) d w d y .
Step 5. Use the nodes ( x m , t n ) , m , n = 1 , 2 , 3 , , 2 J + 1 to construct a 2 J + 1 × 2 J + 1 system
i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x m ) h j ( t n ) = g ( x m , t n ) + j = 1 2 J + 1 i = 1 2 J + 1 a i j 0 1 0 1 h i ( y ) h j ( w ) R ( x m , t n , y , w ) d w d y .
Then, solve this system to obtain the coefficients a i j .

4. Numerical Examples

Here, we discuss some examples to explain the methodology of the proposed methods and conduct some comparison analysis.
Example 1.
Consider the two-dimensional linear fractional Fredholm integro-differential equation:
D t 0.5 u ( x , t ) = π 2 e x 2 ( e 1 ) t 3 + 0 1 0 1 u ( y , τ ) t d τ d y
subject to the initial condition u ( x , 0 ) = 0 . The exact solution is u ( x , t ) = t e x . In this example, we find a numerical solution using the Haar wavelet method and then use the Laplace Haar wavelet method. In either approach, we consider the level of resolution J = 4 .
First, Approach:(Haar wavelet Method)
We need to estimate the terms D t 0.5 u ( x , t ) and 0 1 0 1 t u ( y , τ ) d τ d y . Hence, we use
t u ( x , t ) i = 1 32 j = 1 32 a i j h i ( x ) h j ( t ) .
Integrate both sides and use the initial condition u ( x , 0 ) = 0 to find that
u ( x , t ) i = 1 32 j = 1 32 a i j h i ( x ) p j ( t ) .
Now, using the equally distance nodes x m = m 0.5 32 and t n = n 0.5 32 , and using the estimates in (12) and (13), one can obtain the discrete system
1 π i = 1 32 j = 1 32 a i j h i ( x m ) 0 t n h j ( τ ) ( t n τ ) 0.5 d τ = π 2 e x m 2 ( e 1 ) t n 3 + j = 1 32 a i j t n p i ( 1 ) q j ( 1 )
for n , m = 1 , 2 , 3 , , 32 , where q j ( x ) : = 0 x p j ( y ) d y . Use one of the common computer packages (we used Mathematica 11) to compute the Haar coefficients a i j , for n , m = 1 , 2 , 3 , , 32 . Figure 1, Figure 2 and Figure 3 show the exact and approximate solutions for different levels of resolution.
Second Approach:(Laplace Haar wavelet Method)
We apply the Laplace transform to Equation (11) to get
s U ( x , s ) = π 2 1 s e x 2 ( e 1 ) 3 s 2 + 1 s 2 0 1 0 1 u ( y , τ ) d τ d y
or, equivalently,
U ( x , s ) = π 2 1 s 3 / 2 e x 2 ( e 1 ) 3 s 5 / 2 + 1 s 5 / 2 0 1 0 1 u ( y , τ ) d τ d y
Now, we take the inverse Laplace transform to obtain
u ( x , t ) = t e x 8 ( e 1 ) 9 t 3 + 4 t 3 3 π 0 1 0 1 u ( y , τ ) d τ d y .
To discretize the above equation, we take the nodes x n = t n = n 0.5 32 , n = 1 , 2 , 3 , 32 . By this choice, we have the system
n = 1 32 m = 1 32 a n m h n ( x i ) h m ( t j ) = t j e x i 8 ( e 1 ) 9 t j 3 + 4 t j 3 3 π 0 1 0 1 n = 1 32 m = 1 32 a n m h n ( y ) h m ( τ ) d τ d y .
Using the fact that 0 1 h i ( x ) d x = p i ( 1 ) for all i = 1 , 2 , 3 , , 32 , one can write the above system as
n = 1 32 m = 1 32 a n m h n ( x i ) h m ( t j ) = t j e x i 8 ( e 1 ) 9 t j 3 + 4 t j 3 3 π n = 1 32 m = 1 32 a n m p n ( 1 ) p m ( 1 ) .
Figure 4 and Figure 5 show the graphs of the approximate solution at the level of resolution J = 4 .
Example 2.
Consider the following problem
D t 0.5 u ( x , t ) = 6 ( 2 e ) + 8 t 3 / 2 sinc x + π π 0 1 0 1 y e τ u ( y , τ ) d y d τ ,
subject to the initial condition u ( x , 0 ) = 0 , where sinc ( x ) = sin ( π x ) π x is the normalized sinc function. The exact solution is u ( x , t ) = 3 π t 2 sinc x .
When we use the Haar wavelet method at J = 4 , we discretize Equation (14) by
1 π i = 1 32 j = 1 32 a i j h i ( x m ) 0 t n h j ( τ ) ( t n τ ) 0.5 d τ = 6 ( 2 e ) + 8 t n 3 / 2 sinc x m + π π j = 1 32 i = 1 32 a i j 0 1 y h i ( y ) d y 0 1 p j ( τ ) e τ d τ
with x m = m 0.5 32 , t n = n 0.5 32 for n , m = 1 , 2 , 3 , , 32 . We solve the above system to get the approximate solution
u ( x , t ) = j = 1 32 i = 1 32 a i j h i ( x ) p j ( t ) .
The graph of the exact solution and the approximate solution with level of resolution J = 4 are shown in Figure 6 and Figure 7.
Now, we use the Laplace Haar wavelet method with the same level of resolution ( J = 4 ) . If we follow the same steps as in Example 1, we get the discrete system
i = 1 32 r = 1 32 a i r h i ( x m ) h r ( t n ) = 3 t n 8 4 e + π t n 3 / 2 sinc ( x m ) π + 2 π i = 1 32 r = 1 32 a i r t n 0 1 x h i ( x ) d x 0 1 e t h r ( t ) d t
with x m = m 0.5 32 , t n = n 0.5 32 for n , m = 1 , 2 , 3 , , 32 . We solve the above system to get the approximate solution
u ( x , t ) = j = 1 32 i = 1 32 a i j h i ( x ) h j ( t ) .
The graph of the approximate solution with level of resolution J = 4 is shown in Figure 8 and Figure 9.
One of the advantages of the Laplace Haar wavelet method is that one can easily solve higher order fractional integro-differential equations as explained in the methodology. The following example illustrates this benefit.
Example 3.
Consider the following third fractional order problem
D t 5 / 2 u ( x , t ) = 2 π 5 / 2 6 + π 2 + 12 t sin ( π x ) 0 1 0 1 y e τ u ( y , τ ) d y d τ ,
subject to the initial condition u ( x , 0 ) = 0 . The exact solution is u ( x , t ) = π t 3 sin ( π x ) . We use the Laplace Haar wavelet method at the level of resolution J = 4 . The required discrete system is given by
i = 1 32 r = 1 32 a i r h i ( x m ) h r ( t n ) = 16 15 π 2 6 π 2 t n 5 / 2 + π t n 3 sin ( π x m ) + 8 π 5 π 15 i = 1 32 r = 1 32 a i r t n 5 / 2 p i ( 1 ) 0 1 sin ( π t ) h r ( t ) d t ,
with approximate solution
u ( x , t ) = i = 1 32 r = 1 32 a i r h i ( x m ) h r ( t n ) .
Figure 10 and Figure 11 show the exact and approximate solutions for Equation (15).

5. Quadrature Laplace Haar Wavelet Method

This section is designed to apply LHWM for equations involving functions that have no closed Laplace form like f ( t ) = e t 2 sin ( t ) . We use the convolution theorem for a product of two Laplace transforms. More precisely, if F ( s ) and G ( s ) are the Laplace transforms for f ( t ) and g ( t ) , respectively, then
L 1 [ F ( s ) G ( s ) ] ( t ) = f g ( t ) : = 0 t f ( t τ ) g ( τ ) d τ .
Consider the same equation
D t α u ( x , t ) = f ( x , t ) + 0 1 0 1 k ( x , t , y , τ ) u ( y , τ ) d y d τ
for n 1 < α < n and initial conditions
u ( x , 0 ) = t u ( x , 0 ) = = n 1 t n 1 u ( x , 0 ) = 0 .
Definition 4.
For α > 0 , we define G ( t ) = t α 1 Γ ( α ) for 0 < t < .
Notice that L [ G ( t ) ] ( s ) = 1 s α . This fact will be the key of this section. Take the Laplace transform for both sides of Equation (16), and keep in your mind the initial conditions (17), one obtains
U ( x , s ) = 1 s α F ( x , s ) + 0 1 0 1 1 s α K ( x , s , y , τ ) u ( y , τ ) d y d τ
Now, take the inverse Laplace transform for both sides of Equation (18) and use the convolution theorem, to find that
u ( x , s ) = G f ( x , t ) + 0 1 0 1 G k ( x , t , y , τ ) u ( y , τ ) d y d τ ,
where
G f ( x , t ) = 0 t G ( t w ) f ( x , w ) d w
and
G k ( x , t , y , τ ) = 0 t G ( t w ) k ( x , w , y , τ ) d w
If we use any of the quadrature formulas to estimate these integrals, we obtain the new Fredholm integral equation
u ( x , s ) = f ˜ ( x , t ) + 0 1 0 1 k ˜ ( x , t , y , τ ) u ( y , τ ) d y d τ ,
where
f ˜ ( x , t ) = t M j = 1 M G ( t w j ) f ( x , w j )
and
k ˜ ( x , t , y , τ ) = t M j = 1 M G ( t w j ) k ( x , w j , y , τ )
for w j = t M j . We emphasize that one can take any quadrature formula to estimate the above convolutions. Finally, we discretize Equation (20), for desired resolution J as before, to get the approximate solution
u ( x , t ) i = 1 2 J + 1 j = 1 2 J + 1 a i j h i ( x ) h j ( t ) .
Example 4.
Consider the following higher order fractional integro-differential equation
D t 3 / 2 u ( x , t ) = 3 4 e x π + 4 5 e t 2 sin t + 0 1 0 1 2 e 1 t 2 1 e sin t u ( y , τ ) d y d τ ,
subject to the initial conditions u ( x , 0 ) = t u ( x , 0 ) = 0 . The exact solution is u ( x , t ) = e x t 3 / 2 . We use the Laplace Haar wavelet method at the level of resolution J = 4 . The required discrete system is given by
i = 1 32 r = 1 32 a i r h i ( x m ) h r ( t n ) = f ˜ ( x m , t n ) + i = 1 32 r = 1 32 a i r 0 1 0 1 k ˜ ( x m , t n , y , τ ) h i ( y ) h r ( τ ) d y d τ ,
with approximate solution
u ( x , t ) = i = 1 32 r = 1 32 a i r h i ( x m ) h r ( t n ) .
Figure 12 and Figure 13 show the exact and approximate solutions for Equation (21).

6. Comparison between HWM and LHWM

In this section, we compare the Haar wavelet method and Laplace Haar wavelet method. The Table 2, Table 3, Table 4, Table 5 and Table 6 below show the absolute error in Examples 1–3 in both methods. The tables indicate the accuracy of both methods, whereas the Laplace Haar wavelet method has better approximation. It is worth mentioning that the Laplace wavelet method reduces the computation times significantly (see Table 7).

7. Conclusions

We started our own work by applying the existing method, Haar wavelet method, to solve two-dimensional fractional integro-differential equations. However, we aspire to get better results in less time. As a result, we proposed the Laplace Haar wavelet method to solve these kinds of equations. Applying the Laplace Haar wavelet method was beneficial. It reduced the error and the computational time significantly.
In conclusion, applying the Laplace Haar wavelet method is advantageous in comparison with the Haar wavelet method.

Author Contributions

Formal analysis, investigation, and writing-original draft preparation A.D., M.A., and K.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors would like to thank the editor and the anonymous referees for their in-depth reading and insightful comments on this paper.

Conflicts of Interest

The authors declare that there is no conflict of interests regarding the publication of this manuscript. The authors declare that they have no competing interests.

References

  1. Heil, C.E.; Walnut, D.F. Continuous and discrete wavelet transforms. SIAM Rev. 1989, 31, 628–666. [Google Scholar] [CrossRef] [Green Version]
  2. Daubechies, I. Ten Lectures on Wavelets; SIAM: Philadelphia, PA, USA, 1992; Volume 61. [Google Scholar]
  3. Kyed, M. Square Integrable Representations and the Continuous Wavelet Transformation. Ph.D. Thesis, Aarhus University, Aarhus, Denmark, 1999. [Google Scholar]
  4. Babolian, E.; Shahsavaran, A. Numerical solution of nonlinear Fredholm integral equations of the second kind using Haar wavelets. J. Comput. Appl. Math. 2009, 225, 87–95. [Google Scholar] [CrossRef] [Green Version]
  5. Lepik, Ü. Solving fractional integral equations by the Haar wavelet method. Appl. Math. Comput. 2009, 214, 468–478. [Google Scholar] [CrossRef]
  6. Aziz, I.; Fayyaz, M. A new approach for numerical solution of integro-differential equations via Haar wavelets. Int. J. Comput. Math. 2013, 90, 1971–1989. [Google Scholar]
  7. Aziz, I. New algorithms for the numerical solution of nonlinear Fredholm and Volterra integral equations using Haar wavelets. J. Comput. Appl. Math. 2013, 239, 333–345. [Google Scholar] [CrossRef]
  8. Ur Rehman, M.; Khan, R.A. The Legendre wavelet method for solving fractional differential equations. Commun. Nonlinear Sci. Numer. Simul. 2011, 16, 4163–4173. [Google Scholar] [CrossRef]
  9. Pedas, A.; Tamme, E. Spline collocation methods for linear multi-term fractional differential equations. J. Comput. Appl. Math. 2011, 236, 167–176. [Google Scholar] [CrossRef] [Green Version]
  10. Cattani, C. Shannon wavelets for the solution of integrodifferential equations. Math. Probl. Eng. 2010, 2010. [Google Scholar] [CrossRef] [Green Version]
  11. Diethelm, K.; Ford, N.J. Analysis of fractional differential equations. J. Math. Anal. Appl. 2002, 265, 229–248. [Google Scholar] [CrossRef] [Green Version]
  12. Boggess, A.; Narcowich, F.J. A First, Course in Wavelets with Fourier Analysis; John Wiley & Sons: Hoboken, NJ, USA, 2015. [Google Scholar]
  13. Ishteva, M.; Boyadjiev, L.; Scherer, R. On the Caputo operator of fractional calculus and C-Laguerre functions. Math. Sci. Res. J. 2005, 9, 161. [Google Scholar]
  14. Richard, H. Fractional Calculus: An Introduction for Physicists; World Scientific: Singapore, 2014. [Google Scholar]
  15. Caputo, M. Linear models of dissipation whose Q is almost frequency independent—II. Geophys. J. Int. 1967, 13, 529–539. [Google Scholar] [CrossRef]
  16. Kexue, L.; Jigen, P. Laplace transform and fractional differential equations. Appl. Math. Lett. 2011, 24, 2019–2023. [Google Scholar] [CrossRef] [Green Version]
Figure 1. The exact solution for Example 1.
Figure 1. The exact solution for Example 1.
Algorithms 13 00037 g001
Figure 2. The approximate solution for Example 1 at J = 2 (to the left) and at J = 4 (to the right) using HWM.
Figure 2. The approximate solution for Example 1 at J = 2 (to the left) and at J = 4 (to the right) using HWM.
Algorithms 13 00037 g002
Figure 3. The approximate solution (blue) and the exact solution (red) for Example 1 at J = 2 , t = 0.046875 (to the left) and at J = 4 , t = 0.046875 (to the right) using HWM.
Figure 3. The approximate solution (blue) and the exact solution (red) for Example 1 at J = 2 , t = 0.046875 (to the left) and at J = 4 , t = 0.046875 (to the right) using HWM.
Algorithms 13 00037 g003
Figure 4. The approximate solution for Example 1 with level of resolution J = 4 using LHWM.
Figure 4. The approximate solution for Example 1 with level of resolution J = 4 using LHWM.
Algorithms 13 00037 g004
Figure 5. The approximate solution (blue) and the exact solution (red) for Example 1 with level of resolution J = 4 and t = 0.5 using LHWM.
Figure 5. The approximate solution (blue) and the exact solution (red) for Example 1 with level of resolution J = 4 and t = 0.5 using LHWM.
Algorithms 13 00037 g005
Figure 6. The exact solution (to the left) and the approximate solution (to the right) at J = 4 for Example 2.
Figure 6. The exact solution (to the left) and the approximate solution (to the right) at J = 4 for Example 2.
Algorithms 13 00037 g006
Figure 7. The approximate solution (blue) and the exact solution (red) for Example 2 with level of resolution J = 4 and t = t 8 using HWM.
Figure 7. The approximate solution (blue) and the exact solution (red) for Example 2 with level of resolution J = 4 and t = t 8 using HWM.
Algorithms 13 00037 g007
Figure 8. The approximate solution for Example 2 with level of resolution J = 4 using LHWM.
Figure 8. The approximate solution for Example 2 with level of resolution J = 4 using LHWM.
Algorithms 13 00037 g008
Figure 9. The approximate solution (blue) and the exact solution (red) for Example 2 with level of resolution J = 4 and t = t 8 using LHWM.
Figure 9. The approximate solution (blue) and the exact solution (red) for Example 2 with level of resolution J = 4 and t = t 8 using LHWM.
Algorithms 13 00037 g009
Figure 10. The exact (to the left) and the approximate (to the right) solutions for Example 3 with J = 4 using LHWM.
Figure 10. The exact (to the left) and the approximate (to the right) solutions for Example 3 with J = 4 using LHWM.
Algorithms 13 00037 g010
Figure 11. The approximate solution (blue) and the exact solution (red) for Example 3 with level of resolution J = 4 and t = t 8 using LHWM.
Figure 11. The approximate solution (blue) and the exact solution (red) for Example 3 with level of resolution J = 4 and t = t 8 using LHWM.
Algorithms 13 00037 g011
Figure 12. The exact (to the left) and the approximate (to the right) solutions for Example 4 with J = 4 using LHWM.
Figure 12. The exact (to the left) and the approximate (to the right) solutions for Example 4 with J = 4 using LHWM.
Algorithms 13 00037 g012
Figure 13. The approximate solution (blue) and the exact solution (red) for Example 4 with level of resolution J = 4 and t = t 2 using LHWM.
Figure 13. The approximate solution (blue) and the exact solution (red) for Example 4 with level of resolution J = 4 and t = t 2 using LHWM.
Algorithms 13 00037 g013
Table 1. Index computations for Haar basis function at J = 3 .
Table 1. Index computations for Haar basis function at J = 3 .
j011222233333...3
k001012301234...7
i = 2 j + k + 1 2345678910111213...16
Table 2. Exact, approximate, and absolute error for different values of x m and t n in Example 1 with resolution J = 4 using HWM.
Table 2. Exact, approximate, and absolute error for different values of x m and t n in Example 1 with resolution J = 4 using HWM.
x m t n Exact ValueApproximate ValueAbsolute Error
0.015625 0.1269680.09971922.72493 × 10 2
0.109375 0.1394480.109522.99273 × 10 2
0.2343750.0156250.1580150.1241033.39119 × 10 2
0.484375 0.2028950.1593524.35433 × 10 2
0.734375 0.2605220.2028965.59102 × 10 2
0.984375 0.3345170.2627287.17897 × 10 2
0.015625 0.3359270.3361672.39687 × 10 4
0.109375 0.3689440.3692092.65744 × 10 4
0.2343750.1093750.4180680.4183723.04514 × 10 4
0.484375 0.536810.5372083.98226 × 10 4
0.734375 0.6892770.6897965.18554 × 10 4
0.984375 0.885050.8857236.73059 × 10 4
0.015625 0.4917470.491677.68371 × 10 5
0.109375 0.5400780.5400027.65043 × 10 5
0.2343750.2343750.6119890.6119137.60092 × 10 5
0.484375 0.7858090.7857347.48123 × 10 5
0.734375 1.0091.008937.32756 × 10 5
0.984375 1.295581.295517.13023 × 10 5
0.015625 0.706930.7066922.38435 × 10 4
0.109375 0.7764110.7761732.38395 × 10 4
0.2343750.4843750.8797890.8795512.38335 × 10 4
0.484375 1.129671.129432.38189 × 10 4
0.734375 1.450531.450292.38002 × 10 4
0.984375 1.862511.862282.37762 × 10 4
0.015625 1.007781.007096.92453 × 10 4
0.109375 1.106831.106146.92446 × 10 4
0.2343750.9843751.25421.253516.92437 × 10 4
0.484375 1.610431.609746.92415 × 10 4
0.734375 2.067832.067146.92386 × 10 4
0.984375 2.655152.654466.92349 × 10 4
Table 3. Exact, approximate, and absolute error for different values of x m and t n in Example 1 with resolution J = 4 using LHWM.
Table 3. Exact, approximate, and absolute error for different values of x m and t n in Example 1 with resolution J = 4 using LHWM.
x m t n Exact ValueApproximate ValueAbsolute Error
0.015625 0.1269680.126971.04314 × 10 6
0.109375 0.1394480.1394491.04314 × 10 6
0.2343750.0156250.1580150.1580161.04314 × 10 6
0.484375 0.2028950.2028961.04314 × 10 6
0.734375 0.2605220.2605231.04314 × 10 6
0.984375 0.3345170.3345181.04314 × 10 6
0.015625 0.3359270.3359461.93192 × 10 5
0.109375 0.3689440.3689631.93192 × 10 5
0.2343750.1093750.4180680.4180871.93192 × 10 5
0.484375 0.536810.5368291.93192 × 10 5
0.734375 0.6892770.6892971.93192 × 10 5
0.984375 0.885050.8850691.93192 × 10 5
0.015625 0.4917470.4918076.06008 × 10 5
0.109375 0.5400780.5401396.06008 × 10 5
0.2343750.2343750.6119890.6120496.06008 × 10 5
0.484375 0.7858090.785876.06008 × 10 5
0.734375 1.0091.009066.06008 × 10 5
0.984375 1.295581.295646.06008 × 10 5
0.015625 0.706930.7071111.80046 × 10 4
0.109375 0.7764110.7765911.80046 × 10 4
0.2343750.4843750.8797890.8799691.80046 × 10 4
0.484375 1.129671.129851.80046 × 10 4
0.734375 1.450531.450711.80046 × 10 4
0.984375 1.862511.862691.80046 × 10 4
0.015625 1.007781.00835.21618 × 10 4
0.109375 1.106831.107355.21618 × 10 4
0.2343750.9843751.25421.254735.21618 × 10 4
0.484375 1.610431.610955.21618 × 10 4
0.734375 2.067832.068355.21618 × 10 4
0.984375 2.655152.655675.21618 × 10 4
Table 4. Exact, approximate, and absolute error for different values of x m and t n in Example 2 with resolution J = 4 using HWM.
Table 4. Exact, approximate, and absolute error for different values of x m and t n in Example 2 with resolution J = 4 using HWM.
x m t n Exact ValueApproximate ValueAbsolute Error
0.015625 0.001297660.001903966.06298 × 10 4
0.109375 0.001272790.001870795.98006 × 10 4
0.234375 0.001184020.001752445.68417 × 10 4
0.3593750.0156250.001039450.001559675.20225 × 10 4
0.484375 0.0008520820.001309854.57771 × 10 4
0.734375 0.0004169250.0007296433.12718 × 10 4
0.984375 0.00002059780.0002012071.80609 × 10 4
0.015625 0.06358550.06318893.96607 × 10 4
0.109375 0.06236660.06198893.77777 × 10 4
0.234375 0.0580170.05770643.10578 × 10 4
0.3593750.1093750.05093280.05073172.01132 × 10 4
0.484375 0.0417520.04169275.92945 × 10 4
0.734375 0.02042930.02069952.70127 × 10 4
0.984375 0.001009290.001579455.70154 × 10 4
0.015625 0.2919740.2911258.49444 × 10 4
0.109375 0.2863770.2855618.16738 × 10 4
0.234375 0.2664050.2657057.00023 × 10 4
0.3593750.2343750.2338750.2333655.0993 × 10 4
0.484375 0.1917180.1914552.63576 × 10 4
0.734375 0.09380810.09411673.08585 × 10 4
0.984375 0.004634510.00546428.29692 × 10 4
0.015625 1.247051.24561.45855 × 10 3
0.109375 1.223151.221741.40698 × 10 3
0.234375 1.137841.136621.22295 × 10 3
0.3593750.4843750.9989070.9979849.23228 × 10 4
0.484375 0.818850.8183165.34797 × 10 4
0.734375 0.4006650.4010323.67342 × 10 4
0.984375 0.01979450.02098351.18898 × 10 3
0.015625 5.150425.148132.29639 × 10 3
0.109375 5.05175.049482.21871 × 10 3
0.234375 4.699384.697441.94151 × 10 3
0.3593750.9843754.125564.124071.49005 × 10 3
0.484375 3.381913.381019.04961 × 10 4
0.734375 1.654781.655234.53913 × 10 4
0.984375 0.08175270.08344431.69153 × 10 3
Table 5. Exact, approximate, and absolute error for different values of x m and t n in Example 2 with resolution J = 4 using LHWM.
Table 5. Exact, approximate, and absolute error for different values of x m and t n in Example 2 with resolution J = 4 using LHWM.
x m t n Exact ValueApproximate ValueAbsolute Error
0.015625 0.001297660.001301734.06726 × 10 6
0.109375 0.001272790.001276864.06726 × 10 6
0.234375 0.001184020.001188094.06726 × 10 6
0.3593750.0156250.001039450.001043514.06726 × 10 6
0.484375 0.0008520820.0008561494.06726 × 10 6
0.734375 0.0004169250.0004209924.06726 × 10 6
0.984375 0.00002059780.0002466514.06726 × 10 6
0.015625 0.06358550.06359621.0761 × 10 5
0.109375 0.06236660.06237741.0761 × 10 5
0.234375 0.0580170.05802781.0761 × 10 5
0.3593750.1093750.05093280.05094361.0761 × 10 5
0.484375 0.0417520.04176281.0761 × 10 5
0.734375 0.02042930.02044011.0761 × 10 5
0.984375 0.001009290.001020051.0761 × 10 5
0.015625 0.2919740.291991.57524 × 10 5
0.109375 0.2863770.2863931.57524 × 10 5
0.234375 0.2664050.266421.57524 × 10 5
0.3593750.2343750.2338750.2338911.57524 × 10 5
0.484375 0.1917180.1917341.57524 × 10 5
0.734375 0.09380810.09382391.57524 × 10 5
0.984375 0.004634510.004650261.57524 × 10 5
0.015625 1.247051.247082.26455 × 10 5
0.109375 1.223151.223172.26455 × 10 5
0.234375 1.137841.137872.26455 × 10 5
0.3593750.4843750.9989070.998932.26455 × 10 5
0.484375 0.818850.8188732.26455 × 10 5
0.734375 0.4006650.4006882.26455 × 10 5
0.984375 0.01979450.01981722.26455 × 10 5
0.015625 5.150425.150463.22829 × 10 5
0.109375 5.05175.051733.22829 × 10 5
0.234375 4.699384.699413.22829 × 10 5
0.3593750.9843754.125564.125593.22829 × 10 5
0.484375 3.381913.381943.22829 × 10 5
0.734375 1.654781.654813.22829 × 10 5
0.984375 0.08175270.0817853.22829 × 10 5
Table 6. Exact, approximate, and absolute error for different values of x m and t n in Example 3 with resolution J = 4 using HWM.
Table 6. Exact, approximate, and absolute error for different values of x m and t n in Example 3 with resolution J = 4 using HWM.
x m t n Exact ValueApproximate ValueAbsolute Error
0.015625 3.31765 × 10 7 3.02178 × 10 7 2.95868 × 10 8
0.046875 9.921 × 10 7 9.62513 × 10 7 2.95868 × 10 8
0.109375 2.27784 × 10 6 2.24825 × 10 6 2.95868 × 10 8
0.2343750.0156254.54066 × 10 6 4.51108 × 10 6 2.95868 × 10 8
0.359375 6.11221 × 10 6 6.08262 × 10 6 2.95868 × 10 8
0.484375 6.75323 × 10 6 6.72364 × 10 6 2.95868 × 10 8
0.734375 5.00985 × 10 6 4.98026 × 10 6 2.95868 × 10 8
0.984375 3.31765 × 10 7 3.02178 × 10 7 2.95868 × 10 8
0.015625 0.0001137950.000109963.83569 × 10 6
0.046875 0.000340290.0003364553.83569 × 10 6
0.109375 0.0007812990.0007774633.83569 × 10 6
0.2343750.1093750.001557450.001553613.83569 × 10 6
0.359375 0.002096490.002092653.83569 × 10 6
0.484375 0.002316360.002312523.83569 × 10 6
0.734375 0.001718380.001714543.83569 × 10 6
0.984375 0.0001137950.000109963.83569 × 10 6
0.015625 0.001119710.001093922.57826 × 10 5
0.046875 0.003348340.003322552.57826 × 10 5
0.109375 0.007687710.007661922.57826 × 10 5
0.2343750.2343750.01532470.0152992.57826 × 10 5
0.359375 0.02062870.02060292.57826 × 10 5
0.484375 0.02279220.02276642.57826 × 10 5
0.734375 0.01690820.01688252.57826 × 10 5
0.984375 0.001119710.001093922.57826 × 10 5
0.015625 0.009883610.00972531.58308 × 10 4
0.046875 0.02955560.02939731.58308 × 10 4
0.109375 0.06785910.06770081.58308 × 10 4
0.2343750.4843750.1352710.1351131.58308 × 10 4
0.359375 0.1820890.1819311.58308 × 10 4
0.484375 0.2011850.2010271.58308 × 10 4
0.734375 0.1492480.149091.58308 × 10 4
0.984375 0.009883610.00972531.58308 × 10 4
0.015625 0.08295680.08202489.32073 × 10 4
0.046875 0.2480720.2471399.32073 × 10 4
0.109375 0.5695670.5686359.32073 × 10 4
0.2343750.9843751.135381.134459.32073 × 10 4
0.359375 1.528341.527419.32073 × 10 4
0.484375 1.688631.687699.32073 × 10 4
0.734375 1.25271.251779.32073 × 10 4
0.984375 0.08295680.08202489.32073 × 10 4
Table 7. Comparison between HWM and LHWM.
Table 7. Comparison between HWM and LHWM.
Example(1) Using HWM Example(1) Using LHWM Example(2) Using HWM Example(2) Using LHWM
Computations time using Mathematica 11, at J = 224 min 3 min 28 min 3.5 min
Computations time using Mathematica 11, at J = 43 h and 20 min 10 min 4 h and 35 min 12 min
Erorr range at J = 410 4 –10 2 10 6 –10 4 10 4 –10 3 10 6 –10 5

Share and Cite

MDPI and ACS Style

Darweesh, A.; Alquran, M.; Aghzawi, K. New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations. Algorithms 2020, 13, 37. https://doi.org/10.3390/a13020037

AMA Style

Darweesh A, Alquran M, Aghzawi K. New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations. Algorithms. 2020; 13(2):37. https://doi.org/10.3390/a13020037

Chicago/Turabian Style

Darweesh, Amer, Marwan Alquran, and Khawla Aghzawi. 2020. "New Numerical Treatment for a Family of Two-Dimensional Fractional Fredholm Integro-Differential Equations" Algorithms 13, no. 2: 37. https://doi.org/10.3390/a13020037

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