1.
Introduction
The present article aims to study the integrable and approximate solutions of the following Hadamard-type fractional Gripenberg equations:
in Lebesgue spaces L1[1,e], where e≅2.718.
Many real concrete phenomena are often modeled and described with the aid of integral equations, particularly in physics, economics, engineering, and biology [1,2,3]. In particular, quadratic integral equations characterize numerous real and concrete issues such as neutron transport, the kinetic theory of gases, radiative transfer theory, and astrophysics (cf. [4,5]). Furthermore, some problems in biology and the queuing theory have led to a quadratic integral equation of the fractional type [1,6]
and this equation has various applications in biology and numerous epidemic models, such as the model of the spread of diseases that do not induce permanent immunity [7].
Moreover, various concrete phenomena contain discontinuous data functions. In this paper, we focus on the integrable solutions of the studied problem (cf. [8,9]).
In 1892, the author presented Hadamard fractional operators [10], where the integral kernel contains a logarithmic function of arbitrary order that is not of the convolution type. It is important to study these kinds of operators separately from the well-known Riemann-Liouville and Caputo fractional operators.
Fractional integral equations of the Hadamard type have been analyzed in a variety of function spaces by several researchers (see, e.g., [11,12,13,14,15]).
In [16], the authors examined the quadratic Hadamard fractional equation
in the Banach algebra of continuous functions C[0,a].
In [17], the author discussed the Riemann-Liouville fractional Gripenberg equation
in the weighted Lebesgue spaces LN1(R+), see also [18].
One of our goals is to discuss the monotonicity property of the solution of Eq (1.1), which has been widely studied and is of vital importance in various applications. In [19,20,21], the authors have studied the monotonicity property of some distinct types of integral equations and have not examined the numerical solutions. As a result, we can numerically and graphically verify that our solutions are nondecreasing.
In general, we cannot find the exact solution of Eq (1.1), so we employ numerical techniques to estimate an approximate solution for that equation. We use the iterative method [22,23] to estimate the solution of (1.1), which shows acceptable accuracy.
The advantages of using the iterative method are as follows:
(1) This method is very effective and has a simple structure for application.
(2) Since most of the numerical methods for solving integral equations, such as interpolation polynomials, quadrature rules, Galerkin methods, finite and divided differences methods, applying Haar wavelets and block pulse functions, and some hybrid methods lead to linear systems, and the singularity of these systems having problems, then using the iterative method based on successive approximations can be very useful to skip these problems [24,25,26].
For the numerical results of the integral equations, the Nystrom type methods and the iterative methods have been applied in [27,28], and projection methods which contain the well-known Galerkin method and collocation method have been employed in [29].
Many different methods have also been proposed to compute approximate solutions for these equations such as Bernstein's polynomials [30], radial basis functions (RBFs) [31], block-pulse functions [32], degenerate kernel method [33], wavelet method [34], triangular functions method [35], hybrid function method [36], and exponential spline method [37]. In addition, the integral equations have been solved using various analytical-numeric methods, such as the Adomian decomposition approach, the regularization-homotopy method, and the homotopy perturbation method [38,39].
Here, we inspect the presence of monotonic solutions for the Hadamard-type fractional Gripenberg's equations (1.1), as well as the uniqueness of the solution in L1[1,e], which is not Banach algebra. We utilize the fixed point theorem (FPT) approach concerning proper measure of noncompactness (MNC) and fractional calculus to obtain our results. We also apply an iterative method to estimate a numerical solution for Eq (1.1) and present an error analysis for that method, which demonstrates that the approximate solution converges to the exact solution. To validate the obtained results, we provide several numerical examples.
2.
Notation and auxiliary facts
Let R=(−∞,∞), J=[1,e]⊂R, and MNC refer to the measure of noncompactness. Denoted by Lp=Lp(J),1≤p<∞ is the Banach space of the measurable functions x under the norm
Let S=S(J) allude to the set of all Lebesgue measurable functions on J. The set S concerning the metric
becomes a complete metric space, where "meas" alludes to the Lebesgue measure on J. Additionally, according to Proposition 2.14 in [3], the convergence in measure on J is similar to the convergence w.r. to the metric d, and we will call the compactness in this space "compactness in measure".
Theorem 2.1. Suppose that W⊂L1 is a bounded set and (Ωρ)1≤ρ≤e−1⊂J is a family of measurable sets s.t. meas(Ωρ)=ρ for every ρ∈J. Let w∈W. We have
then W forms a compact in measure set in L1.
Definition 2.2. [40] Let ∅≠W⊂L1 be a bounded set. The Hausdorff MNC, χ(W) is defined as
where Bc is the closed ball Bc={z∈L1:‖z‖L1≤c},c>0.
Next, let ∅≠W⊂L1 be a bounded set and ϵ>0. The measure of equi-integrability c of the set W [41, p. 39] is given by
If the set W is compact in measure, then c(W) is a regular MNC (cf. [41]).
Definition 2.3. [41] The (Nemytskii) superposition operator is denoted by Ff(x)(θ)=f(θ,x), where f:J×R→R verifies the Carathéodory hypotheses, i.e.,
(1) It is continuous in x for almost all θ∈J.
(2) It is measurable in θ for any x∈R.
Theorem 2.4. [41] Assume that f verifies the Carathéodory hypotheses.The operator Ff continuously transforms Lp→Lq,p,q≥1 if, and only if,
for all x∈R and θ∈J, where b≥0 and a∈Lq.
Theorem 2.5. [40] Let ∅≠U⊂L1 be a convex, closed, and bounded set. Let P:U→U be a continuous mapping and a contraction w.r. to MNC μ, i.e.,
for any ∅≠W⊂U. Thus, P has a fixed point in U.
Definition 2.6. [2,15] The Hadamard-type fractional integral of a function x∈Lp,1≤p<∞ with left hand point 1 takes the structure
where Γ(α)=∫∞0e−ννα−1dν.
Proposition 2.7. For α>0, we have
(a) Iα transforms a.e. nondecreasing and nonnegative functions to functions that have similar properties (cf. [11]).
(b) The operator Iα:Lp→Lp is continuous (cf. [2, Lemma 2.32]) with
3.
Existence of integrable solutions for Eq (1.1)
Let us set (1.1) in operator form as:
where Ffi is as in Definition 2.3 and Iαi,i=1,2 is as in Definition 2.6.
Let 1p1+1p2=1, and set the hypotheses:
(i) gi:J→[0,∞),i=1,2,3, are a.e. nondecreasing functions, where g1∈Lp1, g2∈Lp2, and g3∈L1.
(ii) For i=1,2,3, the functions fi:J×R→R verify Carathéodory hypotheses, and (θ,x)→fi(θ,x)≥0 are nondecreasing w.r. to θ and x, separately for (θ,x)∈J×R.
(iii) ∃bi≥0,i=1,2,3 and positive functions a1∈Lp1,a2∈Lp2,a3∈L1 s.t.
for all θ∈[1,e] and x∈R.
(iv) Assume that ∃r>0 verifies
where (b3+b1b2M1M2)<1 and Mi=1Γ(αi)∫10tαi−1etpidt,i=1,2.
Theorem 3.1. Let (i)–(iv) be fulfilled, then (1.1) has at least one a.e. nondecreasing-integrable solution x∈L1 on J.
Proof. Step 1. Let i=1,2. By hypotheses (ii) and (iii) and Theorem 2.4, we indicate that Ffi:L1→Lpi is continuous and Ff3:L1→L1 is continuous. Since the operators Iαi:Lpi→Lpi are continuous, hypothesis (i) states that Ai: L1 → Lpi are continuous. Using the Hölder inequality, we have (A1⋅A2):L1→L1 and H:L1→L1, and they are continuous.
Step 2. Recalling our hypotheses and Proposition 2.7(b), we have
where ‖x1pi‖Lpi=‖x‖1piL1, then H:L1→L1. For x∈Br={z∈L1:‖z‖L1≤r}, where r is as in assumption (iv),
Therefore, for x∈Br, the operator H continuously maps the ball Br into itself.
Step 3. Suppose that Qr⊂Br has the functions a.e. nondecreasing on J. The set ∅≠Qr is closed, convex, bounded in L1 (cf. [8]), and compact in measure with the aid of Theorem 2.1.
Step 4. Select x∈Qr, then x(t) and, consequently, fi,i=1,2,3 are a.e. nondecreasing on J (see (ii)). Furthermore, the operators Iαi,i=1,2, are a.e. nondecreasing on J (see Proposition 2.7(a)). Moreover, each (Aix),i=1,2, is also of the same type. These properties, along with hypothesis (i), indicate that H:Qr→Qr, and it is continuous.
Step 5. Next, let ∅≠X⊂Br and arbitrary ε>0. For x∈X and any D⊂[1,e] with meas(D)≤ε, we derive
Since gi,ai∈Lpi,i=1,2, we have
and since g3,a3∈L1,
From Eq (2.1), we obtain
Since (b3+b1b2M1M2)<1, together with the above estimations, we can utilize Theorem 2.5, which completes the proof. □
3.1. Uniqueness of the solution
Presently, we will address and prove the uniqueness of the solutions.
Theorem 3.2. Suppose that hypotheses of Theorem 3.1 hold, but change hypothesis (iii) with:
(v) The functions a1∈Lp1,a2∈Lp2,a3∈L1, and bi≥0 s.t.
where Qr is as in Theorem 3.1.
(vi) Assume that
where M1,M2, and r are characterized in hypothesis (iv), then (1.1) has a unique solution x∈L1 in Qr.
Proof. Using hypothesis (v), we obtain
Similarly, |f3(θ,x)|≤a3(θ)+b3|x|. Thus, Theorem 3.1 indicates that (1.1) has at least one solution x∈L1 in Qr.
Next, let x,y∈Qr be two various solutions of Eq (1.1). We have
where ‖x−y‖1piL1=‖x−y‖1pi−1L1‖x−y‖L1≤(2r)1pi‖x−y‖L1,i=1,2. The previous estimation with the hypothesis (vi) wraps up the proof. □
Next, we introduce a concrete example that illustrates and fulfills the outcomes presented in Theorems 3.1 and 3.2.
Example 3.3. Take into consideration the next equation,
Let p1=p2=2. We have that:
(1) g1(θ)=g2(θ)=ln5θ√θ∈L2 and g3(θ)=ln9θθ∈L1 with ‖g1‖L2=‖g2‖L2=1√11 and ‖g3‖L1=110.
(2) |f1(θ,x)|≤ln5θ√θ+150|x|12, then a1=ln5θ√θ,b1=150 with ‖a1‖L2=1√11.
(3) f2(θ,x)=√ln(1+|x|36) and |f2(θ,x)|≤|x|126, then a2(θ)=0,b2=16.
(4) |f3(θ,x)|≤ln9θθ+150|x|, then a3=ln9θθ,b3=150 with ‖a3‖L1=110.
(5) (b3+b1b2M1M2)≤150+4(50)(6)<1, where M1=M2=1.3483<2.
(6) Let ‖x‖L1=r,r=0.7720, where
then hypothesis (iv) holds for r=0.7720.
Therefore, by utilizing Theorem 3.1, Eq (3.1) has at least one solution x∈L1 a.e. nondecreasing in [1,e]. Moreover, we have
(1) |f1(θ,0)|=ln5θ√θ and |f1(θ,x)−f1(θ,y)|≤150|x−y|12.
(2) |f2(θ,0)|=0 and |f2(θ,x)−f2(θ,y)|≤16|x−y|12.
(3) |f3(θ,0)|=ln9θθ and |f3(θ,x)−f3(θ,y)|≤150|x−y|.
(4) Hypothesis (vi) is fulfilled for r=0.7720, where
Hence, by utilizing Theorem 3.2, Eq (3.1) has a unique solution x∈L1.
4.
Numerical successive approximations method
In this section, we apply a numerical method to solve Eq (1.1), which is based on the successive approximations method [22,23]. This is a well known and applicable classical method for solving initial value problems and various types of integral equations.
The successive approximations method (Picard sequence) for Eq (1.1) is defined by
where the zeroth approximation x0(θ) is an arbitrary real function. For the zeroth approximation, we select x0(θ)=g3(θ). By using (4.1), the solution of Eq (1.1) can be computed as:
Theorem 4.1. Under the hypotheses of Theorem 3.2, Eq (1.1) has a unique solution x∗∈L1[1,e]. Moreover, for any x0∈L1[1,e], the Picard sequence is defined as
where
with the initial value x0:=g3 converging to x∗ with respect to the norm ‖⋅‖L1.
4.1. Error estimation
Here, we derive and estimate the error between the approximate solution (xn)n∈N and the exact solution x∗ of (1.1), regarding the sequence of the successive approximations method.
Theorem 4.2. Let the hypotheses of Theorem 3.2 hold, then the error estimation between the approximate solutions (xn)n∈N and the exact x∗ of (1.1) is given by
where C is defined in hypothesis (vi) and
Proof. We have
Also, we have
Combining (4.4) and (4.5), we have
Moreover,
By induction, we get
By repeating the above procedure for x1 and x0, we have
From (4.6), (4.7), and (4.8), we have
□
4.2. Numerical experiments
Next, we apply our method to a numerical example that demonstrates the accuracy and efficiency of the applied method in solving Eq (1.1).
The absolute errors in the solutions are given by
where x∗(θ) is the exact solution and xn(θ) is the approximate solution of (1.1), which is obtained from Picard sequence (4.1). All numerical results are computed using Maple 17.
Example 4.3. Consider the following equation
where g3(θ)=9(lnθ)240−√θ10−25√lnθπ.
Equation (4.11) has the exact solution x(θ)=(lnθ)24.
Let p1=p2=2. We have that
(1) g1(θ)=√θ10∈L2,g2(θ)=1−112√(lnθ)3π∈L2 and g3(θ)=9(lnθ)240−√θ10−25√lnθπ∈L1 with ‖g1‖L2=120√2(e2−1),‖g2‖L2=1.28103, and ‖g3‖L1=0.35385.
(2) |f1(θ,x)|≤110√4−ln2(θ)4+110√x, then a1(θ)=110√4−ln2(θ)4,b1=110 with ‖a1‖L2=120√15e−14.
(3) f2(θ,x)≤18√|x|, then b2=18 with ‖a2‖L2=0.
(4) |f3(θ,x)|=110|x|, then a3=0,b3=110 with ‖a3‖L1=0.
(5) (b3+b1b2M1M2)≤110+4(10)(8)≤1, where M1=M2=1.3483≤2.
(6) Let ‖x‖L1≤r,r=1.56189, where
Thus, (iv) holds for r=1.56189.
Therefore, by utilizing Theorem 3.1, Eq (4.11) has at least one solution x∗∈L1 a.e. nondecreasing in [1,e].
Moreover, we have
(1) |f1(θ,0)|=110√4−ln2(θ)4 and |f1(θ,x)−f1(θ,y)|≤110|x−y|12.
(2) |f2(θ,0)|=0 and |f2(θ,x)−f2(θ,y)|≤18|x−y|12.
(3) |f3(θ,0)|=0 and |f3(θ,x)−f3(θ,y)|≤110|x−y|.
(4) Hypothesis (vi) is fulfilled with r=1.56189, where
Hence, by utilizing Theorem 3.2, Eq (4.11) has a unique solution x∗∈L1.
We choose x0(θ)=9(lnθ)240−√θ10−25√lnθπ. The solution is approximated by Picard sequence (4.1) given in Section 4. After 5 and 12 iterations, the absolute errors are obtained in some arbitrary points θj=a+2j−110, for j=1,2,...,10 and a=1. To compare the exact solution x∗ of Eq (4.11) and the iterative solutions xn, for n=5,12 iterations, see Table 1.
In Figure 1, the curves of the exact solution and the approximate solutions with n=5 and n=12 for the proposed methods are plotted. It can be seen that the approximate solution (circle symbol) for n=12 is closer to the exact solution. Also, decreasing of the absolute errors by increasing the number of iteration n is shown in Figure 2.
Remark 4.4. The obtained results from Table 1 and Figure 1 demonstrate the acceptable accuracy of the proposed method. The numerical results show that the accuracy improves with increasing the n.
Remark 4.5. According to Figure 1, we can see that the solution of Eq (4.11) is monotonic "nondecreasing, " which verifies our assumptions.
5.
Conclusions and perspective
This manuscript addresses the analytical and numerical solutions of the Hadamard-type fractional Gripenberg's equations (1.1) in Lebesgue space L1[1,e]. With the assistance of appropriate MNC and FPT hypotheses, we demonstrated our obtained results of the studied problem in spaces that are not Banach algebras. Two outcomes, namely, Theorems 3.1 and 3.2, are established s.t. the studied problem has at least one monotonic solution and a unique monotonic solution in the mentioned space, respectively. Also, we introduced the numerical iterative method to give approximate solutions of the studied equation with high accuracy. Finally, we estimated the error between the exact solution and the approximate solution of the studied problem via the proposed iterative method. It is worth mentioning that the proposed methods used in this paper are effective and powerful and will be used in future work for other integral equations arising in nonlinear science (see e.g., [42]).
Use of AI tools declaration
The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.
Acknowledgments
The authors extend their appreciation to Prince Sattam bin Abdulaziz University for funding this research work through the project number (PSAU/2023/01/25622).
Conflict of interest
The authors declare that there are no conflicts of interest regarding the publication of this article.