Next Article in Journal
Detection of Short-Section Ballast Breakdown in Track: A Fractal Analysis Approach with Reduced Window Size
Next Article in Special Issue
Fractional-Calculus Analysis of the Dynamics of a Vector-Borne Infection with Preventive Measures
Previous Article in Journal
Observer-Based Prescribed Performance Adaptive Neural Network Tracking Control for Fractional-Order Nonlinear Multiple-Input Multiple-Output Systems Under Asymmetric Full-State Constraints
Previous Article in Special Issue
First Derivative Approximations and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Computational Method for Solving Nonlinear Fractional Integral Equations

1
Mathematics Department, Faculty of Sciences, Umm Al-Qura University, Makkah 24382, Saudi Arabia
2
Department of Mathematics, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
3
Department of Mathematics & Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
4
Department of Mathematics, Faculty of Education, Alexandria University, Alexandria 21526, Egypt
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(11), 663; https://doi.org/10.3390/fractalfract8110663
Submission received: 22 September 2024 / Revised: 8 November 2024 / Accepted: 11 November 2024 / Published: 14 November 2024
(This article belongs to the Special Issue Advances in Fractional Modeling and Computation)

Abstract

:
This article solves the nonlinear fractional integral equation (NFrIE) using the Genocchi polynomial method (GPM). We have provided proof to demonstrate the existence of a unique solution to the second sort of NFrIE in Hilbert space. The proof of the stability of the error has been described and discussed. These criteria are proven given the spectrum characteristics of a linear self-adjoint operator. Numerous applications, unique conditions, and specific situations are developed. Additionally, numerical examples are constructed to illustrate the efficiency and applicability of the method. Maple 18 software is utilized for the computation of all the numerical outcomes.

1. Introduction

The vast array of applications in pure and applied mathematics, including in physics, fluid mechanics, electrodynamics, nonlinear biological systems, and other scientific and engineering domains, has drawn the interest of numerous researchers in fractional differential (FD) and integral equations (IEs) in recent years. Many different numerical methods have been proposed for solving FD and IEs in recent years. In [1], Hamdan et al. used Haar Wavelet for solving Volterra FIE. In [2], Pu and Fasondini presented Jacobi polynomials to obtain the solution of NFrIE. Bekkouche et al. in [3] introduced the solution to the fractional boundary value problem by using the trapezoidal rule. In [4], Mahdy et al. applied least squares and shifted Legendre methods for solving NFrIE. Alsulaiman et al. [5] used the Bernoulli matrix approach to solve NrIE. In [6], Alharbi et al. used the Haar Wavelet technique to solve FDEs. Mohamed et al., in [7], presented Chebyshev polynomials of the sixth kind for solving fractional mixed nonlinear partial integro-differential problems. Lagrange interpolation was utilized by Zabidiet al. in [8] to solve FDEs. In [9], Yi et al. developed a time-stepping algorithm for solving FDEs. Also, NFrDEs and their applications have been considered in many articles; for example, in [10], Jassim and Hussein presented the Hussein method for solving NFrDEs. In [11], Mohamed et al., the Elzaki transform method and the Homotopy perturbation method were used for solving NFrDEs. Rashid et al. [12], studied the solution of NFrDEs via fixed point theory. Lydia et al. [13] used the Kharrat–Toma iterative method to obtain the solution of NFrDEs. In [14], Yu presented Jumarie-modified Riemann–Liouville fractional calculus for solving NFrDEs.
In the present paper, GPM is applied to solve NFrIE, where GPM converts the problem to a system of algebraic equations that can be solved using numerical techniques. Finally, to demonstrate the applicability and validity of the method, we examine some numerical examples. The GPM is not based on orthogonal functions but belongs to a larger family class of polynomials: the Appell polynomial family. The advantage of GPM is its simplicity, and this method often leads to linear systems, which can be solved using numerical techniques, thus reducing computational costs and improving efficiency. However, the choice of collocation points plays an important role in obtaining accurate results. There are many applications of GPM; for example, in [15], GPM was applied for solving fractional partial integro-differential equations. In [16], GPM was used for solving fractional weakly singular IE. In [17], GPM was introduced to obtain the solution of FIDE. GPM was applied to find the solution of nonlinear Volterra integral equations with weakly singular kernels in [18]. Using the GPM matrix approach, Volterra IEs were solved in [19]. Heydari and Zhagharian [20] used GPM to obtain the solution of fractional Fornberg–Whitham equations. Loh et al. [21] presented the solution of Fredholm–Volterra fractional integro-differential equations via GPM. In [22], Seghiri et al. used GPM to obtain the solution of high-order Fredholm integro-differential equations. In [23], Mustapha used GPM for solving integro-differential equations. In [24], Isah and Phang applied GPM to obtain the solution of NFrDEs.
In this paper’s remaining sections are the following. In Section 2, we present some preliminaries and basic information about Riemann –Liouville fractional integrals and Caputo fractional derivatives. In Section 3, applications and special cases of NFrDE are discussed. The existence and uniqueness of the solutions are discussed in Section 4. In Section 5, we studied the stability of error. In Section 6, the Genocchi polynomial method is applied for solving NFrDEs of the second kind. To explain the method in all instances of the error estimated using Maple 18, Section 7 offers a few numerical examples. Finally, a Discussion of the results is presented in Section 8.
In the Hilbert space L 2 ( 0 , a ] , consider the second type of NFrDE:
d α d t α [ T φ ( t ) μ φ ( t ) ] M ( t ) γ ( t , φ ( t ) ) = f ( t ) , ( T φ ( 0 ) = μ φ ( 0 ) ) , ( 0 < α < 1 , t ( 0 , a ] ) .
Here, T : H H is a linear self-adjoint operator in the Hilbert space, φ : R + H is an unknown function, γ ( t , φ ( t ) ) is a known function; μ is a constant, may be complex, and has many physical meanings, and M , f : R + H are given functions.
In this article, the convergence and the uniqueness of the solution of Equation (1) will be proved under certain relations. One can deduce several special situations and reach novel outcomes. Error estimate computation is carried out while also taking error stability into account.
The reader is referred to [25] and [26] for the existence of theorems about the FrDE. For reader reference, we direct them to [27] and [28] for descriptions of FI and its derivatives with fundamental characteristics.

