Next Article in Journal
A Complete Characterization of Linear Dependence and Independence for All 4-by-4 Metric Matrices
Next Article in Special Issue
On the Existence, Uniqueness and a Numerical Approach to the Solution of Fractional Cauchy–Euler Equation
Previous Article in Journal
Sălăgean Differential Operator in Connection with Stirling Numbers
Previous Article in Special Issue
Stability and Convergence Analysis of the Discrete Dynamical System for Simulating a Moving Bed
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analytical and Numerical Approaches via Quadratic Integral Equations

by
Jihan Alahmadi
1,†,
Mohamed A. Abdou
2,† and
Mohamed A. Abdel-Aty
3,*
1
Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam Bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
2
Department of Mathematics, Faculty of Education, Alexandria University, Alexandria 21511, Egypt
3
Department of Mathematics and Computer Science, Faculty of Science, Benha University, Benha 13518, Egypt
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2024, 13(9), 621; https://doi.org/10.3390/axioms13090621
Submission received: 23 July 2024 / Revised: 8 September 2024 / Accepted: 9 September 2024 / Published: 12 September 2024
(This article belongs to the Special Issue Applied Mathematics and Numerical Analysis: Theory and Applications)

Abstract

:
A quadratic integral Equation (QIE) of the second kind with continuous kernels is solved in the space C ( [ 0 , T ] × [ 0 , T ] ) . The existence of at least one solution to the QIE is discussed in this article. Our evidence depends on a suitable combination of the measures of the noncompactness approach and the fixed-point principle of Darbo. The quadratic integral equation can be used to derive a system of integral equations of the second kind using the quadrature method. With the aid of two different polynomials, Laguerre and Hermite, the system of integral equations is solved using the collocation method. In each numerical approach, the estimation of the error is discussed. Finally, using some examples, the accuracy and scalability of the proposed method are demonstrated along with comparisons. Mathematica 11 was used to obtain all of the results from the techniques that were shown.

1. Introduction

Integral equations of various types play an important role in many branches of linear and nonlinear functional analysis and their applications, which appear in many different applied science fields. For example, in [1], Alhazmi solved the mixed integral equation of the first kind using a novel approach, Ghiat et al. [2] solved the non-linear Volterra integral equation of the first kind using a block-by-block technique, in [3], Gong et al. focused on an optimal control problem in a confined domain that includes a wave equation constraint across the whole space, Jaabar and Hussain solved Volterra integral equations using the definition of a new transformation (the Al-Zughair Transform) in [4], the unique solution and existence of the nonlinear Volterra–Fredholm integral equation of the second kind were examined by Matoog et al. in [5], Ma and Huang created a collocation technique for VIE of the third kind solutions in [6], a form of Volterra functional integral Equations (VIEs) of the second kind in which both limits of integration are variables was examined by Micula in [7] using an iterative numerical approach, Micula presented a simple numerical technique for estimating solutions to Fredholm-–Volterra integral equations of the second kind in [8], and Sarkar et al. presented a method for resolving a nonlinear Fredholm integral equation with a constant delay in [9]. Quadratic integral equations are complex equations in the science of integral equations due to the difficulty of obtaining an exact solution, but they have many applications in life sciences, so researchers have been interested in finding an approximate solution to this type of equation. For example, we can cite the meshless method in Fatahi [10], the homotopy perturbation method in Noeiaghdam et al. [11], the collocation method in Jaan [12], the Chebyshev polynomial method in Abusalim et al. [13], the Legendre polynomials method in Abdel-Aty and Abdou [14], the block–pulse and hybrid functions in Abusalim et al. [15], the wavelet method in Adibi et al. [16], and the resolvent kernel method in Abdel-Aty et al. [17]. To find an approximate solution to this type of equation, researchersfound new algorithms, that use a linear combination of functions with an orthogonal or non-orthogonal basis and polynomials as an expression of the solution, for example, Fibonacci polynomials in Mirzaee and Hoseini [18], block–pulse functions in Hesameddini and Shahbazi [19], Chebyshev polynomials in Alhazmi [20], hat functions in Mirzaee and Hadadiyan [21], Bernoulli polynomials in Bazm [22], and the operational matrix method in Mirzaee and Samadyar [23].
Quadratic integral equations are a special type of integral equations that appear in many mathematical models of various phenomena in the real world. Numerous mathematical physics and chemical engineering problems at times involve quadratic integral equations, such as the theory of kinetic gases, the theory of radiative transfer, the traffic theory, the queuing theory, the theory of neutron transport, and many other applications [24,25,26]. See Abdou et al. [27], El-Sayed et al. [28], Abdel-Aty [29], and Mirzaee [30] for studies on the existence of a solution and a numerical approach to solve this kind of integral equations. Volterra-type singular quadratic integral equations have recently attracted a lot of attention due to their importance in describing problems that appear in basic sciences and various events in the real world.
In many branches of nonlinear analysis, special measures of specific incompatibilities are often used. Arab et al. [31] found this technique a really useful tool within the existence theorems of many kinds of integral equations. The purpose of this study is to prove the existence theorem for a nonlinear integral equation using the method of special measures of noncompactness and a fixed-point theory of the Darbo type in the class C [ 0 , T ] . The results conferred during this article appear to be new and original. The result obtained within the article generalizes a lot of results obtained earlier in many papers, such as Abdel-Aty et al. [17] and Basseem [32].
In this paper, we will discuss the solvability of the following quadratic integral equation:
μ Φ ( x , t ) = g ( x , t ) + E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ × E 2 x , t , 0 x k ( y , t ) Φ ( y , t ) d y , for ( x , t ) ( [ 0 , T ] × [ 0 , T ] ) ,
where μ is a constant, Φ ( x , t ) is unknown function in Banach space C ( [ 0 , T ] × [ 0 , T ] ) ; T < 1 . The kernels f ( x , τ ) , k ( y , t ) are continuous in C ( [ 0 , T ] × [ 0 , T ] ) ; in addition, the given g ( x , t ) is a continuous function in the same class.
The rest of this paper is organized as follows: In Section 2, the initial principles are reviewed by mentioning some important definitions and theorems in the noncompactness measure. In Section 3, in light of the fixed-point theorem and the contradiction measure and under certain conditions, we obtain the basic condition for the existence of at least one solution to the quadratic integral equation Equation (1). This solution is positive and belongs to the used branch. This is formulated by stating a basic theorem for the existence of at least one solution. This context is justified by proving that the integrative operators satisfy the Darbo condition. In Section 4, we review the squaring method to obtain an algebraic system of quadratic integral equations. Then, using the collocation approach, the quadratic integral equations are written for possible solutions after completing the study of the system. In Section 5, the convergence of the solution of quadratic integral systems is studied. The concept of convergence is contextualized through a theory in which the necessary and essential conditions for convergence are stated. The work is completed with the help of Laguerre and Hermite limits by discussing the convergence of the solution. In Section 6, the analytical application is followed by showing some examples that are solved numerically using Mathematica 11. The error resulting from the solution for the mentioned applications is also calculated. Finally, Section 7 presents some concluding remarks.

