Next Article in Journal
Study on Uniaxial Compression Deformation and Fracture Development Characteristics of Weak Interlayer Coal–Rock Combination
Previous Article in Journal
On Stability of a Fractional Discrete Reaction–Diffusion Epidemic Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Algorithm for the Solution of Nonlinear Volterra–Fredholm Integral Equations with a Singular Kernel

by
Sahar M. Abusalim
1,
Mohamed A. Abdou
2,
Mohamed E. Nasr
1,3 and
Mohamed A. Abdel-Aty
3,*
1
Department of Mathematics, College of Science and Arts, Jouf University, Al-Qurayyat 77455, Saudi Arabia
2
Department of Mathematics, Faculty of Education, Alexandria University, Alexandria 21511, Egypt
3
Department of Mathematics, Faculty of Science, Benha University, Benha 13518, Egypt
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(10), 730; https://doi.org/10.3390/fractalfract7100730
Submission received: 19 July 2023 / Revised: 13 September 2023 / Accepted: 24 September 2023 / Published: 2 October 2023

Abstract

:
The nonlinear Volterra–Fredholm integral Equation (NVFIE) with a singular kernel is discussed such that the kernel of position can take the Hilbert kernel form, Carleman function, logarithmic form, or Cauchy kernel. Using the quadrature method, the NVFIE with a singular kernel leads to a system of nonlinear integral equations. The existence and unique numerical solution of this system is discussed, as is the truncation error of the numerical solution. The solution of the nonlinear integral equation system is obtained using the spectral relations and techniques of the Chebyshev polynomial method. Finally, we will discuss examples of when the kernel takes various forms to demonstrate this technique’s high accuracy and simplicity. Some numerical results and estimating errors are calculated and plotted using the program Wolfram Mathematica 10.

1. Introduction

Integral equations often appear in mathematical modeling, which has engineering, life sciences, and physics applications. Specific fields include, for instance, telecommunications, biology, heat transfer, the dynamics of population, elasticity, epidemiology, genetics, hydrodynamics, and viscoelasticity [1,2,3]. Integral equations (IEs) have different names based on their shape. In other words, depending on the limits of integration, an IE could have fixed limits (Fredholm IE), variable limits (Volterra IE), or both in the same equation (Fredholm–Volterra IE), with the unknown function only showing up inside the integration (the first type of IE), outside the integration (the second type of IE), or both inside and outside the integration (the third type of IE). The integral equations of the Fredholm–Volterra type appear in two forms: the first is the Fredholm–Volterra disjoint integral [4], and the other form is mixed, so that these two integrals are in one term multiple integrals (for more details, see [5,6,7]).
Due to the difficulty in obtaining an exact solution for the integral equations of the Volterra–Fredholm type, we tend to use numerical methods [8]. Recently, different computational techniques have been developed to obtain the approximate solution of the nonlinear and linear integral equations of the Volterra–Fredholm type. In [9], the Taylor series expansion is an important method that has been developed. Two powerful methods can often provide the exact solution in some cases: the modified decomposition method [10] and the Adomian decomposition method [11]. Collocation methods have become very popular and have attracted the attention of many researchers. They are based on general approximate functions, Bernstein polynomials, Chelyshkov polynomials, Fibonacci polynomials, Boubaker polynomials, Bell polynomials, Lucas polynomials, Muntz–Legendre polynomials, Jacobi polynomials, Bernoulli polynomials, and block-pulse functions. Galerkin methods are also one of the methods that attracted the attention of researchers and are widely used with general approximate functions, Bernstein polynomials [12], Legendre polynomials [13], Alpert’s multiwavelet bases [14], and conflict-type wavelets [15]. Furthermore, among the numerical methods that have been developed are the Quadrature methods [16], Homotopy analysis methods [17], Modified homotopy perturbation methods [18], and least squares approximation methods [19]. Several typical examples of iterative approximation methods are the block-by-block method and Runge–Kutta method [20], optimal perturbation iteration method [21], and Picard iteration method [22]. Fixed point methods are some of the methods that have been used successfully, especially those based on rationalized Haar wavelets [23], fixed point methods in extended b-metric space [24], Schauder bases in an adequate Banach space [25], and Schauder bases [26]. Among the numerical methods that were also introduced using Hosoya polynomials [27], there are Haar wavelets [1], Bernstein polynomials [28], hyperbolic basis functions [29], and block-pulse functions [30]. Some of the methods that have been reported to be successful include a neural network approach [31], Tau methods [32], and parameter continuation methods [33]. Finally, we considered the results of uniqueness and existence in [34,35].
In this present study, we consider the NVFIE with a singular kernel of the second type. The kernel of the position can take the Hilbert kernel, Carleman form, logarithmic form, or Cauchy kernel. The continuity and boundedness of the integral operator are studied and proved in Section 2. The stability and rate of convergence of the proposed scheme are introduced in Section 3. In Section 4, we use the quadrature method to reduce the solution of Equation (1) to the system of nonlinear Fredholm integral equations. The techniques of the Chebyshev polynomial method and some spectral relations used to find a solution of the system of the algebraic integral are presented in Section 5. The existence and unique numerical solution of this system are discussed, and the truncation error of the numerical solution is presented in Section 6, while Section 7 solves various illustrative examples using the program Wolfram Mathematica 10 to show the efficiency of the method. Finally, some conclusions and remarks are given in Section 8.
Now, we will study the solvability of the following NVFIE with the singular kernel:
μ Ψ ( u , t ) λ 0 t 1 1 f ( t , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t , τ , Ψ ( v , τ ) ) d v d τ = F ( u , t ) .
Here, F ( u , t ) and γ ( u , v , t , τ , Ψ ( v , τ ) ) are two given functions, while the function Ψ ( u , t ) is unknown in the Banach space L 2 [ 1 , 1 ] × C [ 0 , T ] , where the time t [ 0 , T ] , T < 1 . The kernel of position for u , v [ 1 , 1 ] , k ( w ( u ) w ( v ) ) has a singularity at w ( u ) = w ( v ) , where the two functions w ( u ) , w ( v ) are continuous functions. The kernel of time f ( t , τ ) , t , τ [ 0 , T ] , T < 1 is continuous in class C [ 0 , T ] . The constant μ determines the type of the integral equation, whereas λ is a complex constant with a distinct physical meaning.

2. The Existence and Unique Solution of Equation (1)