2. Preliminaries and Basic Information

The following definitions and characteristics are provided for the reader’s convenience.
Definition 1.
The Riemann–Liouville (RL) of order α > 0 of a function h : ( 0 , ) R is presented by
I 0 + α h ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 h ( s ) d s .
 under the condition that the R.H.S. is point-wise established on ( 0 , ) .
Definition 2.
The Caputo fractional derivatives of order α > 0 of a function g : ( 0 , ) R provide
D 0 + α g ( t ) = 1 Γ ( n α ) 0 t g ( n ) ( s ) ( t s ) α n + 1 d s .
For the NFrDE (1) after integrating and using RL (2), we have
T φ ( t ) μ φ ( t ) 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , φ ( s ) ) d s = F ( t ) , t ( 0 , a ] ,
F ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 f ( s ) d s .
Formula (4) represents an NFrIE of the second kind.
Definition 3.
We say that f N α ( R + , N ) , α > 0 if f : R + H is continuous on the half line t 0 ,   f ( 0 ) = 0 and
f α = sup t > 0 ( t α f H ) ,
f L 2 ( 0 , a ) = { 0 a f 2 ( t ) d t } 1 2 .
Lemma 1
(Without proof [29]). In L 2 ( [ 0 , a ] ) space, the self-adjoint compact operator K ϕ may be expressed as follows; K ϕ n = ρ n ϕ n , n > 0 , where the eigenvalues and eigenfunctions are denoted by ρ n and ϕ n , respectively.

3. Applications and Special Cases

Many applications and special cases can be derived from Equation (1) and its corresponding Equation (4).
First application: The following IE is taken into consideration as a significant application in the Hilbert space L 2 ( 0 , a ] .
0 t G ( α , t , s ) γ ( s , φ ( s ) ) d s + 0 a k ( t , z ) φ ( z ) d z μ φ ( t ) = f ( t ) ,
with
G ( α , t , s ) = 1 Γ ( α ) ( t s ) α 1 M ( s ) , 0 < z a , t ( 0 , a ] .
The equation in Formula (5) is referred to as an IE of the second kind when μ = constant 0 , but it is termed the nonlinear Fredholm Volterra IE of the first kind when μ = 0 .
In the contact problem and creep theory, the IE (5) emerges in the nonlinear situation γ ( t , φ ( t ) ) or the linear status where γ ( t , φ ( t ) ) = φ ( t ) . Some elastic material bases are related to the kernels G ( t , s ) , k ( t , z ) of Fredholm integral terms and Volterra integral terms, respectively. The deformation body’s elastic characteristics are described by the value μ . The function f ( t ) describes this body. Further details about the physical interpretation of Equation (5) and its applications, involving various techniques for solutions, are available in [29].
Second application: The Boltzmann fractional equation
G ( t ) φ ( t ) + α t α ( 0 1 k ( t , z ) φ ( z ) d z μ φ ( t ) ) = 0 ,
is derived at γ ( t , φ ( t ) ) = φ ( t ) , f ( t ) = 0 .
Many applications can be derived from Equation (6) in astrophysics, quantum mechanics, and laser theory.
If the operator T is differentiable, for example, then
[ d d t μ ] φ ( t ) I 0 + α M ( t ) γ ( t , φ ( t ) ) = f ( t ) ,
it represents an integro-differential equation of the first order and second kind.
Many special topics can be derived from the principal equation if the operator T is differentiable.

4. Existence and Uniqueness Solution