2. Auxiliary Results and Notation

In this section, we provide some preliminary observations and facts found in Banaś et al. [33] that are used in the following sections of the paper.
Let E be a real Banach space with the norm . , infinite-dimensional, and the zero element θ , the closed ball with a centered at x with radius r, is denoted as B ( x , r ) . We write B r for B ( 0 , r ) .
Definition 1.
A function ω 0 : M E R + = [ 0 , + ) is said to be the measure of noncompactness in E, if it satisfies the following conditions:
(1*) 
The family ker ω 0 = { X M E : ω 0 ( X ) = 0 } is nonempty and ker ω 0 N E ;
(2*) 
X Y ω 0 ( X ) ω 0 ( Y ) ;
(3*) 
ω 0 ( X ¯ ) = ω 0 ( Conv X ) = ω 0 ( X ) ;
(4*) 
ω 0 ( λ X + ( 1 λ ) Y ) λ ω 0 ( X ) + ( 1 λ ) ω 0 ( Y ) for 0 λ 1 ;
(5*) 
If { X n } is a sequence of closed sets from M E such that X n + 1 X n for n = 1 , 2 , , and if lim n ω 0 { X n } = 0 , then the set X = n = 1 X n is nonempty.
The following fixed-point theorem of the Darbo kind will suffice for our needs, see Pourhadi et al. [34]. Assume that M is a nonempty subset of a Banach space E and the operator H : M E transforms bounded sets into bounded and continuous ones. let us suppose that H satisfies the Darbo condition (with constant α 0 ) with respect to the measure of noncompactness ω 0 if for any bounded subset X of M, we obtain
ω 0 ( H X ) α ω 0 ( X ) .
If H satisfies the Darbo condition with α < 1 , then it is called a contraction with respect to ω 0 .
Theorem 1.
Let Q be a convex, bounded, closed, and nonempty subset of E and ω 0 a measure of noncompactness in E. Let H : Q Q be a contraction with respect to ω 0 . Then, H has at least one fixed point in the set Q.
Theorem 2.
Suppose that Q is a convex, bounded, closed, and nonempty subset of C [ 0 , T ] and the operators F and K mapping continuously the set Q into C [ 0 , T ] such that both F ( Q ) and K ( Q ) are bounded. Additionally, consider that the operator H = F × K transform Q into itself. If the operators F and K satisfy on the set Q the Darbo condition with the constant α 1 and α 2 , respectively, then the operator H satisfies the Darbo condition on Q with the constant
F ( Q ) α 1 + K ( Q ) α 2 .
Particularly, if F ( Q ) α 1 + K ( Q ) α 2 < 1 , then, H has at least one fixed point in the set Q and is a contraction with respect to the measure ω 0 .
In this following, work will be carried out in the classical Banach space C ( [ 0 , T ] × [ 0 , T ] ) , which contains all real functions continuously and defined on ( [ 0 , T ] × [ 0 , T ] ) . For brevity, assume that [ 0 , T ] = I and we write C ( I × I ) in place of C ( [ 0 , T ] × [ 0 , T ] ) . The standard norm Φ = max { | Φ ( x , t ) | : 0 ( x , t ) T } is present in the space C ( I × I ) .
Let us fix a bounded and nonempty subset X of C ( I × I ) . For ε 0 and x X denoted by ω ( x , ε ) , we have
ω ( x , ε ) = sup { | x ( t ) x ( s ) | : ( t , s ) ( I × I ) , | t s | ε } .
Moreover, let us write
ω ( X , ε ) = sup { ω ( x , ε ) : x X } ω 0 ( X ) = lim ε 0 ω ( X , ε ) .

3. Existence of the Solution