The Banach fixed point theorem will be used in this section as a source of the existence and uniqueness of the solution of Equation (1). To discuss its existence and unique solution, Equation (1) can be expressed in the integral operator form as follows:
V ¯ Ψ ( u , t ) = 1 μ F ( u , t ) + 1 μ V Ψ ( u , t ) ; μ 0 ,
where
V Ψ ( u , t ) = λ 0 t 1 1 f ( t , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t , τ , Ψ ( v , τ ) ) d v d τ .
We assume the following:
(i)
The kernel of position k ( w ( u ) w ( v ) ) satisfies the discontinuity condition
1 1 1 1 | k ( w ( u ) w ( v ) ) | 2 d u d v 1 2 = ϰ ; u , v [ 1 , 1 ] ; ϰ is a constant .
(ii)
The kernel of time f ( t , τ ) is continuous and satisfies
| f ( t , τ ) | ς ; t , τ [ 0 , T ] , 0 τ t T < 1 ; ς is a constant .
(iii)
The norm of the continuous given function F ( u , t ) is defined as
F ( u , t ) L 2 [ 1 , 1 ] × C [ 0 , T ] = max 0 t T 0 t 1 1 F 2 ( u , τ ) d u 1 2 d τ = ϖ ; ϖ is a constant .
(iv)
The known function γ ( u , v , t , τ , Ψ ( u , t ) ) for the constants ε and ϑ satisfies:
( a ) | γ ( u , v , t , τ , Ψ ( u , t ) ) | L 1 ( u , v ; t , τ ) | Ψ ( u , t ) | ( b ) | γ ( u , v , t , τ , Ψ 1 ( u , t ) ) γ ( u , v , t , τ , Ψ 2 ( u , t ) ) | L 2 ( u , v ; t , τ ) | ψ 1 ( u , t ) ψ 2 ( u , t ) | ,
where
L 1 ( u , v ; t , τ ) = max 0 τ t T < 1 0 t 1 1 1 1 | L 1 ( u , v ; t , τ ) | 2 d u d v 1 2 d τ = ε L 2 ( u , v ; t , τ ) = max 0 τ t T < 1 0 t 1 1 1 1 | L 2 ( u , v ; t , τ ) | 2 d u d v 1 2 d τ = ϑ .
We must note that the normality of the unknown function Ψ ( u , t ) in the space of integration L 2 [ 1 , 1 ] × C [ 0 , T ] is Ψ ( u , t ) L 2 [ 1 , 1 ] × C [ 0 , T ] = max 0 t T 0 t 1 1 Ψ 2 ( u , τ ) d u 1 2 d τ .
Theorem 1. 
If the conditions (i)–(iv) are satisfied, then Equation (1) has a unique solution in the Banach space L 2 [ 1 , 1 ] × C [ 0 , T ] .
We have to consider the following lemmas in order to prove the previous theorem:
Lemma 1. 
Under the conditions (i)–(iv-a), the operator V ¯ maps the space L 2 ( 1 , 1 ) × C [ 0 , T ] into itself.
Proof. 
From the two Formulas (2) and (3), we have
V ¯ Ψ ( u , t ) 1 | μ | F ( u , t ) + | λ | | μ | 0 t 1 1 | f ( t , τ ) | | k ( w ( u ) w ( v ) ) | | γ ( u , v , t , τ , Ψ ( v , τ ) ) | d v d τ .
Using the conditions (ii) and (iii), then applying Cauchy–Schwarz inequality, we obtain
V ¯ Ψ ( u , t ) ϖ | μ | + | λ | | μ | ς 1 1 1 1 | k ( w ( u ) w ( v ) ) | 2 d u d v 1 2 × max 0 τ t T 0 t 1 1 1 1 | γ ( u , v , t , τ , Ψ ( v , τ ) ) | 2 d u d v 1 2 d τ .
From the conditions (i) and (iv-a), the above inequality takes the form of
V ¯ ψ ( u , t ) ϖ | μ | + β ψ ( u , t ) , β = | λ | | μ | ς ϰ σ , σ = max { ε , ϑ } .
As provided by inequality (4), the operator V ¯ maps the ball S r into itself, where
r = ϖ ( | μ | | λ | ς ϰ σ ) .
Since r > 0 , ϖ > 0 , we, therefore, have β < 1 . Additionally, inequality (5) includes the boundedness of the operator V of Equation (3), where
V ψ ( u , t ) β ψ ( u , t ) .
Moreover, inequalities (4) and (6) define the boundedness of the operator V ¯ . □
Lemma 2. 
Assume that the conditions (i), (ii), and (iv-b) are verified; then, V ¯ is a contraction operator in the space L 2 [ 1 , 1 ] × C [ 0 , T ] .
Proof. 
For the functions ψ 1 ( u , t ) , ψ 2 ( u , t ) in L 2 [ 1 , 1 ] × C [ 0 , T ] , and from Equations (2) and (3), we find
V ¯ Ψ 1 ( u , t ) V ¯ Ψ 2 ( u , t ) | λ | | μ | 0 t 1 1 | f ( t , τ ) | | k ( w ( u ) w ( v ) ) | | γ ( u , v , t , τ , Ψ 1 ( v , τ ) ) γ ( u , v , t , τ , Ψ 2 ( v , τ ) ) | d v d τ .
The above inequality becomes, via conditions (ii) and (iv-b) in the following:
V ¯ Ψ 1 ( u , t ) V ¯ Ψ 2 ( u , t ) | λ | | μ | ς 0 t 1 1 | k ( w ( u ) w ( v ) ) | L ( u , v , t , τ ) ψ 1 ( u , t ) ψ 2 ( u , t ) d v d τ .
Applying the Cauchy–Schwarz inequality to the integral term, and then using (i), we finally obtain
V ¯ Ψ 1 ( u , t ) V ¯ Ψ 2 ( u , t ) β Ψ 1 ( u , t ) ψ 2 ( u , t ) .
With the aid of inequality (7), the operator V ¯ is continuous in L 2 [ 1 , 1 ] × C [ 0 , T ] , and then V ¯ is a contraction operator under the condition β < 1 . □
Proof of Theorem 1. 
From the above Lemmas 1 and 3, we deduced that the operator V ¯ of Equation (2) is contractive in the Banach space L 2 [ 1 , 1 ] × C [ 0 , T ] . Thus, V ¯ has a unique fixed point, which is the unique solution of Equation (1). □

3. The Stability and Rate of Convergence

Here, we introduced the stability and rate of convergence of the proposed scheme.
Lemma 3. 
Besides the conditions (i)–(iv), the infinite series i = 0 Φ i ( u , t ) is uniformly convergent to a continuous solution function Ψ ( u , t ) .
Proof. 
We construct the sequence of functions Ψ n ( u , t ) as
μ Ψ n ( u , t ) = F ( u , t ) + λ 0 t 1 1 f ( t , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t , τ , Ψ n 1 ( v , τ ) ) d v d τ F ( u , t ) = Ψ 0 ( u , t ) .
Then, we introduce
Φ n ( u , t ) = Ψ n ( u , t ) Ψ n 1 ( u , t ) , Φ 0 ( u , t ) = F ( u , t ) ,
where
Ψ n ( u , t ) = i = 0 n Φ n ( u , t ) , n = 1 , 2 , .
Using the properties of the modulus, and then with the aid of Formula (8), we have
Φ n ( u , t ) | λ | | μ | ς σ . 1 1 1 1 | k ( w ( u ) w ( v ) ) | 2 d u d v 1 2 × max 0 t T 0 t 1 1 | Φ n 1 ( v , τ ) ) | 2 d v 1 2 d τ .
Hence, we obtain
Φ n ( u , t ) L 2 [ 1 , 1 ] × C [ 0 , T ] β Φ n 1 ( u , t ) ; β = λ μ ς ϰ σ .
Using the conditions (i) and (ii) and the mathematical induction method, we obtain
Φ n ( u , t ) L 2 [ 1 , 1 ] × C [ 0 , T ] β n Φ n 1 ( u , t ) ; β = λ μ ς ϰ σ .
This bound makes the sequence { Φ n ( u , t ) } converge, and then, the sequence { Ψ n ( u , t ) } converges. Hence, the infinite series
Ψ ( u , t ) = i = 0 Φ i ( u , t ) , t [ 0 , T ] ,
is uniformly convergent since the terms { Φ i ( u , t ) } are dominated by β i . □