We shall demonstrate in this section that, under specific circumstances, there exists a unique solution to Equation (1).
The following presumptions are what we established for this goal:
(i)
M ( s ) has a continuous function on R + and fulfills
A ( t ) = sup 0 s t M ( s ) < , t ( 0 , a ] .
(ii)
Characterize σ ( T ) to represent the spectrum of the self-adjoint compact operator T and . t = sup 0 s t . .
(iii)
Suppose that the interval ( 0 , a ] contains a bounded function f ( t ) .
(iv)
The established function γ ( t , φ ( t ) ) fulfills
(iv-a)
γ ( t , φ ( t ) ) t F 1 φ ( t ) t ; .
(iv-b)
γ ( t , φ 1 ( t ) ) γ ( t , φ 2 ( t ) ) t F 2 φ 1 ( t ) φ 2 ( t ) t , where F 1 and F 2 are constants with F > F 1 and F > F 2 .
We investigated the existence of a unique solution for NFrIE (1), so we considered
Ψ ( t ) = ( T μ I ) φ ( t ) ,
where I is a unit matrix.
Here, the resolvent, R μ = ( T μ I ) 1 , of T exists. Furthermore, the resolvent has bounds for any μ T ( t ) , and the norm is defined by
N ( t ) = sup μ T ( t ) R μ .
Theorem 1.
The NFrIE (1) has a convergence and unique solution according to the status
F N ( t ) A ( t ) t α < Γ ( α + 1 ) , F > F 2 .
Furthermore, the norm of the solution to (1) is provided as
φ ( t ) H Γ ( α + 1 ) A ( t ) f t [ Γ ( α + 1 ) F N ( t ) A ( t ) t α ] .
Proof. 
First, to prove the convergence of Equation (1), assume that
d α d t α [ T μ I ] φ ( t ) = f ( t ) + M ( t ) γ ( t , φ ( t ) ) ,
and assume that
[ T μ I ] φ ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , φ ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 f ( s ) d s .
Let
( T μ I ) φ ( t ) = ζ ( t ) .
Hence, we can rewrite Equation (1) in the form
ζ ( t ) 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ ( s ) ) d s = F ( t ) , F ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 f ( s ) d s .
Write Equation (12) in the integral operator form
ζ n ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ n 1 ( s ) ) d s + F ( t ) ,
ζ n 1 ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ n 2 ( s ) ) d s + F ( t ) .
Then,
ζ n ( t ) ζ n 1 ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) { γ ( s , R μ ζ n 1 ( s ) ) γ ( s , R μ ζ n 2 ( s ) ) } d s .
Let
ψ n = ζ n ( t ) ζ n 1 ( t ) ζ n ( t ) = i = 0 n ψ i , ψ 0 = ζ 0 ( t ) = F ( t ) .
Hence, we obtain
ψ n = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) { γ ( s , R μ ζ n 1 ( s ) ) γ ( s , R μ ζ n 2 ( s ) ) } d s F 2 N ( t ) A ( t ) t α α Γ ( α ) ψ n 1 ,
where N ( t ) is given by Equation (9).
Hence, we obtain
ψ n F 2 N ( t ) A ( t ) t α α Γ ( α ) ψ n 1 .
Applying the Picard technique, followed by the conditions (i)–(v-a), Formula (15) produces
ψ n H ( ρ ) n F ( t ) , ρ = ( F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) .
This constraint causes the series { ψ n } to converge under condition (9), allowing us to write
ζ ( t ) H = n = 0 ψ n ( t ) H n = 0 F ( ρ ) n = F ( 1 ρ ) 1 , ρ < 1 .
The above inequality (17) is convergent under the condition (10). In addition, this sequence represents the general solution as n . Hence, the convergence of the solution is proved. □
Second, to prove the uniqueness of the solution, we can write Equation (12) in the integral operator form
ζ ( t ) = K ζ ( t ) = L ζ ( t ) + F ( t ) ,
where
L ζ ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ ( s ) ) d s .
Then, we must prove the following two lemmas.
Lemma 2.
The integral operator K ζ ( t ) , under the conditions (i)–(iv-a) maps the space H into itself.
Proof. 
From (19), we can write
L ζ ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ ( s ) ) d s .
After using the Cauchy–Schwartz inequality and conditions (i)–(iv-a), we obtain
L ζ ( t ) ρ ζ ( t ) , ρ = ( F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) .
From inequality (20), we deduce that the integral operator L ζ ( t ) is bounded.
After writing (18) in the norm form, and using inequality (20), we obtain
K ζ ( t ) ρ ζ ( t ) + F ( t ) .
Inequality (21) shows that the operator K maps the ball S σ into itself where the radius of the sphere σ = F ( t ) 1 ρ > 0 . Hence, we have
ρ = ( F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) < 1 .
Lemma 3.
The integral operator K ζ ( t ) under the conditions (i)–(ivb) is continuous.
Proof. 
Assuming ζ 1 ( t ) and ζ 2 ( t ) have two distinct solutions for Equation (12) in the Hilbert space, the continuity of the solution may be investigated. Thus, we can obtain
K ( ζ 1 ζ 2 ) ( t ) = 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) { γ ( s , R μ ζ 1 ( s ) ) γ ( s , R μ ζ 2 ( s ) ) } d s .
After applying the Cauchy–Schwartz inequality and using conditions (i)–(iv-b), we have
K ( ζ 1 ζ 2 ) ( t ) ρ ( ζ 1 ζ 2 ) ( t ) .
Hence, the integral operator K is continuous and, by extension, the integral operator L is also continuous. Moreover, since ρ < 1 , then the integral operator K is a contraction mapping. □

5. The Stability of Error

To discuss the stability of error, assume we have a numerical solution in the form
ζ n ( t ) 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) γ ( s , R μ ζ n ( s ) ) d s = F n ( t ) .
Then, we have
R n ( t ) 1 Γ ( α ) 0 t ( t s ) α 1 M ( s ) [ γ ( s , R μ ζ ( s ) ) γ ( s , R μ ζ n ( s ) ) ] d s = H n ( t ) ,
where
R n ( t ) = ζ ( t ) ζ n ( t ) , H n ( t ) = F ( t ) F n ( t ) .
The above formula can be adapted, after applying the conditions (i–iii) and (iv-b) to take the form
R n ( t ) ( F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) R n ( t )   +   H n ( t ) .
The above inequality can be adapted in the form
R n ( t ) H n ( t ) ( 1 F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) = σ .
Inequality (25) shows that the operator R maps the ball S σ in the Hilbert space into itself. The radius of the sphere is
σ = H n ( t ) ( 1 F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) .
Since σ > 0 , H n ( t ) > 0 , then F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) < 1 .
Hence, the error R n ( t ) is bounded and stable according to the status F 2 M ( t ) A ( t ) t α < Γ ( α + 1 ) .
Furthermore, for the continuity of the error, it is not difficult to prove that for the two functions of error R n 1 , R n 2 , we have
R n 1 ( t ) R n 2 ( t ) ( F 2 N ( t ) A ( t ) t α Γ ( α + 1 ) ) R n 1 ( t ) R n 2 ( t ) .
The above inequality describes the continuity of the error. Moreover, the operator of error is a contraction according to the status F 2 N ( t ) A ( t ) t α < Γ ( α + 1 ) , so the error has a unique representation.

6. Genocchi Polynomial Method

6.1. Properties of Genocchi Polynomials