In this section, we will discuss the solvability of the quadratic integral equation Equation (1) for ( x , t ) ( [ 0 , T ] × [ 0 , T ] ) . The following integral operator form can be used to represent Equation (1):
Φ ( x , t ) = μ 1 g ( x , t ) + ( μ ) 1 ( H Φ ) ( x , t ) , ( H Φ ) ( x , t ) = ( F Φ ) ( x , t ) × ( K Φ ) ( x , t ) ,
where
( F Φ ) ( x , t ) = E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ ( K Φ ) ( x , t ) = E 2 x , t , 0 x k ( y , t ) Φ ( y , t ) d y .
Suppose that I is any arbitrary real interval and that E 1 is a real function defined on the set I × I × R . The superposition operator V f Φ , E 1 ( x , t ) = E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ is studied under the following hypotheses:
(a) 
E 1 is continuous on the set I × I × R .
(b) 
The function ( x , t ) E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ is nondecreasing on ( I × I ) for any fixed 0 t f ( x , τ ) Φ ( x , τ ) d τ R .
(c) 
For any fixed ( x , t ) ( I × I ) , the function 0 t f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ is nondecreasing on R.
(d) 
With a constant l > 0 , the function E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ satisfies the Lipschitz condition.
We make the following assumptions to discuss the existence of at least one solution of Equation (1):
(i) 
g : I × I R ; E 1 , E 2 : I × I × R R are continuous, nondecreasing functions on the set I × I × R and there exist constant a , b 1 , b 2 0 , such that | g ( x , t ) | a , | E 1 ( x , t , 0 ) | b 1 , | E 2 ( x , t , 0 ) | b 2 .
(ii) 
The functions E 1 , E 2 satisfies the following conditions:
| E 1 ( x , t , y 1 ) E 1 ( x , t , y 2 ) | l 1 ( x , t ) | y 1 y 2 | | E 2 ( x , t , y 1 ) E 2 ( x , t , y 2 ) | l 2 ( x , t ) | y 1 y 2 | ,
where max { l 1 ( x , t ) , l 2 ( x , t ) } l , for all ( x , t ) ( [ 0 , T ] × [ 0 , T ] ) and y 1 , y 2 R .
(iii) 
The kernels f ( x , τ ) , k ( y , t ) belong to the class C ( [ 0 , T ] × [ 0 , T ] ) and satisfy the conditions: | f ( x , τ ) | n 1 , | k ( y , t ) | n 2 , where n 1 and n 2 are two constants.
(iv) 
4 η b < 1 , for η = l T n , max { n 1 , n 2 } n , max { b 1 , b 2 } b .
The main existence theorem can now be formulated.
Theorem 3.
Equation (1) has at least one non-negative, nondecreasing solution, Φ = Φ ( x , t ) , that belongs to the space C ( [ 0 , T ] × [ 0 , T ] ) and is non-negative under the conditions ( i ) ( i v ) .
Proof. 
Consider the operator H that the formula (2) defines on the space C ( I × I ) .
Taking into account the properties of the superposition operator and assumptions ( i ) ( i v ) , we conclude that H Φ is continuous on ( I × I ) for any function Φ C ( I × I ) , i.e., H transforms C ( I × I ) into itself. Moreover, using our conditions, we arrive at the estimation that follows:
| H Φ ( x , t ) | = E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ · E 2 x , t , 0 x k ( y , t ) Φ ( y , t ) d y E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ E 1 ( x , t , 0 ) + | E 1 ( x , t , 0 ) | × E 2 x , t , 0 x k ( y , t ) Φ ( y , t ) d y E 2 ( x , t , 0 ) + | E 2 ( x , t , 0 ) | l 1 ( x , t ) 0 t f ( x , τ ) Φ ( x , τ ) d τ + b 1 × l 2 ( x , t ) 0 x k ( y , t ) Φ ( y , t ) d y + b 2 { l T n 1 Φ + b 1 } · { l T n 2 Φ + b 2 } { l T n Φ + b } 2 .
Then, it is clear from the estimate above that
F Φ η Φ + b K Φ η Φ + b H Φ ( η Φ + b ) 2 .
Using (3), we obtain that the operator H maps the ball B r C ( [ 0 , T ] × [ 0 , T ] ) into itself for ( η Φ + b ) 2 r , where
r 1 = 1 2 η b 1 4 η b 2 η 2 r 2 = 1 2 η b + 1 4 η b 2 η 2 .
Additionally, let us observe that estimations (3) lead to the following
F B r η r + b K B r η r + b .
We now prove that F is continuous on the set B r . To do this, let us fix ε > 0 and choose δ > 0 according to the continuity of F. Further, arbitrarily take Φ , Ψ B r such that Φ Ψ δ . Then, for ( x , t ) ( I × I ) , we deduce
| ( F Φ ) ( x , t ) ( F Ψ ) ( x , t ) | = E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t , 0 t f ( x , τ ) Ψ ( x , τ ) d τ l 1 ( x , t ) 0 t f ( x , τ ) Φ ( x , τ ) d τ 0 t f ( x , τ ) Ψ ( x , τ ) d τ l 1 ( x , t ) n 1 0 t Φ ( x , τ ) d τ 0 t Ψ ( x , τ ) d τ l n 1 T Φ Ψ l n 1 T δ .
F is continuous according to the estimation presented above in the set B r . Similar to this, it is simple to prove that K is continuous on B r , and from this, we derive that H is continuous on B r .
About the measure ω 0 on the ball B r , we now prove that the operators F and K satisfy the Darbo condition. To do this, take a nonempty set Θ such that Θ B r . Additionally, ε > 0 , Φ Θ and | t 2 t 1 | ε , t 1 , t 2 I . Then, utilizing our assumptions, we obtain
| ( F Φ ) ( x , t 2 ) ( F Φ ) ( x , t 1 ) | = E 1 x , t 2 , 0 t 2 f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t 1 , 0 t 1 f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t 2 , 0 t 2 f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t 2 , 0 t 1 f ( x , τ ) Φ ( x , τ ) d τ + E 1 x , t 2 , 0 t 1 f ( x , τ ) Φ ( x , τ ) d τ E 1 x , t 1 , 0 t 1 f ( x , τ ) Φ ( x , τ ) d τ l 1 ( x , t 2 ) 0 t 2 f ( x , τ ) Φ ( x , τ ) d τ 0 t 1 f ( x , τ ) Φ ( x , τ ) d τ + ω ( E 1 , ε ) ( l n r ) | t 2 t 1 | + ω ( E 1 , ε ) .
Consequently, considering our assumptions and the information mentioned above, we obtain the following inequality:
ω 0 ( F Φ ) ( 0 ) ω 0 ( Φ ) .
Similarly, we can show that
| ( K Φ ) ( x , t 2 ) ( K Φ ) ( x , t 1 ) | = E 2 x , t 2 , 0 t 2 k ( x , y ) Φ ( y , t 2 ) d y E 2 x , t 1 , 0 t 1 k ( x , y ) Φ ( y , t 1 ) d y E 2 x , t 2 , 0 t 2 k ( x , y ) Φ ( y , t 2 ) d y E 2 x , t 2 , 0 t 1 k ( x , y ) Φ ( y , t 1 ) d y + E 2 x , t 2 , 0 t 1 k ( x , y ) Φ ( y , t 1 ) d y E 2 x , t 1 , 0 t 1 k ( x , y ) Φ ( y , t 1 ) d y l 2 ( x , t 2 ) 0 t 2 k ( x , y ) Φ ( y , t 2 ) d y 0 t 1 k ( x , y ) Φ ( y , t 1 ) d y + ω ( E 2 , ε ) ( l T n ) | Φ ( y , t 2 ) Φ ( y , t 1 ) | + ω ( E 1 , ε ) .
Then,
ω 0 ( K Φ ) ( l T n ) ω 0 ( Φ ) .
We conclude that operator H satisfies the Darbo condition with regard to the measure ω 0 with the constant ( l T n ) ( η r + b ) by using Equations (4)–(6) and applying Theorem 3. However, we also have
( l T n ) ( η r + b ) = ( l T n ) ( η r 1 + b ) = ( l T n ) η 1 2 η b 1 4 η b 2 η 2 + b = ( l T n ) 1 1 4 η b 2 η < 1 .
Therefore, with regard to ω 0 , the operator H is a contraction on B r . Theorem 3 is thus applied and the result is that H has at least one fixed point in B r . Therefore, there is at least one solution in B r for the quadratic integral equation Equation (1). The proof is now complete. □

4. Hermite-and-Laguerre-Polynomial-Based Collocation Technique