4. The System of Fredholm Integral Equations

The solution of Equation (1) is often reduced to a system of Fredholm integral equations using the quadrature method [36]. We divide the interval [ 0 , T ] , 0 t T , as 0 = t 0 < t 1 < < t m < < t M = T , where t = t m , m = 0 , 1 , , M to obtain
μ Ψ ( u , t m ) λ 0 t m 1 1 f ( t m , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t m , τ , Ψ ( v , τ ) ) d v d τ = F ( u , t m ) .
The term for the Volterra integral is as follows:
0 t m 1 1 f ( t m , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t m , τ , Ψ ( v , τ ) ) d v d τ = l = 0 m ν l f ( t m , t l ) 1 1 k ( w ( u ) w ( v ) ) γ ( u , v , t m , t l , Ψ ( v , t l ) ) d v + O ( m + 1 ) ,
where
m + 1 0 , > 0 , m = max 0 l m Δ l and Δ l = t l + 1 t l .
The constant and the values of the weight formula ν l depend on the number of derivatives f ( t , τ ) , τ [ 0 , T ] , with respect to t.
  • Using Equation (10) in Equation (9), we obtain
μ Ψ ( u , t m ) λ l = 0 m ν l f ( t m , t l ) 1 1 k ( w ( u ) w ( v ) ) γ ( u , v , t m , t l , Ψ ( v , t l ) ) d v = F ( u , t m ) ,
using the notations below:
Ψ ( u , t m ) = Ψ m ( u ) , F ( u , t m ) = F m ( u ) , f ( t m , t l ) = f m , l .
Equation (11) can be rewritten in the following form:
μ Ψ m ( u ) λ l = 0 m ν l f m , l 1 1 k ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l ( v ) ) d v = F m ( u ) .
When μ = 0 , we obtain a system of Fredholm integral equations of the first-type, whereas Equation (12) represents a system of Fredholm integral equations of the second-type when μ 0 .

5. Chebyshev Polynomials

In this section, we resort to the use of techniques and spectral relations of the method of Chebyshev polynomials [37] to obtain a solution of the algebraic integral system (12). Let T i ( u ) = cos ( i cos 1 u ) ; u [ 1 , 1 ] ; i 0 represent the first type of Chebyshev polynomials, while U i ( u ) = sin [ ( i + 1 ) cos 1 u ] / sin ( cos 1 u ) , i 0 represents the second type of Chebyshev polynomials. It is well known that T i ( u ) forms an orthogonal sequence of functions concerning the weight function ( 1 u 2 ) 1 / 2 , while U i ( u ) forms an orthogonal sequence of functions concerning the weight function ( 1 u 2 ) 1 / 2 .
We can apply the following well-known relations if the singular kernel of the integral equation is in the form of Carleman, | u v | α , 0 < α < 1 (see Aleksandrovsk and Covalence [38]):
| u v | α = ln | u v | G ( u , v ) ; G ( u , v ) = | u v | α ln | u v | ,
where G ( u , v ) is a continuous function, where u = v ; one of the important relations that can be used is the following well-known relation of Chebyshev polynomials (Gradstein and Ryzhik [39]).
d d u T i ( u ) = i U i 1 ( u ) .
Here, we can use the Chebyshev polynomials [40] to solve the algebraic integral system (12), which naturally leads one to consider replacing the given k ( w ( u ) w ( v ) ) approximately with a kernel k n ( w ( u ) w ( v ) ) that should satisfy the condition:
1 1 1 1 | k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 0 , as n .
As a result, Equation (12) can be expressed in the following form of an algebraic system:
μ Ψ m n ( u ) λ l = 0 m ν l f m , l 1 1 k n ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) d v + R n = F m ( u ) .
Consequently, the estimated error can be calculated using the following equation:
R n = | Ψ m ( u ) Ψ m n ( u ) | 0 a s n .
Write the kernel of (16) in the following form for using the spectral relationships:
k n ( w ( u ) w ( v ) ) = j = 0 n T j ( u ) T j ( v ) ,
where T j ( x ) is the Chybeshev polynomials of the first kind and degree j.
  • Using (18) in (16), we have
μ Ψ m n ( u ) λ l = 0 m j = 0 n ν l f m , l T j ( u ) 1 1 T j ( v ) γ m , l ( u , v , Ψ l n ( v ) ) d v + R n = F m ( u ) .
Formula (19) is an algebraic integral system that may be solved numerically. We put m = 0 in the system (19), and we first obtain the value of Ψ 0 n ( u ) .
μ Ψ 0 n ( u ) λ j = 0 n ν 0 f 0 , 0 T j ( u ) 1 1 T j ( v ) γ 0 , 0 ( u , v , Ψ 0 n ( v ) ) d v + R n = F 0 ( u ) .
After obtaining the solution of Equation (20), we will enable the utilization of the mathematical induction to obtain the general solution of (19).
In a special case of the original form, namely
μ Ψ m n ( u ) λ l = 0 m j = 0 n ν l f m , l T j ( u ) 1 1 T j ( v ) ξ m , l ( u , v ) Ψ l n ( v ) d v + R n = F m ( u ) ,
it attracted the interest of many researchers. The unknown function Ψ m n ( u ) is considered to have the following form:
Ψ m n ( u ) = A ( u ) B ( u ) ; A ( u ) = ( 1 u 2 ) 1 2 ,
where A ( u ) represents the weight function of T i ( u ) , and B ( u ) is the unknown function. Therefore, we obtain
Ψ m , n ( u ) = i = 0 Λ i , m T i ( u ) 1 u 2 ,
where T i ( u ) are the first-kind of Chebyshev polynomials, and Λ i , m are constants. Additionally, the well-known function F m ( u ) can be approximated in the following form:
F m , ( u ) = i = 0 i , m T i ( u ) 1 u 2 ,
where the coefficients i , m ; i 0 , are constants, which can be found from
i , m = 2 π 1 1 F m ( u ) T i ( u ) d u ; i 0 , 1 π 1 1 F m ( u ) d u ; i = 0 .
Using Equations (23) and (24) in Equation (21), we obtain
μ i = 0 Λ i , m T i ( u ) 1 u 2 λ l = 0 m j = 0 n i = 0 ν l f m , l T j ( u ) Λ i , l 1 1 T j ( v ) ξ m , l ( u , v ) T i ( v ) 1 v 2 d v = i = 0 i , m T i ( u ) 1 u 2 ,
which satisfies the orthogonal relation as follows:
1 1 T i ( u ) T j ( u ) 1 u 2 d u = 0 , i j π , i = j = 0 π 2 , i = j 0 .
T i ( u ) T j ( u ) = 1 2 [ T i + j ( u ) + T | i j | ( u ) ] , ( i , j 0 ) .
1 1 T i ( u ) d u = 2 1 i 2 , i = 0 , 2 , 4 , . . . 0 , i = 1 , 3 , 5 , . . . .
If ξ m , l ( u , v ) = 1 in Equation (26), then the solution of this equation can be obtained after discussing the following:
  • Case (i): For i = 0 , j = 0 , we obtain
    μ Λ 0 , m T 0 ( u ) 1 u 2 λ π l = 0 m ν l f m , l T 0 ( u ) Λ 0 , l = 0 , m T 0 ( u ) 1 u 2 ,
    multiplying both sides of (30) by the term T j ( u ) d u , then integrating the result from 1 to 1, yield the following result:
    μ Λ 0 , m λ l = 0 m ν l f m , l Λ 0 , l = 0 , m .
  • Case (ii): Let i = 0 , j 0 ; after using the orthogonal relation, Equation (26) tends to
    μ Λ 0 , m T 0 ( u ) 1 u 2 = 0 , m T 0 ( u ) 1 u 2 ; j 1 , μ Λ 0 , m = 0 , m ,
    where
    0 , m = 1 π 1 1 F m ( u ) d u .
  • Case (iii): For i 0 , j = 0 , we deduce
    μ Λ i , m T i ( u ) 1 u 2 = i , m T i ( u ) 1 u 2 ; i 1 , μ Λ i , m = i , m ,
    where
    i , m = 2 π 1 1 F m ( u ) T i ( u ) d u .
  • Case (iv): For i = j 0 ; i , j 1 , we can confirm
    μ Λ i , m T i ( u ) 1 u 2 λ π 2 l = 0 m ν l f m , l T i ( u ) Λ i , l = i , m T i ( u ) 1 u 2 ; i 1 .
    Multiplying both sides of (34) by the term T j ( u ) d u , then integrating the result from 1 to 1, we yield the following result:
    μ Λ i , m 2 λ ( 8 i 2 1 ) ( 4 i 1 ) ( 4 i + 1 ) l = 0 m ν l f m , l Λ i , l = i , m ; i 1 .