The Genocchi numbers G n and Genocchi polynomials (GPs) G n ( t ) are often described using the formulas for exponential generating S ( ξ ) and S ( ξ , t ) , respectively, as follows:
S ( ξ ) = 2 ξ e ξ + 1 = q = 0 G q ξ q q ! , ( ξ < π ) ,
S ( ξ , t ) = 2 ξ e ξ t e ξ + 1 = q = 0 G q ( t ) ξ q q ! , ( ξ < π ) ,
where G q ( t ) is GPs of order q. Also, GPs can be determined as follows:
G q ( t ) = k = 0 q q k G q k t k = 2 B q ( t ) 2 q + 1 B q ( t ) ,
and the following relationship yields the Genocchi number G q k :
G q = 2 ( 1 2 q ) B q ,
where B q is the famous Bernoulli number and B q ( t ) is Bernoulli polynomials.
The generating function for the Bernoulli numbers is
x e x 1 = n = 0 B n n ! x n = B 0 + x B 1 + x 2 2 ! B 2 + + x n n ! B n + .
Bernoulli numbers are defined as follows:
B n = k = 0 n 1 1 + k j = 0 k ( 1 ) j k j j n , k j = k ! j ! ( k j ) ! ,
B n + = k = 0 n 1 1 + k j = 0 k ( 1 ) j k j ( j + 1 ) n ,
B m = 1 k = 0 m 1 m k B k m k + 1 , B 0 = 1 .
The Bernoulli polynomials are defined by the generating function
G ( x , t ) = x e x t e x 1 = n = 0 x n n ! B n ( t ) .
The first few Bernoulli polynomials are defined as
B 0 ( t ) = 1 , B 1 ( t ) = t 1 2 , B 2 ( t ) = t 2 t + 1 6 , B 3 ( t ) = t 3 3 2 t 2 + 1 2 t ,
B 4 ( t ) = t 4 2 t 3 + t 2 1 30 , B 5 ( t ) = t 5 5 2 t 4 + 5 3 t 3 1 6 t .
The initial group of GPs are listed as follows:
G 0 ( ξ ) = 0 , G 1 ( ξ ) = 1 , G 2 ( ξ ) = 2 ξ 1 , G 3 ( ξ ) = 3 ξ 2 3 ξ , G 4 ( ξ ) = 4 ξ 3 6 ξ 2 + 1 , G 5 ( ξ ) = 5 ξ 4 10 ξ 3 + 5 ξ .
Moreover,
0 1 G p ( t ) G q ( t ) d t = 2 ( 1 ) p p ! q ! ( p + q ) ! G p + q , p , q 1 ,
d G p ( t ) d t = p G p 1 , p 1 ,
G p ( 1 ) + G p ( 0 ) = 0 , p > 1 ,
G p ( t ) = 0 t p G p 1 ( t ) d t + G p , p 1 .
Liu and Wang [30] studied certain identities of Bernoulli, Euler, and Genocchi polynomials using power sums and alternative power sums. For more details on the relations between Genocchi polynomials and Bernoulli polynomials, please see [30].

6.2. Function Approximation

The unknown function φ ( t ) of Equation (5) can be expanded in terms of GPs as follows,
φ ( t ) φ N ( t ) = n = 1 N ε n G n ( t ) ,
where ε n are unknown coefficients and G n ( t ) is GPs, which are defined by (26).
Substituting from (27) into (5) and using the collocation points
t = 2 1 2 N , = 1 , 2 , , N ,
we obtain the next nonlinear system of algebraic equations
0 t G ( α , t , s ) γ ( s , n = 1 N ε n G n ( s ) ) d s + 0 a k ( t , z ) n = 1 N ε n G n ( z ) d z μ n = 1 N ε n G n ( t ) = f ( t ) .
By evaluating the unknown coefficients ε n and applying the Newton iteration approach [31,32], we may resolve the nonlinear system (29).
Similarly, it is easy to obtain the approximate solution of Equations (6) and (7) in the same manner.

7. Numerical Examples