In this section, we utilize numerical approaches to show that the integral Equation (1) is a system of quadratic integral equations of the second kind. For this, we partition the time interval, [ 0 , T ] , 0 t T < 1 , as 0 = t 0 < t 1 < < t n < < t N = T , where t = t n , n = 0 , 1 , , N ; to obtain
μ Φ ( x , t n ) = g ( x , t n ) + E 1 x , t n , 0 t n f ( x , τ ) Φ ( x , τ ) d τ × E 2 x , t n , 0 x k ( y , t n ) Φ ( y , t n ) d y ,
Using the quadrature formula, we have
E 1 x , t n , 0 t n f ( x , τ ) Φ ( x , τ ) d τ = E 1 x , t n , m = 0 n ω m f ( x , t m ) Φ ( x , t m ) + O ( n + 1 ) .
where,
n = max 0 m n ρ m a n d ρ m = t n + 1 t n ,
and ω m is a weight function. In Delves and Mohamed [35], more details on the quadrature coefficients and characteristic points are provided. Using Equation (8) in (7) and neglecting [ O ( n + 1 ) , we obtain
μ Φ ( x , t n ) = g ( x , t n ) + E 1 x , t n , m = 0 n ω m f ( x , t m ) Φ ( x , t m ) × E 2 x , t n , 0 x k ( y , t n ) Φ ( y , t n ) d y .
The collocation technique can be used to solve the previous system of Equation (9). Equation (9) depends on applying the partial sum to approximate the solution; in this case:
S N ( x , t n ) = k = 1 N c k ( t n ) Φ k ( x ) ; n = 0 , 1 , , N
for N a linear function that is independent Φ 1 ( x ) , Φ 2 ( x ) , , Φ N ( x ) in the interval [ 0 , T ] . If we change Φ ( x , t n ) in Equation (9) to the approximate solution of Equation (10), this will produce an error E ( x , c 1 ( t n ) , c 2 ( t n ) , , c N ( t n ) ) that depends on x and t n . Then, we have
μ S N ( x , t n ) = g ( x , t n ) + E 1 x , t n , m = 0 n ω m f ( t n , t m ) S N ( x , t m ) × E 2 x , t n , 0 x k ( y , t n ) S N ( y , t n ) d y + E ( x , c 1 ( t n ) , c 2 ( t n ) , , c N ( t n ) ) .
After utilizing the collocation approach, the error is shown in the Formula (11).
The position interval [ 0 , T ] is divided, where x = x i , 0 i M . In this way, we have
μ S N ( x i , t n ) = g ( x i , t n ) + E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N ( x i , t m ) × E 2 x i , t n , 0 x i k ( y , t n ) S N ( y , t n ) d y .
We utilize the linear independent functions Φ 1 ( x ) , Φ 2 ( x ) , , Φ N ( x ) instead of S N ( x , t n ) in Equation (10) to obtain the coefficients c 1 ( t n ) , c 2 ( t n ) , , c N ( t n ) , of the approximate solution of Equation (11) such that the error E ( x , c 1 ( t n ) , c 2 ( t n ) , , c N ( t n ) ) vanishes. Recurrence relations can be used to solve the system of Equation (12).

5. Convergence of a Solution to the System of Quadratic Integral Equation (12)

To discuss the convergence of solution S N ( x i , t n ) , we build a family of solution S N ( x i , t n ) = { S N , 0 ( x i , t n ) , S N , 1 ( x i , t n ) , , S N , ( x i , t n ) , S N , 1 ( x i , t n ) , } or in a simple form S N ( x i , t n ) = { S N , k ( x i , t n ) } k = 0 .
Consequently, we define two functions S N , 1 ( x i , t n ) , S N , ( x i , t n ) to satisfy the system of quadratic integral Equations (12) and build the sequence of integral equations as
μ S N , ( x i , t n ) = g ( x i , t n ) + E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N , 1 ( x i , t m ) × E 2 x i , t n , 0 x i k ( y , t n ) S N , 1 ( y , t n ) d y ,
and
μ S N , 1 ( x i , t n ) = g ( x i , t n ) + E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N , 2 ( x i , t m ) × E 2 x i , t n , 0 x i k ( y , t n ) S N , 2 ( y , t n ) d y .
From Equations (13) and (14), we can build a new family of corresponding functions of the solution
μ N , ( x i , t n ) = E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N , 1 ( x i , t m )   × E 2 x i , t n , 0 x i k ( y , t n ) S N , 1 ( y , t n ) d y E 2 x i , t n , 0 x i k ( y , t n ) S N , 2 ( y , t n ) d y   + E 2 x i , t n , 0 x i k ( y , t n ) S N , 2 ( y , t n ) d y   × E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N , 1 ( x i , t m ) E 1 x i , t n , m = 0 n ω m f ( x i , t m ) S N , 2 ( x i , t m ) .
In (15), we considered that
N , ( x i , t n ) = S N , ( x i , t n ) S N , 1 ( x i , t n ) .
We derive from (16) that
S N , ( x i , t n ) = k = 0 N , k ( x i , t n ) , N , 0 ( x i , t n ) = g ( x i , t n ) μ 0 .
Theorem 4.
If the series k = 0 N , k ( x i , t n ) is uniformly convergent, then S N ( y , t n ) represents a solution of the system (12), under the conditions ( i ) ( i i i ) , m = 0 n | ω m f ( x i , t m ) | n 1 , and 3 a 2 n 1 n 2 l 2 + b 1 n 2 l + b 2 n 1 l < | μ | .
Proof. 
From Equation (17), conditions in this theorem, and properties of the norm, we obtained the following:
N , ( x i , t n ) Θ N , 1 ( x i , t n ) , Θ = 3 a | μ | 2 n 1 n 2 l 2 + b 1 n 2 l + b 2 n 1 l .
Applying the mathematical induction, with the value of N , 0 ( x i , t n ) and using condition ( i ) , we arrive at
N , ( x i , t n ) Θ 2 a .
The inequality (19) leads to the convergence of the sequence { N , ( x i , t n ) } and also the sequence { S N , ( x i , t n ) } is uniformly convergent. Thus, using Equation (17), we can derive
S N ( x i , t n ) = lim S N , ( x i , t n ) = lim k = 0 N , k ( x i , t n ) .

5.1. Hermite-Polynomial-Based Collocation Technique

Suppose that the known function g ( x , t n ) and the unknown approximation function S N ( x , t n ) have the following forms, respectively.
g ( x , t n ) = k = 1 N g k ( t n ) H k ( x ) = k = 1 N g k , n H k ( x ) S N ( x , t n ) = k = 1 N c k ( t n ) H k ( x ) = k = 1 N c k , n H k ( x ) .
The constants of the given function g k , n may be calculated using the following relation, where c k , n are constants and H k ( x ) is the Hermite function of order k
g k , n = 1 2 k π ( k ! ) e x 2 g n ( x ) H k ( x ) d x ; ( k , n = 0 , 1 , , N ) .
After using the orthogonal polynomials technique, we obtain the known coefficients of the known function from Equation (22).
Then, to obtain the residual equation form, we substitute Equation (21) into Equation (12)
E i , n = μ k = 1 N c k , n H k , i k = 1 N g k , n H k , i E 1 x i , t n , m = 0 n ω m f i , m k = 1 N c k , m H k , i × E 2 x i , t n , k = 1 N c k , n 0 x i k n ( y ) H k ( y ) d y .
where in Equation (23), E i , n are the errors of order ( N × M ) , which vanish at n points of time and i points of position, i.e., E i , n = 0 at 0 = x 0 < x 1 < < x i < < x M = T ; 0 = t 0 < t 1 < < t n < < t N = T .

5.2. Laguerre-Polynomial-Based Collocation Technique

In order to use Laguerre polynomials, we assume
S N ( x , t n ) = k = 1 N c k , n L k ( x ) ; g ( x , t n ) k = 1 N g k , n L k ( x ) .
The values that the constants g k , n in Equation (24) take
g k , n = 0 e x 2 g n ( x ) L k ( x ) d x ; ( k , n = 0 , 1 , , N ) .
After using the orthogonal Laguerre polynomials, Equation (24) yields Equation (25). The residual equation has the following form:
E i , n = μ k = 1 N c k , n L k , i k = 1 N g k , n L k , i E 1 x i , t n , m = 0 n ω m f i , m k = 1 N c k , m L k , i × E 2 x i , t n , k = 1 N c k , n 0 x i k n ( y ) L k ( y ) d y .
In Equation (26), E i , n = 0 at 0 = x 0 < x 1 < < x i < < x M = T ; 0 = t 0 < t 1 < < t n < < t N = T .

6. Numerical Illustrations

In this section, we provide some computational results from numerical examples to show the reliability and accuracy of the proposed technique and validate our theoretical discussion.
Example 1.
Consider the following quadratic integral equation:
Φ ( x , t ) = x 2 + t 2 4 675 t 8 x 5 t 6 5 + t 4 x 2 3 + x t 2 9 0 t x τ 2 Φ ( x , τ ) d τ × x 3 10 0 x t 2 y 2 Φ ( y , t ) d y ,
where, Equation (27) has the exact solution Φ ( x , t ) = x 2 + t 2 , and μ = 1 is constant, describing the kind of Equation (27). It is clear from Equation (27) that the analytical function Φ ( x , t ) depends on the values of the variables t and x. It is noticeable that when t = 0 , we find that the value of the function Φ ( x , 0 ) = x 2 represents a parabola. The original equation Φ ( x , t ) represents an equivalence sector that can be drawn with changes in t and x.
The kernel of time is f ( x , τ ) = x 2 τ 2 , while the kernel of position is k ( y , t ) = t 2 y 2 . The fundamental surface of the material is represented by the given function g ( x , t ) , whereas the unknown function is Φ ( x , t ) . Equation (27) will be computed at time t [ 0 , 0.6 ] .
Table 1, illustrates a comparison between the absolute error of collocation with a Laguerre polynomial solution and collocation with a Hermite polynomial solution. We will observe and derive the changes that occur between the approximate solution and the exact solution for each of the two approaches for various values of x.
In Figure 1 and Figure 2, we show a comparison between the approximate solution, the exact solution, and the absolute error of the solution using the introduced numerical approaches with different values of x.
Example 2.
Consider the following quadratic integral equation when μ = 0.5 :
1 2 Φ ( x , t ) = 1 2 x 2 t 2 1 150 t 17 x 7 t 6 5 + t 4 x 2 3 + t 4 3 0 t x 2 τ 2 Φ ( x , τ ) d τ × x 3 2 0 x t y 2 Φ ( y , t ) d y ,
where, Equation (28) has the exact solution Φ ( x , t ) = x 2 t 2 . The kernel of position is k ( y , t ) = t y 2 , while the kernel of time is f ( x , τ ) = x 2 τ 2 . Equation (28) will be computed at time t [ 0 , 0.1 ] .
Table 2 presents a comparison between the absolute error of collocation with a Laguerre polynomial solution and collocation with a Hermite polynomial solution. For different values of x, we can observe and derive the changes that occur between the approximate solution and the exact solution for each of the two methods.
In Figure 3 and Figure 4, we show a comparison between the approximate solution, the exact solution, and the absolute error of the solution using the proposed numerical approaches with different values of x.
Example 3.
Consider the quadratic integral equation of the second kind:
Φ ( x , t ) = t 2 e x 1 4 t 9 e x ( 2 + e t ( t 2 2 t + 2 ) x 2 + t 2 0 t x τ Φ ( x , τ ) d τ × x 0 x t y 2 Φ ( y , t ) d y ,
where Equation (29) has the exact solution Φ ( x , t ) = t 2 e x , the kernel of position is k ( y , t ) = t y 2 , and the kernel of time is f ( x , τ ) = x τ . Equation (29) will be computed at time t [ 0 , 0.01 ] .
Table 3 shows a comparison between the absolute error of collocation with a Laguerre polynomial solution and collocation with a Hermite polynomial solution. For different values of x, we can observe and derive the changes that occur between the approximate solution and the exact solution for each of the two methods.
In Figure 5 and Figure 6, we show a comparison between the approximate solution, the exact solution, and the absolute error of the solution using the presented numerical approaches with different values of x.
Example 4.
We take into consideration the quadratic integral equation in this case [36]:
Φ ( t ) = t 4 ( 1 + Φ ( t ) 2 ) 1 + 0 1 t τ 16 ( 1 + Φ ( τ ) 2 ) d τ + Φ ( t ) 0 τ t τ 16 ( 1 + Φ ( τ ) 2 ) 2 d τ .
We find the approximate solutions using the procedure provided in this work. The numerical computational results of our approach and the current method in [36] for t = [ 0 , 1 ] are computed and presented in Table 4. The maximum absolute errors of the approach described in our paper and [36] are displayed in Table 5.
In Figure 7, Figure 8, Figure 9 and Figure 10, we present the approximate solution and the exact solution using the proposed numerical approaches and the method in paper [36] with various values of t.

7. Final Remarks

7.1. Discussions and Conclusions on Numerical Solutions

In this study, from the above discussion and results, the following may be concluded,
  • From Example 1, for the quadratic integral equation Equation (27) in Table 1 and Figure 1 and Figure 2, the max. value error of the collocation method via Hermite polynomials is ( 9.236 × 10 7 ) at t [ 0 , 0.6 ] , while the max. value error of the collocation method via Laguerre polynomials is ( 0.000006114 ) at x = 0.9 . In addition, the error of the collocation method via Laguerre and Hermite polynomials is decreasing at x [ 0 , 0.4 ] and increasing at x ( 0.4 , 0.9 ] .
  • In Example 2, for Equation (28) in Table 2 and Figure 3 and Figure 4, the max. value error of the collocation method via Hermite polynomials is ( 7.412 × 10 7 ) at t [ 0 , 0.1 ] , while the max. value error of the collocation method via Laguerre polynomials is ( 9.058 × 10 7 ) . In addition, the error of the collocation method via Hermite polynomials is decreasing at x [ 0 , 0.2 ] and increasing at x ( 0.2 , 0.9 ] , while the error of the collocation method via Laguerre polynomials is decreasing at x [ 0 , 0.1 ] and increasing at x ( 0.1 , 0.9 ] .
  • In Example 3, for Equation (29) of the second kind at 0 t 0.01 in Table 3 and Figure 5 and Figure 6, the max. value error of collocation method via Hermite polynomials is ( 8.21 × 10 19 ) , while the max. value error of the collocation method via Laguerre polynomials is ( 8.99 × 10 18 ) . The errors of the collocation methods via Laguerre and Hermite polynomials increase if the position x increases, and vice versa.
  • From Examples 1–3, we notice that the numerical solution quickly converges to the exact solution when the variable t converges to 0. When the variable x takes the value x = 0.9 , we obtain a maximum value of the error; conversely, we find a minimum value of the error at x = 0 .
  • In Example 4, we discussed Equation (30), which was discussed previously in [36]. We can see from Table 4 and Table 5, and Figure 7, Figure 8, Figure 9 and Figure 10 that the method studied in this article is more accurate in terms of results and better in providing a numerical solution closer to the exact solution.

7.2. Conclusions

Based on the results of this work, we can establish the following:
  • In this research, a quadratic integral equation is discussed in a general form, in the space C ( [ 0 , T ] × [ 0 , T ] ) , T < 1 , from which many special cases can be derived. These special cases are considered important in application in many different fields.
  • If in Equation (1), we let E 2 = 1 , we have a nonlinear integral equation
    μ Φ ( x , t ) = g ( x , t ) + E 1 x , t , 0 t f ( x , τ ) Φ ( x , τ ) d τ .
    The above equation also has many applications in different fields.
  • It is noted that the squaring method, which depends on dividing one of the variables into distances that may be equal or unequal, directly helps transform the quadratic integral equation in two variables into an algebraic system of quadratic integral equations in one variable.
  • Combining the collocation method and orthogonal polynomials enables researchers to obtain more accurate and less error-prone solutions compared to other methods.

8. Future Work

The authors will consider the solution of the principal equation of this paper in two-dimensional problem with phase-lag in time:
μ Φ ( x , t + δ t ) = g ( x , t + δ t ) + E 1 x , t + δ t , 0 t + δ t f ( x , τ ) Φ ( x , τ ) d τ × E 2 x , t + δ t , 0 x k ( y , t + δ t ) Φ ( y , t + δ t ) d y , 0 < δ t < 1 .

Author Contributions

Conceptualization, J.A., M.A.A. and M.A.A.-A.; Methodology, M.A.A. and M.A.A.-A.; Software, M.A.A.-A.; Validation, J.A.; Formal analysis, M.A.A.; Writing—original draft, M.A.A.-A.; Writing—review and editing, J.A., M.A.A. and M.A.A.-A.; Supervision, M.A.A.; Funding acquisition, J.A. All authors have read and agreed to the published version of the manuscript.

Funding

Prince Sattam bin Abdulaziz University through the project number (PSAU/2023/01/26664).

Data Availability Statement

All data generated or analyzed during this study are included in this submitted article.

Acknowledgments

The authors would like to thank the Editorial Board and the reviewers for their constructive suggestions and comments that greatly improved the final version of this paper. Furthermore, The authors extend their appreciation to Prince Sattam bin Abdulaziz University for funding this research work through the project number (PSAU/2023/01/26664).

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Alhazmi, S.E.A. New Model for Solving Mixed Integral Equation of the First Kind with Generalized Potential Kernel. J. Math. Res. 2017, 9, 18–29. [Google Scholar] [CrossRef]
  2. Ghiat, M.; Tair, B.; Ghuebbai, H.; Kamouche, S. Block-by-block method for solving non-linear Volterra integral equation of the first kind. Comp. Appl. Math. 2023, 42, 42–67. [Google Scholar] [CrossRef]
  3. Gong, W.; Li, B.; Yang, H. Optimal Control in a Bounded Domain for Wave Propagating in the Whole Space: Coupling Through Boundary Integral Equations. J. Sci. Comput. 2022, 92, 91. [Google Scholar] [CrossRef]
  4. Jaabar, S.H.; Hussain, A.H. Solving Volterra integral equation by using a new transformation. J. Interdiscip. Math. 2021, 24, 735–741. [Google Scholar] [CrossRef]
  5. Matoog, R.T.; Abdou, M.A.; Abdel-Aty, M.A. New algorithms for solving nonlinear mixed integral equations. AIMS Math. 2023, 8, 27488–27512. [Google Scholar] [CrossRef]
  6. Ma, Z.; Huang, C. Fractional Collocation Method for Third-Kind Volterra Integral Equations with Nonsmooth Solutions. J. Sci. Comput. 2023, 95, 26. [Google Scholar] [CrossRef]
  7. Micula, S. On some iterative numerical methods for a Volterra functional integral equation of the second kind. J. Fixed Point Theory Appl. 2017, 19, 1815–1824. [Google Scholar] [CrossRef]
  8. Micula, S. An iterative numerical method for Fredholm–Volterra integral equations of the second kind. Appl. Math. Comput. 2015, 270, 935–942. [Google Scholar] [CrossRef]
  9. Sarkar, N.; Sen, M.; Saha, D. Solution of non linear Fredholm integral equation involving constant delay by BEM with piecewise linear approximation. J. Interdiscip. Math. 2020, 23, 537–544. [Google Scholar] [CrossRef]
  10. Fatahi, H.; Saberi–Nadjafi, J.; Shivanian, E. A new spectral meshless radial point interpolation(SMRPI) method for the two–dimensional Fredholm integral equations on general domains with error analysis. J. Comput. Appl. Math. 2016, 294, 196–209. [Google Scholar] [CrossRef]
  11. Noeiaghdam, S.; Dreglea, A.; He, J.; Avazzadeh, Z.; Suleman, M.; Fariborzi Araghi, M.A.; Sidorov, D.N.; Sidorov, N. Error estimation of the homotopy perturbation method to solve second kind Volterra integral equations with piecewise smooth kernels. Application of the CADNA library. Symmetry 2020, 12, 1730. [Google Scholar] [CrossRef]
  12. Jaan, A.R. Solution of nonlinear mixed integral equation via collocation method basing on orthogonal polynomials. Heliyon 2022, 8, e11827. [Google Scholar] [CrossRef]
  13. Abusalim, S.A.; Abdou, M.A.; Nasr, M.E.; Abdel–Aty, M.A. An Algorithm for the Solution of Nonlinear Volterra–Fredholm Integral Equations with a Singular Kernel. Fractal Fract 2023, 7, 730. [Google Scholar] [CrossRef]
  14. Abdel–Aty, M.A.; Abdou, M.A. Analytical and Numerical Discussion for the Phase-Lag Volterra-Fredholm Integral Equation with Singular Kernel. J. Appl. Anal. Comput. 2023, 13, 3203–3220. [Google Scholar] [CrossRef] [PubMed]
  15. Abusalim, S.A.; Abdou, M.A.; Abdel–Aty, M.A.; Nasr, M.E. Hybrid Functions Approach via Nonlinear Integral Equations with Symmetric and Nonsymmetrical Kernel in Two Dimensions. Symmetry 2023, 15, 1408. [Google Scholar] [CrossRef]
  16. Adibi, H.; Shamooshaky, M.; Assar, P. CAS wavelet method for the numerical solution of boundary integral equations with logarithmic singular kernels. Int. J. Math. Model. Comput. 2014, 4, 377–387. [Google Scholar]
  17. Abdel–Aty, M.A.; Abdou, M.A.; Soliman, A.A. Solvability of quadratic integral equations with singular kernel. J. Contemp. Math. Anal. 2022, 57, 12–25. [Google Scholar] [CrossRef]
  18. Mirzaee, F.; Hoseini, S.F. Application of Fibonacci collocation method for solving Volterra–Fredholm integral equations. Appl. Math. Comput. 2016, 273, 637–644. [Google Scholar] [CrossRef]
  19. Hesameddini, E.; Shahbazi, M. Solving system of Volterra–Fredholm integral equations with Bernstein polynomials and hybrid Bernstein Block-Pulse functions. J. Comput. Appl. Math. 2017, 315, 182–194. [Google Scholar] [CrossRef]
  20. Alhazmi, S.E.A. Certain results associated with mixed integral equations and their comparison via numerical methods. J. Umm Al-Qura Univ. Appl. Sci. 2023, 9, 57–66. [Google Scholar] [CrossRef]
  21. Mirzaee, F.; Hadadiyan, E. Numerical solution of linear Fredholm integral equations via two–dimensional modification of hat functions. Appl. Math. Comput. 2015, 250, 805–816. [Google Scholar] [CrossRef]
  22. Bazm, S. Bernoulli polynomials for the numerical solution of some classes of linear and nonlinear integral equations. J. Comput. Appl. Math. 2015, 275, 44–60. [Google Scholar] [CrossRef]
  23. Mirzaee, F.; Samadyar, N. On the numerical solution of stochastic quadratic integral equations via operational matrix method. Math. Methods Appl. Sci. 2018, 41, 4465–4479. [Google Scholar] [CrossRef]
  24. Benkerrouche, A.; Souid, M.S.; Stamov, G.; Stamova, I. On the solutions of a quadratic integral equation of the Urysohn type of fractional variable order. Entropy 2022, 24, 886. [Google Scholar] [CrossRef]
  25. Heydari, M.H. A computational method for a class of systems of nonlinear variable-order fractional quadratic integral equations. Appl. Numer. Math. 2020, 153, 164–178. [Google Scholar] [CrossRef]
  26. Metwali, M. On some properties of Riemann–Liouville fractional operator in Orlicz spaces and applications to quadratic integral equations. Filomat 2022, 36, 6009–6020. [Google Scholar] [CrossRef]
  27. Abdou, M.A.; Soliman, A.A.; Abdel-Aty, M.A. Analytical results for quadratic integral equations with phase-lag term. J. Appl. Anal. Comput. 2020, 10, 1588–1598. [Google Scholar] [CrossRef]
  28. El–Sayed, A.M.A.; Hashem, H.H.G.; Omar, Y.M.Y. Positive continuous solution of a quadratic integral equation of fractional orders. Math. Sci. Lett. 2013, 2, 19–27. [Google Scholar] [CrossRef]
  29. Abdel–Aty, M.A.; Abdou, M.A. Analytical and numerical discussion for the quadratic integral equations. Filomat 2023, 37, 8095–8111. [Google Scholar] [CrossRef]
  30. Mirzaee, F.; Hadadiyan, E. Application of modified hat functions for solving nonlinear quadratic integral equations. Iran J. Numer. Anal. Opt. 2016, 6, 65–84. [Google Scholar] [CrossRef]
  31. Arab, R.; Allahyari, R. Shole Haghighi, A. Existence of solutions of infinite systems of integral equations in two variables via measure of noncompactness. Appl. Math. Comput. 2014, 246, 283–291. [Google Scholar] [CrossRef]
  32. Basseem, M.; Alalyani, A. On the solution of quadratic nonlinear integral Equation with different singular kernels. Math. Probl. Eng. 2020, 2020, 7856207. [Google Scholar] [CrossRef]
  33. Banaś, J.; Jleli, M.; Mursaleen, M.; Samet, B.; Vetro, C. (Eds.) Advances in Nonlinear Analysis via the Concept of Measure of Noncompactness; Springer Nature: Singapore, 2017. [Google Scholar] [CrossRef]
  34. Pourhadi, E.; Saadati, R.; Nieto, J.J. On the attractivity of the solutions of a problem involving Hilfer fractional derivative via the measure of noncompactness. Fixed Point Theory 2023, 24, 343–366. [Google Scholar] [CrossRef]
  35. Delves, L.M.; Mohamed, J.L. Computational Methods for Integral Equations; Cambridge University Press: New York, NY, USA, 1988. [Google Scholar]
  36. Mishra, L.N.; Pathak, V.K.; Baleanu, D. Approximation of solutions for nonlinear functional integral equations. AIMS Math. 2022, 7, 17486–17506. [Google Scholar] [CrossRef]
Figure 1. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.6 .
Figure 1. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.6 .
Axioms 13 00621 g001
Figure 2. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.6 .
Figure 2. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.6 .
Axioms 13 00621 g002
Figure 3. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.1 .
Figure 3. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.1 .
Axioms 13 00621 g003
Figure 4. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.1 .
Figure 4. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.1 .
Axioms 13 00621 g004
Figure 5. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.01 .
Figure 5. Exact solution, approximate solution, and absolute error of Hermite Polys. For 0 t 0.01 .
Axioms 13 00621 g005
Figure 6. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.01 .
Figure 6. Exact solution, approximate solution, and absolute error of Laguerre Polys. For 0 t 0.01 .
Axioms 13 00621 g006
Figure 7. Approximate and exact solutions of Hermite and Laguerre Polys for Φ 1 ( t ) .
Figure 7. Approximate and exact solutions of Hermite and Laguerre Polys for Φ 1 ( t ) .
Axioms 13 00621 g007
Figure 8. Approximate solution and exact solution for Φ 1 ( t ) of [36].
Figure 8. Approximate solution and exact solution for Φ 1 ( t ) of [36].
Axioms 13 00621 g008
Figure 9. Approximate and exact solutions of Hermite and Laguerre Polys for Φ 2 ( t ) .
Figure 9. Approximate and exact solutions of Hermite and Laguerre Polys for Φ 2 ( t ) .
Axioms 13 00621 g009
Figure 10. Approximate solution and exact solution for Φ 2 ( t ) of [36].
Figure 10. Approximate solution and exact solution for Φ 2 ( t ) of [36].
Axioms 13 00621 g010
Table 1. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with t [ 0 , 0.6 ] .
Table 1. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with t [ 0 , 0.6 ] .
x i Exact Sol.Hermite Polys.Error of HermiteLaguerre Polys.Error of Laguerre
00.090.0899999782.236 × 10 8 0.0899995974.034 × 10 7
0.10.10.0999999982.122 × 10 9 0.099999973.025 × 10 8
0.20.130.1299999981.634 × 10 9 0.1299999762.369 × 10 8
0.30.180.1799999981.585 × 10 9 0.1799999782.164 × 10 8
0.40.250.2499999991.208 × 10 9 0.2499999792.112 × 10 8
0.50.340.3399999178.266 × 10 8 0.3399990389.624 × 10 7
0.60.450.4499993486.524 × 10 7 0.449997182.821 × 10 6
0.70.580.5799993076.932 × 10 7 0.5799966310.000003369
0.80.730.7299991268.741 × 10 7 0.7299949980.000005002
0.90.90.8999990769.236 × 10 7 0.8999938860.000006114
Table 2. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with 0 t 0.1 .
Table 2. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with 0 t 0.1 .
x i Exact Sol.Hermite Polys.Error of HermiteLaguerre Polys.Error of Laguerre
0.008.652 × 10 10 8.652 × 10 10 2.587 × 10 9 2.587 × 10 9
0.10.0000252.499 × 10 5 5.411 × 10 11 2.499 × 10 5 2.631 × 10 10
0.20.00011.000 × 10 4 4.754 × 10 11 9.999 × 10 5 5.231 × 10 10
0.30.0002250.0002249998.758 × 10 10 0.0002249937.418 × 10 9
0.40.00040.0003999999.587 × 10 10 0.0003999918.648 × 10 9
0.50.0006250.000624999.632 × 10 9 0.0006249386.235 × 10 8
0.60.00090.000899999.961 × 10 9 0.0008999287.231 × 10 8
0.70.0012250.0012249673.254 × 10 8 0.0012249049.624 × 10 8
0.80.00160.0015999356.523 × 10 8 0.0015991368.645 × 10 7
0.90.0020250.0020249267.412 × 10 8 0.0020240949.058 × 10 7
Table 3. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with 0 t 0.01 .
Table 3. Error and Numerical Results of Collocation via Laguerre and Hermite Polynomials with 0 t 0.01 .
x i Exact Sol.Hermite Polys.Error of HermiteLaguerre Polys.Error of Laguerre
00.0000250.0000253.22 × 10 25 0.0000255.25 × 10 22
0.12.763 × 10 5 2.763 × 10 5 7.13 × 10 24 2.763 × 10 5 5.99 × 10 22
0.23.053 × 10 5 3.053 × 10 5 5.68 × 10 22 3.053 × 10 5 2.37 × 10 21
0.33.375 × 10 5 3.375 × 10 5 6.03 × 10 22 3.375 × 10 5 1.03 × 10 20
0.43.730 × 10 5 3.730 × 10 5 6.90 × 10 22 3.730 × 10 5 5.21 × 10 20
0.54.122 × 10 5 4.122 × 10 5 6.07 × 10 20 4.122 × 10 5 7.26 × 10 19
0.64.555 × 10 5 4.555 × 10 5 7.11 × 10 20 4.555 × 10 5 9.37 × 10 19
0.75.034 × 10 5 5.034 × 10 5 7.57 × 10 20 5.034 × 10 5 3.37 × 10 18
0.85.564 × 10 5 5.564 × 10 5 8.26 × 10 20 5.564 × 10 5 6.32 × 10 18
0.96.149 × 10 5 6.149 × 10 5 8.21 × 10 19 6.149 × 10 5 8.99 × 10 18
Table 4. Comparison of the absolute errors of the methods presented in this article and the method presented in [36] with 0 t 1 .
Table 4. Comparison of the absolute errors of the methods presented in this article and the method presented in [36] with 0 t 1 .
Error of Φ 1 ( t ) Error of Φ 2 ( t )
t of Hermiteof LaguerreMethod of [36]of Hermiteof LaguerreMethod of [36]
005.931 × 10 5 03.147 × 10 5 4.587 × 10 5 1.61 × 10 2
0.15.741 × 10 5 4.635 × 10 4 3 × 10 4 4.563 × 10 5 5.965 × 10 5 1.59 × 10 2
0.27.411 × 10 5 5.963 × 10 4 1.9 × 10 3 4.654 × 10 5 6.456 × 10 5 1.42 × 10 2
0.37.952 × 10 5 6.524 × 10 3 5.9 × 10 3 5.952 × 10 5 2.457 × 10 4 1.01 × 10 2
0.48.853 × 10 5 6.852 × 10 3 1.3 × 10 2 6.258 × 10 5 4.213 × 10 4 3.8 × 10 3
0.53.531 × 10 4 7.528 × 10 3 2.34 × 10 2 7.856 × 10 5 6.547 × 10 4 4.2 × 10 3
0.64.204 × 10 4 7.968 × 10 3 3.68 × 10 2 2.047 × 10 4 7.698 × 10 4 1.29 × 10 2
0.76.824 × 10 4 8.521 × 10 3 5.3 × 10 2 3.965 × 10 4 8.472 × 10 4 2.12 × 10 2
0.85.632 × 10 3 9.124 × 10 3 7.15 × 10 2 2.854 × 10 3 5.368 × 10 3 2.82 × 10 2
0.93.541 × 10 2 5.232 × 10 2 9.18 × 10 2 3.147 × 10 3 6.147 × 10 3 3.42 × 10 2
1.05.223 × 10 2 7.852 × 10 2 1.135 × 10 1 4.567 × 10 3 8.210 × 10 3 3.91 × 10 2
Table 5. Comparison of the maximum errors of the methods presented in this article and the method presented in [36] with 0 t 1 .
Table 5. Comparison of the maximum errors of the methods presented in this article and the method presented in [36] with 0 t 1 .
       Φ 1 ( t )        Φ 2 ( t )
Maximum errors of Hermite      5.223 × 10 2       4.567 × 10 3
Maximum errors of Laguerre      7.852 × 10 2       8.210 × 10 3
Maximum errors of [36]      1.135 × 10 1       3.91 × 10 2
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

Alahmadi, J.; Abdou, M.A.; Abdel-Aty, M.A. Analytical and Numerical Approaches via Quadratic Integral Equations. Axioms 2024, 13, 621. https://doi.org/10.3390/axioms13090621

AMA Style

Alahmadi J, Abdou MA, Abdel-Aty MA. Analytical and Numerical Approaches via Quadratic Integral Equations. Axioms. 2024; 13(9):621. https://doi.org/10.3390/axioms13090621

Chicago/Turabian Style

Alahmadi, Jihan, Mohamed A. Abdou, and Mohamed A. Abdel-Aty. 2024. "Analytical and Numerical Approaches via Quadratic Integral Equations" Axioms 13, no. 9: 621. https://doi.org/10.3390/axioms13090621

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