6. Convergence Analysis

In this section, under some conditions, we will provide proof of the existence of the unique numerical solution of the system and obtain the truncation error of the numerical solution. These aims will be achieved using the outlined theorems.

6.1. The Existence and Unique Numerical Solution

Lemma 4. 
Let k n ( w ( u ) w ( v ) ) L 2 ( [ 1 , 1 ] × [ 1 , 1 ] ) with the condition (15); then, the following condition is satisfied:
1 1 1 1 | k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 ϰ ; n > n 0 , n 0 N , ϰ is a constant .
Proof. 
We apply the following formula to prove this lemma:
1 1 1 1 | k n ( w ( u ) w ( v ) ) | 2 d u d v 1 1 1 1 | k n ( w ( u ) w ( v ) ) k ( w ( u ) w ( v ) ) + k ( w ( u ) w ( v ) ) | 2 d u d v ,
then
1 1 1 1 | k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 1 1 1 1 [ | k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) | + | k ( w ( u ) w ( v ) ) | ] 2 d u d v 1 2 ,
and using condition (15), we obtain
α > 0 , n 0 N : 1 1 1 1 | k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 < α , n > n 0 .
Applying Minkowski’s inequality and using condition ( i ) , we obtain
α > 0 , n 0 N : 1 1 1 1 | k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 ϰ , n > n 0 .
Theorem 2. 
Assume that the Lemma 4 and conditions of Theorem 1 are verified; then, the sequence of operators V ¯ n defined using
V ¯ n Ψ ( u , t ) = 1 μ F ( u , t ) + λ μ 0 t 1 1 f ( t , τ ) k n ( w ( u ) w ( v ) ) γ ( u , v , t , τ , Ψ ( v , τ ) ) d v d τ
maps the set S r continuously into itself for each n > n 0 .
Proof. 
Firstly, for the normality, we use formula (37) to obtain
V ¯ n Ψ ( u , t ) 1 | μ | F ( u , t ) + | λ | | μ | 0 t 1 1 | f ( t , τ ) | | k n ( w ( u ) w ( v ) ) | | γ ( u , v , t , τ , Ψ ( v , τ ) ) | d v d τ .
Using the conditions (i)–(iv-a) and (15), the above inequality takes the following form
V ¯ n ψ ( u , t ) ϖ | μ | + β ψ ( u , t ) ; β = | λ | | μ | ς ϰ σ .
According to inequality (38), the operator V ¯ transforms the ball S r into itself.
Secondly, for the continuity, we suppose that the functions ψ 1 ( u , t ) , ψ 2 ( u , t ) satisfy formula (37); then,
V ¯ n Ψ 1 ( u , t ) V ¯ n Ψ 2 ( u , t ) | λ | | μ | 0 t 1 1 | f ( t , τ ) | | k n ( w ( u ) w ( v ) ) | | γ ( u , v , t , τ , Ψ 1 ( v , τ ) ) γ ( u , v , t , τ , Ψ 2 ( v , τ ) ) | d v d τ .
Using the conditions (i)-(iv-a) and (15), the last inequality becomes
V ¯ n Ψ 1 ( u , t ) V ¯ n Ψ 2 ( u , t ) | λ | | μ | ς ϰ σ Ψ 1 ( u , t ) ψ 2 ( u , t ) , n > n 0 .

6.2. Error Analysis of the Numerical Solution

Consider the approximate solution to satisfy the integral equation:
μ Ψ m n ( u ) λ l = 0 m ν l f m , l 1 1 k n ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) d v = F m ( u ) .
Then, the error is
R n = μ [ Ψ m ( u ) Ψ m n ( u ) ] = λ l = 0 m ν l f m , l 1 1 [ k ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l ( v ) ) k n ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) ] d v .
We assume the following conditions in order to discuss the error:
a.
The kernel of position satisfies a condition:
1 1 1 1 | k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) | 2 d u d v 1 2 = 1 1 1 1 | k n + 1 ( w ( u ) w ( v ) ) | 2 d u d v 1 2 ϰ * .
b.
The kernel of time satisfies a condition:
l = 0 m ν l 2 f m , l 2 1 2 ς * .
c.
The nonlinear continuous function γ ( u , v , t , τ , Ψ ( v , τ ) ) satisfies a condition:
max m 1 1 γ m , m ( u , v , Ψ m ( v ) ) γ m , l ( u , v , Ψ m n ( v ) ) d v max m 1 1 Ψ m ( v ) Ψ m n ( v ) d v = max m 1 1 Ψ m n + 1 ( v ) d v = σ * .
Theorem 3. 
The error of Equation (1) is stable under the conditions (a)–(c) and estimated to be
R n | λ ς * | ( ϰ + ϰ * ) σ * .
Proof. 
After assuming the approximate solution Ψ ( u , v ) = Ψ ( u , t m ) = Ψ m ( u ) , the error takes the form
R n = μ [ Ψ m ( u ) Ψ m n ( u ) ] = λ l = 0 m ν l f m , l 1 1 [ k ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l ( v ) ) k n ( w ( u ) w ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) ] d v .
We adapt the above equation to take the following form:
R n = λ l = 0 m ν l f m , l 1 1 [ k ( w ( u ) w ( v ) ) { γ m , l ( u , v , Ψ l ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) } + { k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) } γ m , l ( u , v , Ψ l n ( v ) ) ] d v .
Using the properties of the norm, we obtain
R n λ l = 0 m ν l f m , l 1 1 k ( w ( u ) w ( v ) ) { γ m , l ( u , v , Ψ l ( v ) ) γ m , l ( u , v , Ψ l n ( v ) ) } + λ l = 0 m ν l f m , l 1 1 { k ( w ( u ) w ( v ) ) k n ( w ( u ) w ( v ) ) } γ m , l ( u , v , Ψ l n ( v ) ) d v .
Using the above conditions,
R n | λ ς * | ( ϰ + ϰ * ) σ * .