Two numerical examples with various values of α are provided in this section as an application of the findings above. All of the numerical computations were completed using the Maple 18 program.
Example 1.
Consider the NFrIE of the second kind:
1 Γ ( α ) 0 t ( t s ) α 1 s 5 φ 2 ( s ) d s + 0 1 t 2 z 2 φ ( z ) d z φ ( t ) = f ( t ) , T φ ( 0 ) φ ( 0 ) = 0 ,
where the known function f ( t ) is described by putting φ ( t ) = t 4 as an exact solution.
After using the value of the unknown function as an exact solution, we have f(t) in the form
Γ ( 10 ) Γ ( 10 + α ) t 9 + α 4 5 t 2 = f ( t ) .
It is clear that the function f ( t ) is bounded and continuous and f ( 0 ) = 0 .
In Example 1, we consider
d α d t α { 0 1 t 2 z 2 φ ( z ) d z φ ( t ) } = g ( t ) ( t 5 φ 2 ( t ) ) ,
which is a special case from the general formula
d α d t α ( T φ ( t ) φ ( t ) ) = g ( t ) M ( t ) γ ( φ ( t ) ) , ( T φ ( 0 ) φ ( 0 ) = 0 ) ,
where T φ ( t ) is an integral operator.
Now, applying GPM to Equation (30) and using the collocation point (28) for N = 5 , the approximate solution of Equation (30) can be collected in the next forms by varying the value of α :
φ ( t ) φ 5 ( t ) = 1.50 × 10 8 2.47 × 10 7 t + 0.1226 × 10 5 t 2 0.2280 × 10 7 t 3 + 1.000001458 t 4 , α = 0.00001 ,
φ ( t ) φ 5 ( t ) = 3 × 10 10 4 × 10 9 t + 1.4 × 10 8 t 2 1.7 × 10 8 t 3 + 1.000000007 t 4 , α = 1 5 ,
φ ( t ) φ 5 ( t ) = 3 × 10 10 4 × 10 9 t + 1.8 × 10 8 t 2 2.6 × 10 8 t 3 + 1.000000012 t 4 , α = 1 4 ,
φ ( t ) φ 5 ( t ) = 2 × 10 10 3 × 10 9 t + 8 × 10 9 t 2 6 × 10 9 t 3 + 1.000000002 t 4 , α = 1 3 ,
φ ( t ) φ 5 ( t ) = 1.0 × 10 9 7 × 10 9 t + 2.5 × 10 8 t 2 3.8 × 10 8 t 3 + 1.000000020 t 4 , α = 1 2 ,
φ ( t ) φ 5 ( t ) = 1 × 10 10 3 × 10 9 t 2 + 1.4 × 10 8 t 3 + 0.9999999870 t 4 , α = 0.95 .
Also, absolute errors are shown in Table 1 and Figure 1, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7 and Figure 8. A comparison between the exact solution and approximate solution of Example 1, α = 1 is shown in Figure 9.
Example 2.
Consider the integro-differential equation of the first order:
d φ d t φ ( t ) 1 Γ ( α ) 0 t ( t s ) α 1 s 5 φ 3 ( s ) d s = f ( t ) , D φ ( 0 ) φ ( 0 ) = 0 ,
where the known function f ( t ) is described by putting φ ( t ) = t 2 as an exact solution.
In Example 2, we consider
d α d t α { d φ ( t ) d t φ ( t ) } = g ( t ) ( t 5 φ 3 ( t ) ) ,
d α d t α { D φ ( t ) φ ( t ) } = g ( t ) M ( t ) γ ( φ ( t ) ) , ( D φ ( 0 ) φ ( 0 ) = 0 ) ,
where D φ ( t ) is a differentiable operator.
Similar to in Example 1, applying GPM to Equation (31) and using the collocation point (28) for N = 5 , the approximate solution of Equation (31) can be collected in several different formats by varying the value of α :
φ ( t ) φ 5 ( t ) = 5.78926571 × 10 11 + 1.000000000 × t 2 6.58944122 × 10 10 t 3 + 8.452573750 × 10 10 t 4 , α = 0.00001 ,
φ ( t ) φ 5 ( t ) = 1.347313885 × 10 10 + 1 × 10 9 t + 1.000000000 × t 2 9.198107540 × 10 10 t 3
+ 7.293681540 × 10 10 t 4 , α = 1 5 ,
φ ( t ) φ 5 ( t ) = 2.386554161 × 10 11 + 0.9999999998 × t 2 + 2.143753015 × 10 10 t 3 5.945656755 × 10 11 t 4 , α = 1 4 ,
φ ( t ) φ 5 ( t ) = 1.486305278 × 10 11 + 1.000000000 × t 2 + 1.708136551 × 10 10 t 3 1.151329331 × 10 10 t 4 , α = 1 3 ,
φ ( t ) φ 5 ( t ) = 5.026134044 × 10 11 2 × 10 10 t + 0.9999999999 × t 2 + 2.168003276 × 10 10 t 3
2.089228447 × 10 10 t 4 , α = 1 2 ,
φ ( t ) φ 5 ( t ) = 5.747226027 × 10 10 4 × 10 10 t + 0.9999999991 t 2 + 1.193531824 × 10 9 t 3
7.462111175 × 10 10 t 4 , α = 0.95 .
Absolute errors are shown in Table 2 and Figure 10, Figure 11, Figure 12, Figure 13, Figure 14, Figure 15 and Figure 16.

8. Discussion of the Results

Two numerical examples are presented: Example 1, applied to the first application Equation (5), and Example 2, applied to the integro-differential equation of the first order (7) when the operator T is differentiable. We note that
  • In Example 1, the largest error value at α = 0.00001 , t = 1 is 1.720 × 10 7 but at all different values of α at t = 1 the error values equal constant × 10 9 and constant at × 10 10 ; this is clear in Table 3.
The lowest value for error at α = 0.00001 , t = 0.1 is 4.258 × 10 10 but at all different values of α at t = 0.1 the error values equal constant × 10 11 , except at α = 1 2 where the error equals 5.14 × 10 10 ; this is clear in Table 4.
In Figure 1, at α = 0.00001 the absolute errors equal constant × 10 7 and constant × 10 8 , while in Figure 2 at α = 0.2 the absolute errors equal constant × 10 10 , and also in Figure 3 at α = 0.25 the absolute errors equal constant × 10 10 and constant × 10 11 , while in Figure 4, Figure 5 and Figure 6 at α = 1 3 , 1 2 , 0.95 the absolute errors equal constant × 10 9 and constant × 10 10 . A comparison between the absolute errors for different values of α of Example 1 are presented in Figure 7. Figure 8 represents the absolute errors, α = 1 , and the comparison between the exact solution and approximate solution is represented in Figure 9 at α = 1 .
2.
In example 2, the lowest value for error at α = 1 3 , t = 0.5 is 7.07 × 10 13 .
Table 5. The lowest error value of Example 2.
Table 5. The lowest error value of Example 2.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
0.5 2.83 × 10 11 5.65 × 10 10 3.05 × 10 12 7.07 × 10 13 1.61 × 10 10 8.97 × 10 10
Table 6. The largest error value of Example 2.
Table 6. The largest error value of Example 2.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
1 2.44 × 10 10 9.44 × 10 10 2.12 × 10 11 4.08 × 10 11 3.42 × 10 10 1.42 × 10 9
In Figure 10, at α = 0.00001 the absolute errors equal constant × 10 10 and constant × 10 11 , while in Figure 11 at α = 0.2 the absolute errors equal constant × 10 10 , while in Figure 12 at α = 0.25 the absolute errors equal constant × 10 11 and constant × 10 12 . In Figure 13 at α = 1 3 the absolute errors equal constant × 10 11 , in Figure 14 at α = 1 2 the absolute errors equal constant × 10 10 , while in Figure 15 at α = 0.95 the absolute errors equal constant × 10 9 and constant × 10 10 . A comparison between the absolute errors of different values of α in Example 2 are presented in Figure 16. In Example 2, we have demonstrated less error value in Table 5, also, we have demonstrated the largest error value in Table 6.