7. Numerical Applications

In this section, we illustrate the Chebyshev polynomials that are explained in Section 2 and Section 4 considering the following three examples. We solve these examples using the program Wolfram Mathematica 10.
Example 1. 
Consider the following NVFIE:
30 Ψ ( u , t ) 2 0 t 1 1 t τ 2 ( e u 2 e v 2 ) ( u v s . t τ Ψ 2 ( v , τ ) ) d v d τ = F ( u , t ) ,
where the function F ( u , t ) has presented by letting Ψ ( u , t ) = u 2 + t as an exact solution and λ = 2 . The constant μ = 30 , describing Equation (41). The function of time is f ( t , τ ) = t τ 2 , while the kernel of position is k ( w ( u ) w ( v ) ) = ( e u 2 e v 2 ) . The fundamental surface of the material is represented by the given function F ( u , t ) , whereas the unknown function is Ψ ( u , t ) . Equation (41) will be computed at time t [ 0 , 0.6 ] . The proposed numerical method is used with M = 3 and T = 0.6 .
In Table 1, we illustrate the changes that occur in the absolute error | E x a c t A p p r o x . | t m , m = 0 , 1 , 2 , 3 for various values of u using the quadrature method with M = 3 in the interval [ 0 , 0.6 ] .
In Figure 1, Figure 2, Figure 3 and Figure 4, we provided a comparison between the approximate solution, the exact solution, and the absolute error of the solution using the quadrature with different values of t.
Example 2. 
Consider the NVFIE when μ = 10 and λ = 4 :
10 Ψ ( u , t ) 4 0 t 1 1 t 2 τ u v u v ( u 2 v 2 ) Ψ ( v , τ ) d v d τ = F ( u , t ) ,
where the function F ( u , t ) is specified by laying Ψ ( u , t ) = u 2 t as an exact solution. The kernel of position is k ( w ( u ) w ( v ) ) = u v u v , while the kernel of time is f ( t , τ ) = t 2 τ . Equation (42) will be computed for n = 20 , = 20 .
Table 2 presents the absolute error of Chebyshev polynomials for the different values of u with 0 t 0.1 .
In Figure 5, Figure 6, Figure 7 and Figure 8, we showed 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 t.
Example 3. 
Consider the following NVFIE with the logarithmic kernel:
0.5152 Ψ ( u , t ) 0.001 0 t 1 1 t 2 τ 2 ( ln | u v | ) Ψ ( v , τ ) d v d τ = F ( u , t ) ,
where the function F ( u , t ) has presented by letting Ψ ( u , t ) = t 2 + e u as an accurate solution, the kernel of singular is k ( w ( u ) w ( v ) ) = ( ln | u v | ) , and the kernel of time is f ( t , τ ) = t 2 τ 2 . Equation (43) will be computed four different times: t 0 [ 0 , 0.006 ] , t 1 [ 0 , 0.02 ] , t 2 [ 0 , 0.05 ] , and t 3 [ 0 , 0.09 ] for n = 50 , = 50 .
To obtain the solution of an integral Equation (43), we use the approximate kernel form (18).
Table 3 presents the absolute error of the Chebyshev polynomials for different values of u with n = 50 , = 50 .
In Figure 9, Figure 10, Figure 11 and Figure 12, we showed a comparison between the approximate solution, the exact solution, and the absolute error of the solution using the presented numerical approaches for n = 50 , = 50 with different values of t.
Example 4. 
Consider the following NVFIE:
Ψ ( u , t ) = t u + 0.26 t 5 u 3 + 0.7 u 0 t 1 1 t τ ( u v ) 3 v Ψ 2 ( v , τ ) d v d τ ,
The constant μ = 1 , describing Equation (44). The function of time is f ( t , τ ) = t τ , while the kernel of position is k ( w ( u ) w ( v ) ) = ( u v ) 3 . The fundamental surface of the material is represented as the given function F ( u , t ) = t u + 0.26 t 5 u 3 , whereas the unknown function is Ψ ( u , t ) . Equation (44) will be computed at time t [ 0 , 0.05 ] . The proposed numerical method is used with M = 6 , n = 30 , = 30 , and T = 0.0 . 05 .
In Table 4, we illustrate the changes that occur in the numerical solution | t m , m = 0 , 1 , 2 , 3 , 4 , 5 for various values of u using the proposed numerical with M = 6 , n = 30 , = 30 , and T = 0.0 . 05 in the interval [ 0 , 0.05 ] .
Example 5. 
Consider the following NVFIE with the Carleman kernel:
0.8 Ψ ( u , t ) 0.021 0 t 1 1 t 2 τ 2 k ( w ( u ) w ( v ) ) Ψ ( v , τ ) d v d τ = F ( u , t ) ,
where the function F ( u , t ) has presented by letting Ψ ( u , t ) = u 2 t 2 as an accurate solution.
The kernel of singular is taken in the Carleman form as follows:
k ( w ( u ) w ( v ) ) = | u v | α , 0 < α < 1 ,
where α is named the Poisson rate, and in this case, the kernel is called the weakly singular kernel. Applying the quadrature method by taking M = 2 , then using the proposed numerical with n = 25 , = 25 we obtain the convergent solution of Equation (45).
The numerical results of Example 5 are shown in Table 5 and Figure 13, Figure 14, Figure 15 and Figure 16 for a range of different Poisson coefficient values α at time t = 0.45 , 0.9 .

8. General Conclusions

From the above tables and our numerical results, we can deduce the following:
  • In comparison to the other approaches, the one provided in this study is the most effective numerical method for solving the NVFIE with a single kernel.
  • The approach described in this study can be generalized to more general kernels.
  • In Example 1, the quadratic integral Equation (41) after using the quadrature method leads to a system of nonlinear integral equations. It can be observed that the error increases with an increasing M. When we take the maximum value error, Figure 4 is ( 8.47585 × 10 7 ) at t = 0.6 . Furthermore, the minimum error value in Figure 1 is ( 1.75434 × 10 9 ) at t = 0 (see Table 1).
  • In Example 2, the quadratic integral Equation (42) after using the Chebyshev polynomials leads to a system of nonlinear integral equations. It can be observed that the error increases with an increase in time. When we take the maximum value error, Figure 8 is ( 2.63214 × 10 7 ) at t = 0.1 . Furthermore, the minimum error value in Figure 4 is ( 5.64123 × 10 8 ) at t = 0.03 (see Table 2).
  • In Example 3, when the kernel takes the logarithmic kernel k ( w ( u ) w ( v ) ) = ( ln | u v | ) , the results are computed at t = 0.003 , 0.01 , 0.025 , and 0.045 for n = 50 , = 50 (see Table 3). As n , increases, and the errors decrease. The error takes the maximum value at u = ± 1 , where t is increasing, and vice versa.
  • In Example 5, we consider the NVFIE with the kernel as the Carleman kernel k ( w ( u ) w ( v ) ) = | u v | α . When we take the maximum value error, the ends of position is ( 7.63988 × 10 5 ) at t = 0.9 , α = 0.35 . Furthermore, the minimum error value in the midpoint of the position is ( 2.58746 × 10 7 ) at t = 0.45 , α = 0.15 (see Table 5). The error takes the maximum value at α = 1 , and vice versa.