9. Conclusions

In the present paper, the Genocchi polynomial method was applied to solve NFrIEs of the second kind. The Genocchi polynomial method converted the problem to a system of algebraic equations. Finally, two numerical examples were discussed to demonstrate the applicability and validity of the method. We have shown the existence of a unique solution to the second sort of NFrIE in Hilbert space. Furthermore, we have explained and discussed proof of the stability of the error.

Future Works

We will study and extend the work using some different numerical methods and also some semi-analytical methods.

Author Contributions

Conceptualization, A.M.S.M.; Methodology, A.M.S.M., M.A.A. and D.S.M.; Software, R.T.M., A.M.S.M., M.A.A. and D.S.M.; Formal analysis, D.S.M.; Resources, R.T.M., A.M.S.M. and D.S.M.; Data curation, A.M.S.M.; Writing—original draft, R.T.M., A.M.S.M., M.A.A. and D.S.M.; Writing—review & editing, R.T.M., A.M.S.M., M.A.A. and D.S.M.; Supervision, A.M.S.M. and M.A.A.; Funding acquisition, R.T.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors express their gratitude to the editor and the anonymous referees for their critical reading of the paper and their insightful remarks, which significantly enhanced it.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hamdan, S.; Qatanani, N.; Daraghmeh, A. Numerical techniques for solving linear Volterra fractional integral equation. J. Appl. Math. 2019, 2019, 5678103. [Google Scholar] [CrossRef]
  2. Pu, T.; Fasondini, M. The numerical solution of fractional integral equations via orthogonal polynomials in fractional powers. Adv Comput Math. 2023, 49, 1–40. [Google Scholar] [CrossRef]
  3. Bekkouche, M.M.; Mansouri, I.; Azeb Ahmed, A.A. Numerical solution of fractional boundary value problem with caputo-fabrizio and its fractional integral. J. Appl. Math. Comput. 2022, 68, 4305–4316. [Google Scholar] [CrossRef] [PubMed]
  4. Mahdy, A.M.S.; Nagdy, A.S.; Mohamed, D.S. Solution of fractional integro-differential equations using least squares and shifted legendre methods. J. Appl. Math. Comput. Mech. 2024, 23, 59–70. [Google Scholar] [CrossRef]
  5. 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]
  6. Alharbi, F.M.; Zidan, A.M.; Naeem, M.; Shah, R.; Nonlaopon, K. Numerical investigation of fractional-order differential equations via φ-Haar-Wavelet method. J. Funct. Spaces 2021, 2021, 3084110. [Google Scholar] [CrossRef]
  7. Mohamed, D.S.; Abdou, M.A.; Mahdy, A.M.S. Dynamical investigation and numerical modeling of a fractional mixed nonlinear partial integro-differential problem in time and space. J. Appl. Anal. Comput. 2024, 14, 1–21. [Google Scholar]
  8. Zabidi, N.A.; Majid, Z.A.; Kilicman, A.; Ibrahim, Z.B. Numerical solution of fractional differential equations with Caputo derivative by using numerical fractional predict-correct technique. Adv. Contin. Discret. Model. 2022, 2022, 1–23. [Google Scholar] [CrossRef]
  9. Yi, X.; Liu, C.; Cheong, H.T.; Teo, K.L.; Wang, S. A third-order numerical method for solving fractional ordinary differential equations. AIMS Math. 2024, 9, 21125–21143. [Google Scholar] [CrossRef]
  10. Jassim, H.K.; Hussein, M.A. A New approach for solving nonlinear fractional ordinary differential equations. Mathematics 2023, 11, 1565. [Google Scholar] [CrossRef]
  11. Mohamed, M.Z.; Yousif, M.; Hamza, A.E. Solving nonlinear fractional partial differential equations using the elzaki transform method and the homotopy perturbation method. In Abstract and Applied Analysis; John Wiley & Sons, Inc.: Hoboken, NJ, USA, 2022; pp. 1–9. [Google Scholar]
  12. Rashid, S.; Ahmad, A.G.; Jarad, F.; Alsaadi, A. Nonlinear fractional differential equations and their existence via fixed point theory concerning to Hilfer generalized proportional fractional derivative. AIMS Math. 2022, 8, 382–403. [Google Scholar] [CrossRef]
  13. Lydia, S.K.; Jancirani, M.M.; Anitha, A.A. Numerical solution of nonlinear fractional differential equations using kharrat-toma iterative method. Nat. Volatiles Essent. Oils 2021, 8, 9878–9890. [Google Scholar]
  14. Yu, C. A Study on a nonlinear fractional differential equation. Int. J. Nov. Res. Comput. Sci. Softw. Eng. 2023, 10, 28–33. [Google Scholar]
  15. Dehestani, H.; Ordokhani, Y.; Razzaghi, M. The novel operational matrices based on 2D-Genocchi polynomials: Solving a general class of variable-order fractional partial integro-differential equations. Comput. Appl. Math. 2020, 39, 259. [Google Scholar] [CrossRef]
  16. Khajehnasiri, A.; Ebadian, A. Genocchi operational matrix method and their applications for solving fractional weakly singular two-dimensional partial Volterra integral equation. UPB Sci. Bull. Ser. A 2023, 85, 155–170. [Google Scholar]
  17. Loh, J.R.; Phang, C.; Isah, A. Numerical solution for arbitrary domain of fractional integro-differential equation via the general shifted Genocchi polynomials. J. Funct. Spaces 2020, 2023, 5921425. [Google Scholar] [CrossRef]
  18. Ebrahimzadeh, A.; Hashemizadeh, E. Optimal control of nonlinear Volterra integral equations with weakly singular kernels based on Genocchi polynomials and collocation method. J. Nonlinear Math. Phys. 2023, 30, 1758–1773. [Google Scholar] [CrossRef]
  19. Hashemizadeh, E.; Ebadi, M.A.; Noeiaghdam, S. Matrix method by Genocchi polynomials for solving nonlinear Volterra integral equations with weakly singular kernels. Symmetry 2020, 12, 2105. [Google Scholar] [CrossRef]
  20. Heydari, M.H.; Zhagharian, S. Genocchi polynomials for variable order time fractional Fornberg Whitham type equations. Partial. Differ. Equ. Appl. Math. 2023, 8, 100554. [Google Scholar] [CrossRef]
  21. Loh, J.R.; Phang, C.; Isah, A. New operational matrix via Genocchi polynomials for solving Fredholm-Volterra fractional integro-differential equations. Adv. Math. Phys. 2017, 2017, 3821870. [Google Scholar] [CrossRef]
  22. Seghiri, N.; Nadir, M.; Khirani, A. Operational matrices of Genocchi polynomials for solving high-order linear Fredholm integro-differential equations. Math. Model. Eng. Probl. 2024, 11, 2473–2482. [Google Scholar] [CrossRef]
  23. Mustapha, D. Numerical solution of integro-differential equations of the second kind by using Galerkin’s method with Genocchi polynomial. J. Jilin Univ. (Eng. Technol. Ed.) 2024, 43, 60–70. [Google Scholar]
  24. Isah, A.; Phang, C. New operational matrix of derivative for solving non-linear fractional differential equations via Genocchi polynomials. J. King Saud Univ. Sci. 2019, 31, 1–7. [Google Scholar] [CrossRef]
  25. Granos, A.; Dugundji, J. Fixed Point Theorem; Springer: New York, NY, USA, 2003. [Google Scholar]
  26. Hilfar, R. Application of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  27. Kilbas, A.A.; Srivastava, H.M.; Trullo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier Science B.V.: Amsterdam, The Netherlands, 2006; North-Holland Mathematics Studies. [Google Scholar]
  28. Abdou, M.A.; Salama, F.A. Fredholm-Volterra integral equation of the first kind and spectral relationships. Appl. Math. Comput. 2004, 153, 141–153. [Google Scholar] [CrossRef]
  29. Abdou, M.A. Fredholm-Volterra integral equation of the first kind and contact problem. Appl. Math. Comput. 2002, 125, 177–193. [Google Scholar] [CrossRef]
  30. Liu, H.; Wang, W. Some identities on the Bernoulli, Euler and Genocchi polynomials via power sums and alternate power sums. Discret. Math. 2009, 309, 3346–3363. [Google Scholar] [CrossRef]
  31. Smith, G.D. Numerical Solution of Partial Differential Equations: Finite Difference Methods, 3rd ed.; Oxford University Press: Oxford, UK, 1985. [Google Scholar]
  32. Morton, K.W.; Mayers, D.F. Numerical Solution of Partial Differential Equations; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