9. Future Work

The authors will consider the solution of the principal equation of this paper in the two–dimensional problem with a phase-lag in time as follows:
μ Ψ ( u , t + δ t ) λ 0 t + δ t 1 1 f ( t + δ t , τ ) k ( w ( u ) w ( v ) ) γ ( u , v , t + δ t , τ , Ψ ( v , τ ) ) d v d τ = F ( u , t + δ t ) .

Author Contributions

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

Funding

This work was funded by the Deanship of Scientific Research at Jouf University through the Fast-track Research Funding Program.

Data Availability Statement

No instructional records have been created with the ongoing assessment data in this original copy.

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. Also, the authors would like to thank the Deanship of Scientific Research at Jouf University through the Fast-track Research Funding Program.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Amin, R.; Nazir, S.; García-Magariño, I. Efficient sustainable algorithm for the numeri-cal solution of nonlinear delay Fredholm-Volterra integral equations via Haar wavelet for dense sensor networks in emerging telecommuni-cations. Trans. Emerg. Telecommun. Technol. 2020, 33, 38–77. [Google Scholar]
  2. Warnick, K.F. Numerical Analysis for Electromagnetic Integral Equations; Artech House: Norwood, MA, USA, 2008. [Google Scholar]
  3. Popov, G.Y. Contact Problem for a Linearly Deformable Base; Springer: Moscow, Russian, 1982. [Google Scholar]
  4. Ramadan, M.A.; Osheba, H.S.; Hadhoud, A.R. A numerical method based on hybrid or-thonormal Bernstein and improved block-pulse functions for solving Volterra-Fredholm integral equations. Numer. Methods Partial Differ. Equ. 2023, 39, 268–280. [Google Scholar] [CrossRef]
  5. Mahdy, A.M.S.; Nagdy, A.S.; Hashem, K.H.; Mohamed, D.S. A Computational Technique for Solving Three-Dimensional Mixed Volterra–Fredholm Integral Equations. Fractal Fract. 2023, 7, 196. [Google Scholar] [CrossRef]
  6. Majouti, Z.E.; Jid, R.E.; Hajjaj, A. Numerical solution for three-dimensional nonlinear mixed Volterra-Fredholm integral equations via modified moving least-square method. Int. J. Comput. Math. 2022, 99, 1849–1867. [Google Scholar] [CrossRef]
  7. Micula, S. On Some Iterative Numerical Methods for Mixed Volterra-Fredholm Integral Equations. Symmetry 2019, 11, 1200. [Google Scholar] [CrossRef]
  8. Nwaigwe, C.; Micula, S. Fast and Accurate Numerical Algorithm with Performance Assess-ment for Nonlinear Functional Volterra Equations. Fractal Fract. 2023, 7, 333. [Google Scholar] [CrossRef]
  9. Chen, Z.; Jiang, W. An approximate solution for a mixed linear Volterra-Fredholm integral equation. Appl. Math. Lett. 2012, 25, 1131–1134. [Google Scholar] [CrossRef]
  10. Nasr, M.E.; Abdel-Aty, M.A. Theoretical and Numerical Discussion for the Mixed In-tegro–Differential Equations. J. Comput. Appl. 2021, 29, 880–892. [Google Scholar]
  11. Wazwaz, A.M. Linear and Nonlinear Integral Equations; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  12. Erfanian, M.; Zeidabadi, H. Using of Bernstein spectral Galerkin method for solving of weakly singular Volterra-Fredholm integral equations. Math. Sci. 2018, 12, 103–109. [Google Scholar] [CrossRef]
  13. Das, P.; Nelakanti, G. Convergence Analysis of Legendre Spectral Galerkin Method for Volterra-Fredholm-Hammerstein Integral Equations. In Mathematical Analysis and Its Applications; Agrawal, P., Mohapatra, R., Singh, U., Srivastava, H., Eds.; Springer: New Delhi, India, 2015; Volume 143, pp. 3–15. [Google Scholar]
  14. Jebreen, H.B. On the Multiwavelets Galerkin Solution of the Volterra-Fredholm Integral Equa-tions by an Efficient Algorithm. J. Math. 2020, 2020, 2672683. [Google Scholar] [CrossRef]
  15. Wang, X. A New Wavelet Method for Solving a Class of Nonlinear Volterra-Fredholm Inte-gral Equations. Abstr. Appl. Anal. 2014, 2014, 975–985. [Google Scholar] [CrossRef]
  16. Abdou, M.A.; Nasr, M.E.; Abdel–Aty, M.A. A study of normality and continuity for mixed integral equations. J. Fixed Point Theory Appl. 2018, 20, 5. [Google Scholar] [CrossRef]
  17. Georgieva, A.; Hristova, S. Homotopy Analysis Method to Solve Two-Dimensional Nonlinear Volterra-Fredholm Fuzzy Integral Equations. Fractal Fract. 2020, 4, 9. [Google Scholar] [CrossRef]
  18. Dong, C.; Chen, Z.; Jiang, W. A modified homotopy perturbation method for solving the non-linear mixed Volterra-Fredholm integral equation. J. Comput. Appl. Math. 2013, 239, 359–366. [Google Scholar] [CrossRef]
  19. Wang, Q.; Wang, K.; Chen, S. Least squares approximation method for the solution of Volterra-Fredholm integral equations. J. Comput. Appl. Math. 2014, 272, 141–147. [Google Scholar] [CrossRef]
  20. Al-Bugami, A.; Al-Juaid, J. Runge–Kutta Method and Block by Block Method to Solve Non-linear Fredholm-Volterra Integral Equation with Continuous Kernel. J. Appl. Math. Phys. 2020, 82, 2043–2054. [Google Scholar] [CrossRef]
  21. Deniz, S. Optimal perturbation iteration technique for solving nonlinear Volterra-Fredholm in-tegral equations. Math. Methods Appl. Sci. 2020, 2020, 1–7. [Google Scholar]
  22. 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]
  23. Erfanian, M. The approximate solution of nonlinear mixed Volterra-Fredholm-Hammerstein integral equations with RH wavelet bases in a complex plane. Math. Methods Appl. Sci. 2018, 41, 8942–8952. [Google Scholar] [CrossRef]
  24. Abdeljawad, T.; Agarwal, R.P.; Karapınar, E.; Kumari, P.S. Solutions of the Nonlinear Integral Equation and Fractional Differential Equation Using the Technique of a Fixed Point with a Numerical Experiment in Extended b-Metric Space. Symmetry 2019, 11, 686. [Google Scholar] [CrossRef]
  25. Berenguer, M.I.; Gámez, D. Study on convergence and error of a numerical method for solving systems of nonlinear Fredholm Volterra integral equations of Hammerstein type. Appl. Anal. 2017, 96, 516–527. [Google Scholar] [CrossRef]
  26. Berenguer, M.I.; Gámez, D.; Linares, A.J.L. Fixed point techniques and Schauder bases to approximate the solution of the first order nonlinear mixed Fredholm–Volterra integrodifferential equation. J. Comput. Appl. Math. 2013, 252, 52–61. [Google Scholar] [CrossRef]
  27. Geçmen, M.Z.; GeÇelik, E. Numerical solution of Volterra-Fredholm integral equa-tions with Hosoya polynomials. Math. Methods Appl. Sci. 2021, 44, 11166–11173. [Google Scholar] [CrossRef]
  28. Dahaghin, M.S.; Eskandari, S. Solving two-dimensional Volterra-Fredholm integral equations of the second kind by using Bernstein polynomials. Appl. Math. J. Chin. Univ. 2017, 32, 68–78. [Google Scholar] [CrossRef]
  29. Esmaeili, H.; Rostami, M.; Hooshyarbakhsh, V. Numerical solution of Volterra-Fredholm inte-gral equation via hyperbolic basis functions. Int. J. Numer. Model. 2021, 34, 1–11. [Google Scholar] [CrossRef]
  30. Xie, J.; Huang, Q.; Zhao, F. Numerical solution of nonlinear Volterra-Fredholm-Hammerstein integral equations in twodimensional spaces based on Block Pulse functions. J. Comput. Appl. Math. 2017, 317, 565–572. [Google Scholar] [CrossRef]
  31. Tomasiello, S.; Macías-Díaz, J.E.; Khastan, A.; Alijani, Z. New sinusoidal basis functions and a neural network approach to solve nonlinear Volterra-Fredholm integral equations. Neural Comput. Appl. 2019, 31, 4865–4878. [Google Scholar] [CrossRef]
  32. Gouyandeh, Z.; Allahviranloo, T.; Armand, A. Numerical solution of nonlinear Volter-ra-Fredholm-Hammerstein integral equations via Tau-collocation method with convergence analysis. J. Comput. Appl. Math. 2016, 308, 435–446. [Google Scholar] [CrossRef]
  33. Ninh, K.V.; Binh, N.T. Analytical Solution of Volterra-Fredholm Integral Equations Using Hybrid of the Method of Contractive Mapping and Parameter Continuation Method. Int. J. Appl. Comput. Math. 2019, 5, 76. [Google Scholar] [CrossRef]
  34. Dobriţoiu, M. The Existence and Uniqueness of the Solution of a Nonlinear Fredholm–Volterra Integral Equation with Modified Argument via Geraghty Contractions. Mathematics 2021, 9, 29. [Google Scholar] [CrossRef]
  35. Nasr, M.E.; Abdel–Aty, M.A. Analytical discussion for the mixed integral equations. J. Fixed Point Theory Appl. 2018, 20, 115. [Google Scholar] [CrossRef]
  36. Atkinson, K.E. The Numerical Solution of Integral Equation of the Second Kind, Cambridge Monographs on Applied and Computational Mathematics; Cambridge University Press: Cambridge, NY, USA, 1997. [Google Scholar]
  37. 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]
  38. Aleksandrovsk, V.M.; Covalence, E.V. Problems in the Mechanics of Continuous Media with Mixed Boundary Conditions; Nuka: Moscow, Russia, 1986. [Google Scholar]
  39. Gradstein, I.S.; Ryzhik, I.M. Tables of Integrals, 5th ed.; Series and Product; Academic Press: New York, NY, USA, 1994. [Google Scholar]
  40. Shoukralla, E.S. Application of Chebyshev polynomials of the second kind to the numerical solution of weakly singular Fredholm integral equations of the first kind. IAENG Int. J. Appl. Math. 2021, 51, 1–16. [Google Scholar]