Figure 1. Absolute error of Example 1, α = 0.00001 .
Figure 1. Absolute error of Example 1, α = 0.00001 .
Fractalfract 08 00663 g001
Figure 2. Absolute error of Example 1, α = 1 5 .
Figure 2. Absolute error of Example 1, α = 1 5 .
Fractalfract 08 00663 g002
Figure 3. Absolute error of Example 1, α = 1 4 .
Figure 3. Absolute error of Example 1, α = 1 4 .
Fractalfract 08 00663 g003
Figure 4. Absolute error of Example 1, α = 1 3 .
Figure 4. Absolute error of Example 1, α = 1 3 .
Fractalfract 08 00663 g004
Figure 5. Absolute error of Example 1, α = 1 2 .
Figure 5. Absolute error of Example 1, α = 1 2 .
Fractalfract 08 00663 g005
Figure 6. Absolute error of Example 1, α = 0.95 .
Figure 6. Absolute error of Example 1, α = 0.95 .
Fractalfract 08 00663 g006
Figure 7. Comparison between the absolute errors of Example 1.
Figure 7. Comparison between the absolute errors of Example 1.
Fractalfract 08 00663 g007
Figure 8. Absolute error of Example 1, α = 1 .
Figure 8. Absolute error of Example 1, α = 1 .
Fractalfract 08 00663 g008
Figure 9. Comparison between exact solution and approximate solution of Example 1, α = 1 .
Figure 9. Comparison between exact solution and approximate solution of Example 1, α = 1 .
Fractalfract 08 00663 g009
Figure 10. Absolute error of Example 2, α = 0.00001 .
Figure 10. Absolute error of Example 2, α = 0.00001 .
Fractalfract 08 00663 g010
Figure 11. Absolute error of Example 2, α = 1 5 .
Figure 11. Absolute error of Example 2, α = 1 5 .
Fractalfract 08 00663 g011
Figure 12. Absolute error of Example 2, α = 1 4 .
Figure 12. Absolute error of Example 2, α = 1 4 .
Fractalfract 08 00663 g012
Figure 13. Absolute error of Example 2, α = 1 3 .
Figure 13. Absolute error of Example 2, α = 1 3 .
Fractalfract 08 00663 g013
Figure 14. Absolute error of Example 2, α = 1 2 .
Figure 14. Absolute error of Example 2, α = 1 2 .
Fractalfract 08 00663 g014
Figure 15. Absolute error of Example 2, α = 0.95 .
Figure 15. Absolute error of Example 2, α = 0.95 .
Fractalfract 08 00663 g015
Figure 16. Comparison between the absolute errors of Example 2.
Figure 16. Comparison between the absolute errors of Example 2.
Fractalfract 08 00663 g016
Table 1. Absolute errors (E) of Example 1.
Table 1. Absolute errors (E) of Example 1.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
0 1.50 × 10 8 3 × 10 10 3 × 10 10 2 × 10 10 1 × 10 9 1 × 10 10
0.1 4.258 × 10 10 2.37 × 10 11 5.52 × 10 11 2.58 × 10 11 5.14 × 10 10 8.27 × 10 11
0.2 1.2672 × 10 9 6.48 × 10 11 3.12 × 10 11 1.248 × 10 10 3.28 × 10 10 7.12 × 10 11
0.3 1.4898 × 10 9 4.23 × 10 11 1.152 × 10 10 1.258 × 10 10 2.86 × 10 10 1.027 × 10 10
0.4 3.7648 × 10 9 3.12 × 10 11 2.232 × 10 10 5.28 × 10 11 2.8 × 10 10 1.832 × 10 10
0.5 4.1250 × 10 9 1.125 × 10 10 3.0 × 10 10 7.50 × 10 11 2.5 × 10 10 2.875 × 10 10
0.6 4.6368 × 10 9 1.752 × 10 10 3.192 × 10 10 2.432 × 10 10 1.84 × 10 10 3.592 × 10 10
0.7 1.08658 × 10 8 2.097 × 10 10 2.832 × 10 10 4.422 × 10 10 1.18 × 10 10 3.107 × 10 10
0.8 3.18768 × 10 8 2.232 × 10 10 2.232 × 10 10 6.672 × 10 10 1.36 × 10 10 2.32 × 10 11
0.9 8.02338 × 10 8 2.397 × 10 10 1.992 × 10 10 9.182 × 10 10 3.7 × 10 10 6.533 × 10 10
1 1.720 × 10 7 3 × 10 10   3 × 10 10 1.2 × 10 9 1 × 10 9 1.9 × 10 9
Table 2. Absolute errors of Example 2.
Table 2. Absolute errors of Example 2.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
0 5.78 × 10 11 1.34 × 10 10 2.38 × 10 11 1.48 × 10 11 5.02 × 10 11 5.74 × 10 10
0.1 5.73 × 10 11 2.33 × 10 10 2.20 × 10 11 1.47 × 10 11 7.10 × 10 11 6.22 × 10 10
0.2 5.39 × 10 11 3.28 × 10 10 1.74 × 10 11 1.36 × 10 11 9.28 × 10 11 6.82 × 10 10
0.3 4.69 × 10 11 4.15 × 10 10 1.11 × 10 11 1.11 × 10 11 1.15 × 10 10 7.49 × 10 10
0.4 3.73 × 10 11 4.94 × 10 10 4.06 × 10 12 6.87 × 10 12 1.37 × 10 10 8.21 × 10 10
0.5 2.83 × 10 11 5.65 × 10 10 3.05 × 10 12 7.07 × 10 13 1.61 × 10 10 8.97 × 10 10
0.6 2.51 × 10 11 6.30 × 10 10 9.53 × 10 12 7.11 × 10 12 1.86 × 10 10 9.77 × 10 10
0.7 3.48 × 10 11 6.94 × 10 10 1.48 × 10 11 1.60 × 10 11 2.15 × 10 10 1.06 × 10 9
0.8 6.67 × 10 11 7.62 × 10 10 1.87 × 10 11 2.54 × 10 11 2.48 × 10 10 1.16 × 10 9
0.9 1.32 × 10 10 8.42 × 10 10 2.08 × 10 11 3.41 × 10 11 2.90 × 10 10 1.28 × 10 9
1 2.44 × 10 10 9.44 × 10 10   2.12 × 10 11 4.08 × 10 11 3.42 × 10 10 1.42 × 10 9
Table 3. The largest error value of example 1.
Table 3. The largest error value of example 1.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
1 1.720 × 10 7 3 × 10 10   3 × 10 10 1.2 × 10 9 1 × 10 9 1.9 × 10 9
Table 4. The lowest error value of example 1.
Table 4. The lowest error value of example 1.
tE, α = 0.00001 E, α = 1 5 E, α = 1 4 E, α = 1 3 E, α = 1 2 E, α = 0.95
0.1 4.258 × 10 10 2.37 × 10 11 5.52 × 10 11 2.58 × 10 11 5.14 × 10 10 8.27 × 10 11
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

Matoog, R.T.; Mahdy, A.M.S.; Abdou, M.A.; Mohamed, D.S. A Computational Method for Solving Nonlinear Fractional Integral Equations. Fractal Fract. 2024, 8, 663. https://doi.org/10.3390/fractalfract8110663

AMA Style

Matoog RT, Mahdy AMS, Abdou MA, Mohamed DS. A Computational Method for Solving Nonlinear Fractional Integral Equations. Fractal and Fractional. 2024; 8(11):663. https://doi.org/10.3390/fractalfract8110663

Chicago/Turabian Style

Matoog, Rajaa T., Amr M. S. Mahdy, Mohamed A. Abdou, and Doaa Sh. Mohamed. 2024. "A Computational Method for Solving Nonlinear Fractional Integral Equations" Fractal and Fractional 8, no. 11: 663. https://doi.org/10.3390/fractalfract8110663

APA Style

Matoog, R. T., Mahdy, A. M. S., Abdou, M. A., & Mohamed, D. S. (2024). A Computational Method for Solving Nonlinear Fractional Integral Equations. Fractal and Fractional, 8(11), 663. https://doi.org/10.3390/fractalfract8110663

Article Metrics

Back to TopTop