Figure 1. Approximate exact solution and absolute error for t = 0 .
Figure 1. Approximate exact solution and absolute error for t = 0 .
Fractalfract 07 00730 g001
Figure 2. Approximate exact solution and absolute error for t = 0.2 .
Figure 2. Approximate exact solution and absolute error for t = 0.2 .
Fractalfract 07 00730 g002
Figure 3. Approximate exact solution and absolute error for t = 0.4 .
Figure 3. Approximate exact solution and absolute error for t = 0.4 .
Fractalfract 07 00730 g003
Figure 4. Approximate exact solution and absolute error for t = 0.6 .
Figure 4. Approximate exact solution and absolute error for t = 0.6 .
Fractalfract 07 00730 g004
Figure 5. Approximate exact solution and absolute error for t = 0.03 .
Figure 5. Approximate exact solution and absolute error for t = 0.03 .
Fractalfract 07 00730 g005
Figure 6. Approximate exact solution and absolute error for t = 0.06 .
Figure 6. Approximate exact solution and absolute error for t = 0.06 .
Fractalfract 07 00730 g006
Figure 7. Approximate exact solution and absolute error for t = 0.09 .
Figure 7. Approximate exact solution and absolute error for t = 0.09 .
Fractalfract 07 00730 g007
Figure 8. Approximate exact solution and absolute error for t = 0.1 .
Figure 8. Approximate exact solution and absolute error for t = 0.1 .
Fractalfract 07 00730 g008
Figure 9. Approximate exact solution and absolute error for t 0 [ 0 , 0.006 ] .
Figure 9. Approximate exact solution and absolute error for t 0 [ 0 , 0.006 ] .
Fractalfract 07 00730 g009
Figure 10. Approximate exact solution and absolute error for t 1 [ 0 , 0.02 ] .
Figure 10. Approximate exact solution and absolute error for t 1 [ 0 , 0.02 ] .
Fractalfract 07 00730 g010
Figure 11. Approximate exact solution and absolute error for t 2 [ 0 , 0.05 ] .
Figure 11. Approximate exact solution and absolute error for t 2 [ 0 , 0.05 ] .
Fractalfract 07 00730 g011
Figure 12. Approximate exact solution and absolute error for t 3 [ 0 , 0.09 ] .
Figure 12. Approximate exact solution and absolute error for t 3 [ 0 , 0.09 ] .
Fractalfract 07 00730 g012
Figure 13. Approximate exact solution and absolute error for α = 0.15 , t = 0.45 .
Figure 13. Approximate exact solution and absolute error for α = 0.15 , t = 0.45 .
Fractalfract 07 00730 g013
Figure 14. Approximate exact solution and absolute error for α = 0.15 , t = 0.9 .
Figure 14. Approximate exact solution and absolute error for α = 0.15 , t = 0.9 .
Fractalfract 07 00730 g014
Figure 15. Approximate exact solution and absolute error for α = 0.35 , t = 0.45 .
Figure 15. Approximate exact solution and absolute error for α = 0.35 , t = 0.45 .
Fractalfract 07 00730 g015
Figure 16. Approximate exact solution and absolute error for α = 0.35 , t = 0.9 .
Figure 16. Approximate exact solution and absolute error for α = 0.35 , t = 0.9 .
Fractalfract 07 00730 g016
Table 1. Error results of the quadrature method with 0 t 0.6 .
Table 1. Error results of the quadrature method with 0 t 0.6 .
u|Exact-Approx.| t 0 |Exact-Approx.| t 1 |Exact-Approx.| t 2 |Exact-Approx.| t 3
−0.99.75485  × 10 8 8.57458  × 10 6 8.92185  × 10 5 9.96543  × 10 5
−0.77.03693  × 10 8 6.58423  × 10 6 9.63241  × 10 6 9.86545  × 10 6
−0.55.61475  × 10 8 8.52387  × 10 7 6.39556  × 10 6 7.51273  × 10 6
−0.32.46587  × 10 8 5.26217  × 10 7 4.78569  × 10 6 7.42428  × 10 6
−0.15.75813  × 10 9 2.93561  × 10 7 1.25865  × 10 6 4.23171  × 10 6
01.75434  × 10 9 8.56468  × 10 8 5.64758  × 10 7 8.47585  × 10 7
0.15.89767  × 10 9 3.89657  × 10 7 2.58769  × 10 6 5.87418  × 10 6
0.32.53144  × 10 8 6.03217  × 10 7 4.78557  × 10 6 7.52431  × 10 6
0.55.22873  × 10 8 7.84574  × 10 7 5.63264  × 10 6 6.85768  × 10 6
0.77.41562  × 10 8 5.98784  × 10 6 8.54282  × 10 6 8.85441  × 10 6
0.98.52129  × 10 8 7.96546  × 10 6 7.85668  × 10 5 9.24574  × 10 5
Table 2. Numerical and error results of the Chebyshev polynomials with 0 t 0.1 .
Table 2. Numerical and error results of the Chebyshev polynomials with 0 t 0.1 .
uError of t = 0.03 Error of t = 0.06 Error of t = 0.09 Error of t = 0.1
−0.84.26831  × 10 7 1.47857  × 10 7 4.21364  × 10 6 8.96321  × 10 6
−0.62.58214  × 10 7 9.89765  × 10 8 3.02146  × 10 6 7.52301  × 10 6
−0.49.20135  × 10 8 9.56212  × 10 8 8.63254  × 10 7 6.92541  × 10 6
−0.27.41234  × 10 8 8.96326  × 10 8 5.32874  × 10 7 7.15246  × 10 6
05.64123  × 10 8 8.64129  × 10 8 2.36581  × 10 7 2.63214  × 10 7
0.27.08745  × 10 8 8.69546  × 10 8 4.82031  × 10 7 6.30254  × 10 6
0.47.41233  × 10 8 8.80231  × 10 8 8.36521  × 10 7 6.12543  × 10 6
0.63.25647  × 10 7 8.93541  × 10 8 2.98652  × 10 6 7.45213  × 10 6
0.84.10258  × 10 7 1.93254  × 10 7 4.12984  × 10 5 8.12984  × 10 6
Table 3. Numerical and error results of the Chebyshev polynomials with four different times: t 0 , t 1 , t 2 , and t 3 .
Table 3. Numerical and error results of the Chebyshev polynomials with four different times: t 0 , t 1 , t 2 , and t 3 .
uError in t 0 Error in t 1 Error in t 2 Error in t 3
0.99 1.85746  × 10 7 8.76325  × 10 7 8.83697  × 10 7 6.32154  × 10 5
−0.839.47854  × 10 9 8.52365  × 10 8 7.41235  × 10 7 6.93254  × 10 6
−0.678.61543  × 10 9 3.25483  × 10 8 5.23147  × 10 7 6.32154  × 10 6
−0.527.64423  × 10 9 8.45821  × 10 9 4.36258  × 10 8 5.62147  × 10 6
−0.386.58477  × 10 9 7.52314  × 10 9 3.56214  × 10 8 3.26984  × 10 6
0.163.65215  × 10 10 3.12754  × 10 9 6.12453  × 10 9 5.63021  × 10 8
0.275.69821  × 10 9 5.29475  × 10 9 3.56214  × 10 8 3.14752  × 10 6
0.496.32154  × 10 9 5.96872  × 10 9 4.21235  × 10 8 4.96235  × 10 6
0.587.92315  × 10 9 1.12548  × 10 8 5.14258  × 10 7 6.23154  × 10 6
0.763.95426  × 10 8 9.15347  × 10 8 6.32514  × 10 7 6.63215  × 10 6
0.851.85465  × 10 7 7.58479  × 10 7 7.81548  × 10 7 6.14789  × 10 5
Table 4. Numerical solution of Equation (44) with 0 t 0.05 .
Table 4. Numerical solution of Equation (44) with 0 t 0.05 .
uApprox.| t = 0 Approx.| t = 0.01 Approx.| t = 0.02 Approx.| t = 0.03 Approx.| t = 0.04 Approx.| t = 0.05
−1.0000.010.020.030.04000010.0500002
−0.9500.00950.0190.02850.0380.0475001
−0.7100.00710.01420.02130.02840.0355001
−0.5400.00540.01080.01620.02160.027
−0.3800.00380.00760.01140.01520.019
0.00000000
0.2600.00260.00520.00780.01040.013
0.4300.00430.00860.01290.01720.0215
0.6500.00650.0130.01950.0260.0325001
0.8600.00860.01720.02580.03440.0430001
0.9900.00990.01980.02970.03960010.0495002
Table 5. Numerical results of Example 5 with different α .
Table 5. Numerical results of Example 5 with different α .
α = 0.15 α = 0.35
u Error in  t = 0 . 45 Error in  t = 0 . 9 Error in  t = 0 . 45 Error in  t = 0 . 9
−1.05.15478  × 10 6 7.02587  × 10 6 3.69851  × 10 5 7.58742  × 10 5
−0.94.63897  × 10 6 6.98521  × 10 6 2.36823  × 10 5 6.74185  × 10 5
−0.72.85217  × 10 6 6.52147  × 10 6 1.50698  × 10 5 3.96587  × 10 5
−0.51.87456  × 10 6 5.19854  × 10 6 0.85236  × 10 5 1.25874  × 10 5
−0.30.64423  × 10 6 3.02587  × 10 6 8.08574  × 10 6 0.91114  × 10 5
−0.14.85214  × 10 7 6.32541  × 10 7 6.63242  × 10 6 7.98524  × 10 6
0.02.58746  × 10 7 4.36985  × 10 7 5.36985  × 10 6 8.21475  × 10 6
0.25.68712  × 10 7 6.39478  × 10 7 7.36985  × 10 6 8.52147  × 10 6
0.40.77632  × 10 6 3.65287  × 10 6 9.02584  × 10 6 9.51236  × 10 6
0.62.98571  × 10 6 5.41721  × 10 6 9.98526  × 10 6 2.36985  × 10 5
0.83.25874  × 10 6 6.39852  × 10 6 1.96358  × 10 5 5.36575  × 10 5
1.05.08745  × 10 6 7.21456  × 10 6 3.69852  × 10 5 7.63988  × 10 5
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

Abusalim, S.M.; 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. https://doi.org/10.3390/fractalfract7100730

AMA Style

Abusalim SM, Abdou MA, Nasr ME, Abdel-Aty MA. An Algorithm for the Solution of Nonlinear Volterra–Fredholm Integral Equations with a Singular Kernel. Fractal and Fractional. 2023; 7(10):730. https://doi.org/10.3390/fractalfract7100730

Chicago/Turabian Style

Abusalim, Sahar M., Mohamed A. Abdou, Mohamed E. Nasr, and Mohamed A. Abdel-Aty. 2023. "An Algorithm for the Solution of Nonlinear Volterra–Fredholm Integral Equations with a Singular Kernel" Fractal and Fractional 7, no. 10: 730. https://doi.org/10.3390/fractalfract7100730

APA Style

Abusalim, S. M., Abdou, M. A., Nasr, M. E., & Abdel-Aty, M. A. (2023). An Algorithm for the Solution of Nonlinear Volterra–Fredholm Integral Equations with a Singular Kernel. Fractal and Fractional, 7(10), 730. https://doi.org/10.3390/fractalfract7100730

Article Metrics

Back to TopTop