Next Article in Journal
Inequalities That Imply the Norm of a Linear Space Is Induced by an Inner Product
Next Article in Special Issue
Regular, Singular and Hypersingular Integrals over Fractal Contours
Previous Article in Journal
Boundedness and Compactness of Weighted Composition Operators from α-Bloch Spaces to Bers-Type Spaces on Generalized Hua Domains of the First Kind
Previous Article in Special Issue
Application of Wavelet Transform to Urysohn-Type Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Hybrid Method for All Types of Solutions of the System of Cauchy-Type Singular Integral Equations of the First Kind

1
Faculty of Ocean Engineering Technology and Informatics, University Malaysia Terengganu (UMT), Kuala Terengganu 21030, Malaysia
2
Faculty of Applied Mathematics and Intellectual Technologies, National University of Uzbekistan (NUUz), Tashkent 100174, Uzbekistan
3
Faculty of Science and Technology, Universiti Sains Islam Malaysia (USIM), Bandar Baru Nilai 71800, Malaysia
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(20), 4404; https://doi.org/10.3390/math11204404
Submission received: 8 June 2023 / Revised: 4 August 2023 / Accepted: 24 August 2023 / Published: 23 October 2023
(This article belongs to the Special Issue Convolution Equations: Theory, Numerical Methods and Applications)

Abstract

:
In this note, the hybrid method (combination of the homotopy perturbation method (HPM) and the Gauss elimination method (GEM)) is developed as a semi-analytical solution for the first kind system of Cauchy-type singular integral equations (CSIEs) with constant coefficients. Before applying the HPM, we have to first reduce the system of CSIEs into a triangle system of algebraic equations using GEM, which is then carried out using the HPM. Using the theory of the bounded, unbounded and semi-bounded solutions of CSIEs, we are able to find inverse operators for the system of CSIEs of the first kind. A stability analysis and convergent of the proposed method has been conducted in the weighted Lp space. Moreover, the proposed method is proven to be exact in the Holder class of functions for the system of characteristic SIEs for any type of initial guess. For each of the four cases, several examples are provided and examined to demonstrate the proposed method’s validity and accuracy. Obtained results are compared with the Chebyshev collocation method and modified HPM (MHPM). Example 3 reveals that the error term of the MHPM is slightly superior to that of the HPM. One of the features of the proposed method is that it can be solved as a complex-valued system of CSIEs. Numerical results revealed that the hybrid method dominates others.

1. Introduction

The Cauchy singular integral equations (CSIEs) occur naturally in many fields of science, including cruciform crack problems in fracture mechanics, oscillating aerofoils problems in aerodynamics, scattering of surface water waves in hydrodynamics, contact radiations, and electrodynamics. Since finding analytical solutions for CSIEs with weak or strong singularities is challenging, many researchers have developed numerical methods with significant accuracy to solve these equations. Due to its wide and practical applications, researchers are interested in solving the system of CSIEs. It is well known that the SIEs of Abel and Cauchy-type appear in many branches of scientific fields, such as stereology [1], radio occultation (RO) measurements [2], radio astronomy [3], molecular scattering [4], electron emission [5], radar ranging [6], plasma spectroscopy [7], X-ray tomography [8], and so on.
Investigations of the system of SIEs have attracted much concern in the applied sciences. Their general ideas and essential features are broadly applicable in engineering science. The solution to a large class of mixed boundary value problems in physics and engineering is reduced to a one-dimensional system of SIEs. Unfortunately, not many researchers dealt with the system of Cauchy and Abel-type SIEs and their generalised form. For instance, Erdogan [9], as a pioneer in 1969, considered systems of simultaneous singular integral equations of the Cauchy-type. The author used the properties of the related orthogonal polynomials to solve the systems of SIEs approximately. He applied Chebyshev polynomials of the first or second kind to find the bounded solution of Cauchy-type SIEs of the first kind. Kumar et al. used the homotopy perturbation method (HPM) to solve the system of generalized Abel’s integral equations [10], while Wazwaz [11] considered a 2 × 2 system of generalised Abel’s equation and solved it by using Laplace transform method.
Moreover, Turhan et al. [12] solved the system of Cauchy-type singular integral equations of the first kind by the Chebyshev collocation method. At the same time, Durua and Yusufog’lu [13] found a semi-bounded solution of the system of SIEs of the first kind by Chebyshev polynomials of the third and fourth kinds. Furthermore, Shahmorad and Ahdiaghdam [14] proposed Chebyshev polynomials approximation for the numerical solution of a system of Cauchy-type singular integral equations of the first kind on a finite segment. Taylor Expansion method as an approximate approach for systems of singular Volterra integral equations is proposed by Didgar and Vahidi [15]. There are many methods developed for one-dimensional CSIEs (see [16,17,18,19,20,21,22,23]). However, not many researchers have researched the system of CSIEs [10,11,12,13,14,15]. Nevertheless, the HPM for the system of CSIEs has rarely been applied, and very few articles have been published.
The HPM and the homotopy analysis method (HAM) are vital tools for solving linear and nonlinear problems in various scientific and technological fields. Using the HPM and HAM, researchers have successfully tackled a wide range of nonlinear problems. For instance, the HPM has been applied to solve linear and nonlinear integral equations [24], special nonlinear Fredholm integral equations [25], non-linear functional integral equations [26,27,28], the quadratic Ricatti differential equation [29], and the nonlinear equation [30], as well as the nonlinear second-order differential equation [31]. On the other hand, HAM has been utilized to address the linear system of Fredholm–Volterra Integral equations [32], among many others.
In this note, the application of the HPM and MHPM is demonstrated for the system of the singular integral equation of the first kind given by
j = 1 M [ a i j π 1 1 u j ( τ ) d τ τ t + b i j π 1 1 K i j ( t , τ ) u j ( τ ) d τ ] = f i ( t ) ,   i = 1 , , M , 1 < t < 1 ,
where A = ( a i j ) and B = ( b i j ) are given constant matrices with det ( A ) 0 , det ( B ) 0 , the forcing functions f i ( t ) and kernels K i j are all known to be real-valued or complex-valued continuous functions and u j ,   j = 1 , 2 , , M are unknown functions to be determined.
This paper is arranged in the following manner. After introducing the background on singular integral equations in Section 1, the four types of solutions of Equation (1) and reduction techniques are presented in Section 2. In Section 3, standard HAM and modified HAM are demonstrated by implementing the CSIEs (1). Section 4, proves the stability and convergent of the proposed method in the weighted Lp space. Section 5, deals with many examples and show a comparison of the hybrid method with the Chebyshev collocation method given in [12,14]. Finally, some conclusions and acknowledgements are given in Section 6.

2. Methodology and Reduction Techniques

It is known that the characteristic singular integral equations of the form
1 π 1 1 u ( τ ) d τ τ t = f ( t ) ,   1 < t < 1
have four types of solutions (Lifanov [23], p. 5).
Case 1. The solution is bounded at the endpoints t = ± 1 , which yields
{ u ( t ) = 1 t 2 π 1 1 f ( τ ) d τ 1 τ 2 ( τ t ) , 1 1 f ( τ ) 1 τ 2 d τ = 0 .
Case 2. The solution is unbounded at the endpoints t = ± 1 , yielding
{ u ( t ) = 1 π 1 t 2 1 1 1 τ 2 f ( τ ) d τ τ t + c π 1 t 2 , 1 1 u ( τ ) d τ = c , c   may   take   zero   value .
Case 3. The solution is bounded at the endpoint t = 1 , but unbounded at the end point t = 1 , yielding
u ( t ) = 1 π 1 + t 1 t 1 1 1 τ 1 + τ f ( τ ) τ t d τ
Case 4. The solution is bounded at the endpoint t = 1 , but unbounded at the endpoint t = 1 , yielding
u ( t ) = 1 π 1 t 1 + t 1 1 1 + τ 1 τ f ( τ ) τ t d τ
Similarly, if we consider the CSIEs of the form
1 π 1 1 u ( τ ) d τ τ t + 1 π 1 1 K ( t , τ ) u ( τ ) d τ = f ( t ) ,   1 < t < 1
we again have four cases of the solutions obtained using (3)–(6).
Case 1. The bounded solution at the endpoints t = ± 1 of Equation (7) is given by
{ u ( t ) = 1 t 2 π 2 1 1 1 1 K ( t , s ) u ( s ) d s 1 τ 2 ( τ t ) d τ 1 t 2 π 1 1 f ( τ ) d τ 1 τ 2 ( τ t ) , 1 1 1 1 τ 2 [ f ( τ ) 1 1 K ( τ , t ) u ( t ) d t ] d τ = 0 .
Case 2. The unbounded solution at the endpoints t = ± 1 of Equation (7) is given by
{ u ( t ) = 1 π 2 1 t 2 1 1 1 1 1 τ 2 K ( t , s ) u ( s ) d s τ t d τ 1 π 1 t 2 1 1 1 τ 2 f ( τ ) d τ τ t , 1 1 u ( τ ) d τ = 0 .
Case 3. The solution is bounded at the endpoint t = 1 , but unbounded at the endpoint t = 1 for Equation (7), given by
u ( t ) = 1 π 2 1 + t 1 t 1 1 1 1 1 τ 1 + τ K ( t , s ) u ( s ) d s τ t d τ 1 π 1 + t 1 t 1 1 1 τ 1 + τ f ( τ ) τ t d τ .
Case 4. The solution is bounded at the endpoint t = 1 , but unbounded at the endpoint t = 1 , given by
u ( t ) = 1 π 2 1 t 1 + t 1 1 1 1 1 + τ 1 τ K ( t , s ) u ( s ) d s τ t d τ 1 π 1 t 1 + t 1 1 1 + τ 1 τ f ( τ ) τ t d τ
Let us consider Equation (1) and write it as algebraic equations given below
{ a 11 S 1 ( t ) + a 12 S 2 ( t ) + + a 1 M S M ( t ) = f 1 ( t ) F 1 ( t ) , a 21 S 1 ( t ) + a 22 S 2 ( t ) + + a 2 M S M ( t ) = f 2 ( t ) F 2 ( t ) , a M 1 S 1 ( t ) + a M 2 S 2 ( t ) + + a M M S M ( t ) = f M ( t ) F M ( t ) ,
where
S i ( t ) = 1 π 1 1 u i ( τ ) τ t d τ , i = { 1 , 2 , , M } , F i ( t ) = j = 1 M b i j π 1 1 K i j ( t , τ ) u j ( τ ) d τ , i = { 1 , 2 , , M } .
To solve Equation (12), in the case of M = 3, extension matrix A ¯ has the form
A ¯ = [ a 11 a 12 a 13 f 1 ( t ) F 1 ( t ) a 21 a 22 a 23 f 2 ( t ) F 2 ( t ) a 31 a 32 a 33 f 3 ( t ) F 3 ( t ) ]
By applying the Gaussian elimination technique to Equation (14), we obtain
A ¯ = [ 1 0 0 1 C 3 ( e 11 f 1 + e 12 f 2 + e 13 f 3 ) 1 C 3 ( e 11 F 1 + e 12 F 2 + e 13 F 3 ) 0 1 0 1 C 3 ( e 21 f 1 + e 22 f 2 + e 23 f 3 ) 1 C 3 ( e 21 F 1 + e 22 F 2 + e 23 F 3 ) 0 0 1 1 C 3 ( e 31 f 1 + e 32 f 2 + e 33 f 3 ) 1 C 3 ( e 31 F 1 + e 32 F 2 + e 33 F 3 ) ] ,
where C 3 = a 11 a 23 a 3 2 a 11 a 22 a 33 + a 12 a 21 a 33 a 12 a 23 a 31 a 13 a 21 a 32 + a 13 a 22 a 31 and
E = [ e 11 e 12 e 13 e 21 e 22 e 23 e 31 e 32 e 33 ] = [ a 22 a 33 a 23 a 32 a 13 a 32 a 12 a 33 a 12 a 23 a 13 a 22 a 23 a 31 a 21 a 33 a 11 a 33 a 13 a 31 a 13 a 21 a 11 a 23 a 21 a 32 a 22 a 31 a 12 a 31 a 11 a 32 a 11 a 22 a 12 a 21 ]
Then, Equations (12) and (13) have the form
{ 1 π 1 1 u 1 ( τ ) d τ τ t + 1 C 3 ( e 11 F 1 + e 12 F 2 + e 13 F 3 ) = 1 C 3 ( e 11 f 1 + e 12 f 2 + e 13 f 3 ) , 1 π 1 1 u 2 ( τ ) d τ τ t + 1 C 3 ( e 21 F 1 + e 22 F 2 + e 23 F 3 ) = 1 C 3 ( e 21 f 1 + e 22 f 2 + e 23 f 3 ) , 1 π 1 1 u 3 ( τ ) d τ τ t + 1 C 3 ( e 31 F 1 + e 32 F 2 + e 33 F 3 ) = 1 C 3 ( e 31 f 1 + e 32 f 2 + e 33 f 3 ) .
In order to generalize Equation (17) for different values of M, we can write it in the following operator form:
L ( u i ) + N i ( u ¯ ) = f i ( t ) , i = 1 , , M ,
where u ¯ = ( u 1 ( t ) , u 2 ( t ) , , u M ( t ) ) and
L ( u i ) = 1 π 1 1 u i ( τ ) d τ τ t , N i ( u ¯ ) = 1 C M j = 1 M e i j [ M ] F j ( u ¯ ( t ) ) , F i ( u ¯ ( t ) ) = j = 1 M b i j π 1 1 K i j ( t , τ ) u j ( τ ) d τ , f i ( t ) = 1 C M j = 1 M e i j [ M ] f j ( t ) .
Here, coefficients C M and e i j [ M ] are defined by solving M × M algebraic equations. Equations (18) and (19) can be written in vector form as follows
L ¯ ( u ¯ ) + N ¯ ( u ¯ ) = f ¯ ,
where u ¯ = ( u 1 , u 2 , , u M ) , f ¯ = ( f 1 , f 2 , , f M ) and
L ¯ ( u ¯ ) = ( L ( u 1 ) , L ( u 2 ) , , L ( u M ) ) N ¯ ( u ¯ ) = ( N 1 ( u ¯ ) , N 2 ( u ¯ ) , , N M ( u ¯ ) ) .
To find the bounded, unbounded and semi-bounded solutions of Equations (18) and (19), we search for the solution in the form given by:
u i , r ( t ) = w r ( t ) v i ( t ) , r { 1 , 2 , 3 , 4 } ,   i = 1 , , M ,
where
{ w 1 ( t ) = 1 t 2 ,   w 3 ( t ) = 1 t 1 + t , w 2 ( t ) = 1 1 t 2 ,   w 4 ( t ) = 1 + t 1 t .
Remark 1.
The Gauss elimination method and the existence of an inverse operator helped us greatly to handle the system of CSIEs (1). Direct implementation of the HPM or MHPM for solving CSIEs (1) yielded no good results. Fortunately, the hybrid method gave us highly accurate results.
The detailed implementation of the HPM and MHPM is given in the next section.

3. Description of the HPM and Its Application

3.1. Theory of Standard HPM

To illustrate the basic concept of the HPM, consider the following nonlinear functional equation [25] given by:
A ( u ) = f ( t ) , t Ω , B ( u , u n ) = 0 , t Γ ,
where A is a general functional operator, while f(t) is a known analytic function. Furthermore, we divide A into two parts
A = L + N
where L is the linear operator and N is the nonlinear operator.
Due to Equation (23) and by using Equation (24), we now obtain
L ( u ) + N ( u ) = f ( t ) .
It is known that in a convex homotopy form, the perturbation scheme is constructed as follows
H ( v , p ) = ( 1 p ) ( L ( v ) L ( u 0 ) ) + p ( L ( v ) + N ( v ) f ( t ) ) = 0 ,   p [ 0 , 1 ]
where p is the homotopy parameter and u 0 is an initial guess satisfying boundary condition in Equation (23). It can be easily seen that when p = 0 and p = 1, we have
H ( v , 0 ) = L ( v ) L ( u 0 ) = 0 , H ( v , 1 ) = L ( v ) + N ( v ) f ( t ) = 0 ,
in which ν varies from the initial value u 0 to the exact solution u of Equation (25). This is called deformation and equating the homotopy function in Equation (26) to zero yields deformation equations
L ( v ( t , p ) ) = L ( u 0 ( t ) ) + p ( f ( t ) N ( v ( t , p ) ) L ( u 0 ( t ) ) )
We now search for the solution to Equation (28) as follows
v ( t , p ) = k = 0 v k ( t ) p k
Substituting Equation (29) into Equation (28) yields
L ( k = 0 v k ( t ) p k ) = L ( u 0 ( t ) ) + p ( f ( t ) N ( k = 0 v k ( t ) p k ) L ( u 0 ( t ) ) )
Comparing coefficients of terms in Equation (30) with identical powers of p yields
p 0 : v 0 ( t ) = u 0 ( t ) , p 1 : v 1 ( t ) = L 1 ( f ( t ) ) L 1 ( N ( v 0 ( t ) ) ) u 0 ( t ) , p k : v k ( t ) = L 1 ( N ( v k 1 ( t ) ) ) ,   k = 2 , 3 , ,
where L−1 is the inverse operator of L.
Hence, the analytic-approximate solution is given by
u = lim p 1 v t , p = v 0 t + v 1 t + + v m t + k = 0 m v k t

3.2. Application of the HPM and MHPM to the System of CSIEs

We now solve the CSIEs (18)–(19) system by the proposed method. To solve it, we construct a convex homotopy function as follows
( 1 p ) ( L ( v i ( t , p ) ) L ( u i , 0 ( t ) ) ) + p ( L ( v i ( t , p ) ) + N i ( v i ( t , p ) ) f i ( t ) ) = 0
and search for unknown function v i ( t ) in the form
v i ( t , p ) = k = 0 v i , k ( t ) p k , i = 1 , , M
Then, we have
L ( k = 0 v i , k ( t ) p k ) = L ( u i , 0 ( t ) ) + p ( f i ( t ) N i ( k = 0 v i , k ( t ) p k ) L ( u i , 0 ( t ) ) )
By equating the coefficient of the terms according to the same power of p, we obtain
p 0 : v i , 0 ( t ) = u i , 0 ( t ) , i = { 1 , 2 , , M } , p 1 : v i , 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) u i , 0 ( t ) , p k : v i , k ( t ) = L 1 ( N i ( v i , k 1 ( t ) ) ) ,   k = 2 , 3 , ,
where L 1 is the inverse operator of L .
A semi-analytical approximate solution can be obtained by Equation (32). In the practical problem, we usually choose the initial guess u i , 0 in the standard HPM given as follows:
u i , 0 = f i ( t ) , i = 1 , 2 , , M .
In the case of decomposition f i ( t ) = f 1 i ( t ) + f 2 i ( t ) , we have the following scheme
p 0 : v i , 0 ( t ) = L 1 ( f 1 i ( t ) ) , p 1 : v i , 1 ( t ) = L 1 ( f 2 i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) , p k : v i , k ( t ) = L 1 ( N i ( v i , k 1 ( t ) ) ) ,   k = 2 , 3 , .
The scheme in Equation (38) is called modified HPM (MHPM). Therefore, if we apply standard HPM in Equation (36) and MHPM in Equation (38) for the Equation (21), then the original solution to the problem is given by:
u i , r ( t ) = w r ( t ) lim p 1 v i ( t ) = w r ( t ) lim N j = 0 N v i j ( t ) , r { 1 , 2 , 3 , 4 } , i = { 1 , , M } .
Note that if the operator N i ( u ¯ ) = 0 in Equation (18), then the operator in Equation (18) becomes
L ( u i ) = f i ( t ) , i = 1 , 2 , M .
If the operator L is invertible, then the exact solution of Equation (40) is
u i , r ( t ) = w r ( t ) L 1 ( f i ( t ) ) , r { 1 , 2 , 3 , 4 } .
Let us now find the exact solution of Equation (40) using the standard HPM. From Equation (36), it follows that
p 0 : v i , 0 ( t ) = u i , 0 ( t ) , p 1 : v i , 1 ( t ) = L 1 ( f i ( t ) ) u i , 0 ( t ) , p k : v i , k ( t ) = 0 ,   k = 2 , 3 , .
Now, from Equations (39) and (42), it follows that
u i , r ( t ) = w r ( t ) lim p 1 v i ( t ) = w r ( t ) k = 0 v i , k ( t ) = w r ( t ) L 1 ( f i ( t ) ) , r { 1 , 2 , 3 , 4 } ,
which coincides with the exact solution given in Equation (41).
Schemes (42) and (43) lead to the following theorem.
Theorem 1.
Let the kernel in Equation (18) be a Cauchy singular kernel given by  1 τ t  and  f i ( t ) H α [ 1 , 1 ]  (Holder class). If the operator L in Equation (40) is linear, then the iterative scheme (42) provides an exact solution for the operator Equation (40) in any chosen initial guess.
Proof. 
Let u i , r ( t ) = w r L 1 ( f i ( t ) ) (   r = { 1 , 2 , 3 , 4 } )   be a solution of Equation (18) when N i ( u ¯ ) 0 . In this case, by solving Equation (18) using the HPM in (42), we obtain
p 0 : v i , 0 ( t ) = u i , 0 ( t ) , p 1 : v i , 1 ( t ) = L 1 ( f i ( t ) ) u i , 0 ( t ) , p k : v i , k ( t ) = 0 ,   k = 2 , 3 , .
Hence, the solution of the HPM leads to
u i r ( t ) = w r ( t ) ( v i , 0 ( t ) + v i , 1 ( t ) + 0 ) = w r ( t ) [ u i , 0 ( t ) + L 1 ( f i ( t ) ) u i , 0 ( t ) ] = w r ( t ) L 1 ( f i ( t ) ) ,
which is identical to the exact solution. □

4. Stability Analysis and Convergence

4.1. Stability Analysis of the Solution

Stability theory in mathematics studies the behavior and robustness of solutions in differential equations, integral equations, fractional integral equations, and dynamical systems under small perturbations of initial conditions (see [33,34,35]). It explores whether solutions remain bounded and predictable or exhibit unpredictable and divergent behavior. By analyzing the stability properties of mathematical models, stability theory provides insights into long-term behavior and system reliability. It plays a crucial role in physics, engineering, and biology, helping to understand the behavior of dynamical systems. Stability theory also extends to integral equations and fractional integral equations, where it evaluates the effects of perturbations on stability and guides numerical methods. Overall, stability theory is essential for assessing system behavior and selecting reliable models.
Definition 1.
(Eberly [36]). A numerical method is said to be stable if small changes in the initial data for the differential equation produce correspondingly small changes in the subsequent approximations.
Let us consider the stability solution of CSIE in Equation (18). Let the approximate the solution of this equation be given by (35) or (38). We wish to examine the effect on the solution u ( t ) when the input f ( t ) is corrupted with noise δ f ( t ) , where δ f ( t ) is unknown except for a restriction on its relative magnitude to f ( t ) .
Theorem 2.
Let the input function  f ¯ ( t ) = ( f 1 ( t ) , f 2 ( t ) , , f M ( t ) )  in Equation (18) be perturbated by the noise  δ f ¯ ( t ) = ( δ f 1 ( t ) , δ f 2 ( t ) , , δ f M ( t ) ) .  Then, the solution vector  u ¯ ( t ) = ( u 1 ( t ) , u 2 ( t ) , , u M ( t ) )  defined by Equation (20) is equivalent to the solution of the form
L ( δ u ¯ ( t ) ) + N ( δ u ¯ ( t ) ) = δ f ¯ ( t ) .
Proof: 
Let the right side function of Equation (18) be perturbed. Then, right side of Equation (18) has the form
δ f ( t ) = ( δ f 1 ( t ) , δ f 2 ( t ) , , δ f M ( t ) ) ,
Assume that u i ( t ) will obtain an increment u ˜ i = u i ( t ) + ε i ( t ) . Then
L ( u ˜ i ) + N i ( u ˜ ¯ ) = f i ( t ) + δ f i ( t ) , i = 1 , 2 , M .
Applying the HPM to Equation (45), we obtain
L ( v ˜ i ) + N i ( v ˜ ¯ ) = f i ( t ) + δ f i ( t ) ,
which yields
p 0 : v ˜ i , 0 ( t ) = u ˜ i , 0 ( t ) = u i , 0 ( t ) + ε i , 0 ( t ) , p 1 : v ˜ i , 1 ( t ) = L 1 ( f i ( t ) + δ f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) + ε i , 0 ( t ) ) ) u ˜ i , 0 ( t ) , p 2 : v ˜ i , 2 ( t ) = L 1 ( N i ( v i , 1 ( t ) + ε i , 1 ( t ) ) ) p k : v ˜ i , k ( t ) = L 1 ( N i ( v i , k 1 ( t ) + ε i , k 1 ( t ) ) ) ,   k = 2 , 3 , .
Applying the operator L to Equation (47) gives
p 0 : L ( v ˜ i , 0 ( t ) ) = L ( u ˜ i , 0 ( t ) ) , p 1 : L ( v ˜ i , 1 ( t ) ) = f i ( t ) + δ f i ( t ) N i ( v i , 0 ( t ) + ε i , 0 ( t ) ) L ( u ˜ i , 0 ( t ) ) , p 2 : L ( v ˜ i , 2 ( t ) ) = N i ( v i , 1 ( t ) + ε i , 1 ( t ) ) , p k : L ( v ˜ i , k ( t ) ) = N i ( v i , k 1 ( t ) + ε i , k 1 ( t ) ) ,   k = 2 , 3 , .
By summing both sides of Equation (48), we obtain
L ( v ˜ i , 0 ( t ) + v ˜ i , 1 ( t ) + + v ˜ i , k ( t ) + ) = N i ( v i , 0 ( t ) + v i , 1 ( t ) + + v i , k 1 ( t ) + ) N i ( ε i , 0 ( t ) + ε i , 1 ( t ) + + ε i , k 1 ( t ) + ) + f i ( t ) + δ f i ( t ) .
Since v i ( t ) = k = 0 v i , k ( t ) , ε i ( t ) = k = 0 ε i , k ( t ) and v ˜ i ( t ) = v i ( t ) + ε i ( t ) , and taking into account Equation (18), we obtain
L ( ε i ( t ) ) + N i ( ε i ( t ) ) = δ f i ( t ) .
Using ε i ( t ) = v ˜ i ( t ) v i ( t ) , and taking the linearity of the operator we obtain
L ( v ˜ i ( t ) ) + N i ( v ˜ i ( t ) ) = δ f i ( t ) + f i ( t ) .
This proved the Theorem 2. □

4.2. Convergence of the Hybrid Method

Definition 2
(Elliott [37]). A sequence u n  with  u n X n  (where X n is the discretized space of the consideration problem) converges globally to  u  if  lim n u p n u n = 0 .
In (Ayati and Biazar [38]), the general convergence theorem of the HPM was proven. Based on [39] we prove the following theorem.
Theorem 3.
Let the HPM for Equation (18) be defined by Equation (36). Let  L : X Y  (where  X , Y  be Holder space) be linear invertible operator. Then the solution of Equation (18) is equivalent to determining the following sequence
s i , n ( t ) = v i , 0 ( t ) + v i , 1 ( t ) + + v i , n ( t ) , i = { 1 , 2 , , M } ,
where the sequence  s i , n ( t )  is generated by
s i , n + 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i , n ( t ) ) ) , n = 0 , 1 , 2 ,
Here, the iterative scheme  v i , n ( t )  is defined by (36) and
N i ( k = 0 v i , k ( t ) ) = k = 0 N i ( v i , k ( t ) ) , i = 1 , 2 , M .
Proof. 
We prove this theorem by employing the induction method. Let n = 0 , then from Equation (53), we have
s i , 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i , 0 ( t ) ) ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) .
As a consequence of the equation represented by Equation (36), we have v i , 0 ( t ) = u i , 0 ( t ) and we obtain
s i , 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) u i , 0 ( t ) + v i , 0 ( t ) .
From Equation (36), it follows that
v i , 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) u i , 0 ( t ) .
Therefore,
s i , 1 ( t ) = v i , 0 ( t ) + v i , 1 ( t ) .
For n = 1 , from Equation (53), we obtain
s i , 2 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i , 1 ( t ) ) ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) + v i , 1 ( t ) ) ) u i , 0 ( t ) + v i , 0 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) ) ) u i , 0 ( t ) + v i , 0 ( t ) L 1 ( N i ( v i , 1 ( t ) ) ) = v i , 0 ( t ) + v i , 1 ( t ) L 1 ( N i ( v i , 1 ( t ) ) ) .
Due to Equation (36), v i , 2 ( t ) = L 1 ( N i ( v i , 1 ( t ) ) ) . Therefore,
s i , 2 ( t ) = v i , 0 ( t ) + v i , 1 ( t ) + v i , 2 ( t ) .
Assume that s i , n ( t ) = v i , 0 ( t ) + v i , 1 ( t ) + v i , 2 ( t ) + + v i , n ( t ) , then by taking into account v i , k ( t ) = L 1 ( N i ( v i , k 1 ( t ) ) ) , we arrived at
s i , n + 1 ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i , n ( t ) ) ) = L 1 ( f i ( t ) ) L 1 ( N i ( v i , 0 ( t ) + v i , 1 ( t ) + + v i , n ( t ) ) ) u i , 0 ( t ) + v i , 0 ( t ) = v i , 0 ( t ) + v i , 1 ( t ) L 1 ( N i ( v i , 1 ( t ) + + v i , n ( t ) ) ) = v i , 1 ( t ) + v i , 2 ( t ) + + v i , n ( t ) L 1 ( N i ( v i , n ( t ) ) ) = v i , 1 ( t ) + v i , 2 ( t ) + + v i , n ( t ) + v i , n + 1 ( t ) .
By induction method, we can conclude that Equation (52) is valid for any n . The Theorem 3 is hence proven. We now proceed by proving the following main Theorem 4. □
Theorem 4.
Let  s i , n  be defined by (52) and  f * L p ( ) ,  If the function  F i ( s i , n )  defined by (19) satisfied Lipschitz condition
F i ( s i , n ) F i ( s i , n 1 ) L i s i , n s i , n 1 , i { 1 , 2 , , n } ,
for the sequence  s i , n + 1  generated by (53), then, the following inequality holds:
s i , n s i , n 1 ε i s i , n s i , n 1 ,
where
0 < ε i = 1 | C M | j = 1 M | e i j [ M ] | | L j | < 1 , L j = 1 2 l = 1 M | b j , l | K j , l , K j , l = sup 1 t 1 1 1 | K j , l ( t , τ ) | d τ .
Proof. 
It is well known that the generalised Holder inequality [35] leads to
| f g h | f p g q h r ,
f p = ( a b | f ( t ) | p d t ) 1 p ,   g q = ( a b | g ( t ) | q d t ) 1 q ,   h r = ( a b | h ( t ) | r d t ) 1 r ,
where p , q , r ( 1 , ) with 1 p + 1 q + 1 r = 1 and f L p ( ) ,   g L q ( ) ,   h L r ( ) .
In Eshkuvatov et al. [39], applied the generalised Holder inequality as follows
| a b u ( x ) v ( x ) h ( x ) ρ ( x ) d x | ( a b | u ( x ) | λ 1 ρ ( x ) d x ) 1 λ 1 ( a b | v ( x ) | λ 2 ρ ( x ) d x ) 1 λ 2 ( a b | h ( x ) | λ 3 ρ ( x ) d x ) 1 λ 3 ,
where ρ ( x ) is a weight function and 1 λ 1 + 1 λ 2 + 1 λ 3 = 1 ,   λ i > 1 ,   i = 1 , 2 , 3 .
Case 1: For the unbounded case, we have
s i , n + 1 s i , n p = L 1 ( N i ( s i , n ( t ) ) ) L 1 ( N i ( s i , n 1 ( t ) ) ) p = 1 π 1 1 1 τ 2 N i ( s i , n ( τ ) ) d τ τ t 1 π 1 1 1 τ 2 N i ( s i , n 1 ( τ ) ) d τ τ t p = 1 π 1 1 N i ( s i , n ( τ ) ) N i ( s i , n 1 ( τ ) ) τ t 1 τ 2 d τ p = 1 π 1 1 ( E i , n p ( τ ) ( τ t ) α ) 1 q ( E i , n ( τ ) ) 1 p q ( 1 ( τ t ) α ) 1 α q 1 τ 2 d τ p ,
where E i , n ( t ) = N i ( s i , n ( t ) ) N i ( s i , n 1 ( t ) ) .
Applying Holder inequality on Equation (59) to Equation (60) and choosing ρ ( t ) = 1 t 2 , λ 1 = q ,   λ 2 = 1 / ( 1 p 1 q ) , and λ 3 = p = p p 1 , we then obtain
s i , n + 1 s i , n p 1 π ( 1 1 ( ( | E i , n ( τ ) | p | τ t | α ) 1 q ) q 1 τ 2 d τ ) 1 q ( 1 1 | E i , n ( τ ) | ( 1 p q ) 1 1 p 1 q 1 τ 2 d τ ) 1 p 1 q ( 1 1 ( 1 | τ t | ) p ( 1 α q ) 1 τ 2 d τ ) 1 p = 1 π ( 1 1 | E i , n ( τ ) | p | τ t | α 1 τ 2 d τ ) 1 q ( 1 1 | E i , n ( τ ) | p 1 τ 2 d τ ) 1 p 1 q ( 1 1 ( 1 | τ t | ) p ( 1 α q ) 1 τ 2 d τ ) 1 p = 1 π I 1 p I 2 q I 3 p ,
where
I 1 p = ( 1 1 | E i , n ( τ ) | p | τ t | α 1 τ 2 d τ ) 1 q , I 2 q = ( 1 1 | E i , n ( τ ) | p 1 τ 2 d τ ) 1 p 1 q ,
I 3 p = ( 1 1 ( 1 | τ t | ) p ( 1 α q ) 1 τ 2 d τ ) 1 p .
Now, let us consider I 1 ( t ) given as follows
I 1 p = ( 1 1 | E i , n ( τ ) | p | τ t | α 1 τ 2 d τ ) 1 q E i , n p q 1 1 ( 1 τ 2 | τ t | α d τ ) 1 q
where
E i , n ( t ) = N i ( s i , n ( t ) ) N i ( s i , n 1 ( t ) ) 1 | C M | j = 1 M | e i j [ M ] | F j ( s i , n ( t ) ) F j ( s i , n 1 ( t ) ) 1 | C M | j = 1 M | e i j [ M ] | L i s i , n s i , n 1 = ε i s i , n s i , n 1 ,
1 1 1 τ 2 τ t α d τ 1 1 d τ τ t α = ( τ t ) 1 α 1 α | 1 1 2 1 + α 1 α , α < 1 .
On the other hand, we have
I 1 p E i , n p p q 2 1 + α 1 α .
Moreover, I 2 ( t ) can be estimated as follows
I 2 q = ( 1 1 | E i , n ( τ ) | p 1 τ 2 d τ ) 1 p 1 q π E i , n ( t ) 1 p q
For I 3 ( t ) , we assume that 1 p 0 < α < 1 . Then, taking into account 1 p 0 > q p , we arrived at α q > 1 p or 1 α q > 1 1 p = 1 p . We now have
I 3 p = ( 1 1 ( 1 | τ t | ) p ( 1 α q ) 1 τ 2 d τ ) 1 p 1 1 d τ | τ t | β = 1 t d τ | τ t | β + t 1 d τ | τ t | β 2 1 + β 1 + β ,
where
β = 1 α q < 1 .
Substituting I 1 ( t ) , I 2 ( t ) and I 3 ( t ) into Equation (61), we obtain where
ε i = 2 1 + α 1 α 2 1 + β 1 + β ε i
Theorem 5.
Suppose that  s i ( t )  be defined by (55) and v i , n   X = H α [ 1 , 1 ]  and  v i , 0  is bounded. We then have  v i , n ε v i , n 1 , ε < 1  , for  n = 0 , 1 , 2 ,  and the sequence of partial sum  s n = k = 0 n v i , k ( t )  converges to the solution of SIEs (18).
Proof. 
To show the series k = 0 v i , k ( t ) is convergent, we prove that it is a Cauchy sequence.
s i , 1 ( t ) = v i , 0 ( t ) + v i , 1 ( t ) , s i , 2 ( t ) = v i , 0 ( t ) + v i , 1 ( t ) + v i , 2 ( t ) , s i , n ( t ) = v i , 0 ( t ) + v i , 1 ( t ) + + v i , n ( t ) ,
Using s i , n s i , n 1 ε i s i , n s i , n 1 , we obtain
s i , n + 1 s i , n = v i , n + 1 ε i s i , n s i , n 1 = ε i v i , n ε i 2 s i , n 1 s i , n 2 ε n + 1 v i , 0 .
For any integers n and m such that n m , we obtain the following
s i , n s i , m = ( s i , n s i , n 1 ) + ( s i , n 1 s i , n 2 ) + + ( s i , m + 1 s i , m ) s i , n s i , n 1 + s i , n 1 s i , n 2 + + s i , m + 1 s i , m ε n v i , 0 + ε n 1 v i , 0 + + ε m + 1 v i , 0 ( ε n + ε n 1 + + ε m + 1 ) v i , 0 ( ε m + 1 + + ε n + ) v i , 0 ε m + 1 ( 1 + ε + + ε n + ) v i , 0 ε m + 1 1 c v i , 0 .
Thus, lim n , m s i , n s i , m = 0 , which shows that { s i , n } is a Cauchy sequence and it converges in Banach space i.e.,
s B ,   such   that ,   lim n s i , n ( t ) = n = 1 v i , n ( t ) = s i ( t ) .
Theorem 6.
Let s i ( t )  be defined by Equation (64), then the following sequence is satisfied
s i ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i ( t ) ) ) .
Proof. 
From Equation (53), we have
lim n s i , n + 1 ( t ) = L 1 ( f i ( t ) ) L 1 lim n ( N i ( s i , n ( t ) ) ) = L 1 ( f i ( t ) ) L 1 N i ( lim n ( n = 0 v i , n ( t ) ) ) .
Substituting Equation (64) into Equation (66) yields
s i ( t ) = L 1 ( f i ( t ) ) L 1 N i ( lim n ( n = 1 v i , n ( t ) ) ) = L 1 ( f i ( t ) ) L 1 N i ( s i ( t ) ) , i = 1 , 2 , M .
Theorem 6 is proven. □
Lemma 1.
Equation (65) is equivalent to
L ( u i ( t ) ) + N i ( u i ( t ) ) = f i ( t ) .
Proof. 
Let us rewrite Equation (60), which leads to
s i ( t ) = L 1 ( f i ( t ) ) L 1 ( N i ( s i ( t ) ) ) .
Applying the operator L to both sides of Equation (67) yields
L ( s i ( t ) ) = f i ( t ) N i ( s i ( t ) ) .
Due to Equation (64), we obtain
u i ( t ) = s i ( t ) = n = 0 v i , n ( t ) .
Thus, Equation (68) leads to
L ( u i ( t ) ) + N i ( u i ( t ) ) = f i ( t ) .

5. Numerical Examples

Example 1
(Turhan et al. [12]): Consider the system of SIEs of the form
4 π 1 1 u 1 ( τ ) τ t d τ + 2 π 1 1 u 2 ( τ ) τ t d τ = 4 t 3 2 t 2 6 t + 1 4 π 1 1 u 1 ( τ ) τ t d τ + 6 π 1 1 u 2 ( τ ) τ t d τ = 4 t 3 6 t 2 14 t + 3
Comparing Equation (69) with Equation (1), we have
a 1 , 1 = 4 π ,   a 1 , 2 = 2 π , a 2 , 1 = 4 π ,   a 2 , 2 = 6 π , b 1 , 1 = b 1 , 2 = b 2 , 1 = b 2 , 2 = 0 .
We also have the following functions
{ f 1 ( t ) = 4 t 3 2 t 2 2 t + 1 , f 2 ( t ) = 4 t 3 6 t 2 10 t + 3 .
Remark 2.
Example 1 is discussed by Turhan et al. [12], who applied the truncated Chebyshev series method and found a bounded solution. They were able to obtain an exact solution for  n = 3 . To solve Equation (69) by applying the HPM, we should use the Gaussian elimination method to obtain
1 1 u 1 ( τ ) τ t d τ = ( t 3 1 2 t ) π = f 1 ( t ) , 1 1 u 2 ( τ ) τ t d τ = ( t 2 2 t + 1 2 ) π = f 2 ( t ) .
We solve Equation (70) by standard HPM (42). Since Equation (70) can be written as Equation (40) due to Theorem 1., we are able to obtain the exact solution for all cases, as shown below:
Case 1. The bounded solution is searched as follows
u i ( t ) = 1 t 2 v i ( t ) , i = { 1 , 2 } .
The exact bounded solutions of Equation (69) is
u 1 ( t ) = 1 t 2 [ t 2 + 1 ] , u 2 ( t ) = 1 t 2 [ t + 2 ] .
We compare Equation (70) with Equation (18), which gives
  f 1 ( t ) = t 3 1 2 t , f 2 ( t ) = t 2 2 t + 1 2 , L 1 ( u 1 ( t ) ) = 1 π 1 1 u 1 ( τ ) τ t d τ , L 2 ( u 2 ( t ) ) = 1 π 1 1 u 2 ( τ ) τ t d τ , N 1 ( u 1 ( t ) ) = N 2 ( u 2 ( t ) ) = 0 .
By solving Equation (70) using standard HPM (42), we obtain
p 0 : v 1 , 0 ( t ) = f 1 ( t ) = t 3 1 2 t ,   v 2 , 0 ( t ) = f 2 ( t ) = t 2 2 t + 1 2 , p 1 : v 1 , 1 ( t ) = t 3 + t 2 + 1 2 t + 1 ,   v 2 , 1 ( t ) = t 2 + 3 t + 3 2 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (69) is given by
u 1 ( t ) = 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 t 2 ( t 3 1 2 t + t 3 + t 2 + 1 2 t + 1 ) = 1 t 2 ( t 2 + 1 ) , u 2 ( t ) = 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 t 2 ( t 2 2 t + 1 2 + t 2 + 3 t + 3 2 ) = 1 t 2 ( t + 2 ) ,
which is identical to the exact solution.
We chose the following functions as the initial guess
a ) { v 1 , 0 ( t ) = 1 2 t , v 2 , 0 ( t ) = 1 2 . b ) { v 1 , 0 ( t ) = t 4 + 5 t 3 3 , v 2 , 0 ( t ) = 3 4 t 3 + 7 .
Remark 3.
In the case a), the initial guess  ( v 1 , 0 , v 2 , 0 )  is chosen as part of    f 1 ( t )  and    f 2 ( t )  respectively. For the case b), the initial guess  ( v 1 , 0 , v 2 , 0 )  is selected as any continuous function not related to    f 1 ( t )  and    f 2 ( t ) .
Case 2. Let us now search for the unbounded solutions of Equation (70) in the form
u i ( t ) = 1 1 t 2 v i ( t ) , i = { 1 , 2 } .
In this case, the exact solution of Equation (69) is given by
u 1 ( t ) = 1 1 t 2 ( t 4 + 3 8 ) , u 2 ( t ) = 1 1 t 2 ( t 3 2 t 2 + t + 1 ) .
It is known that Equation (69) is equivalent to Equation (70). Therefore, to solve Equation (70), we apply standard HPM (42), which yields
p 0 : v 1 , 0 ( t ) = f 1 ( t ) = t 3 1 2 t ,   v 2 , 0 ( t ) = f 2 ( t ) = t 2 2 t + 1 2 , p 1 : v 1 , 1 ( t ) = t 4 + t 3 + 1 2 t + 3 8 ,   v 2 , 1 ( t ) = t 3 t 2 + 3 t + 1 2 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (69) for the unbounded solution case is
u 1 ( t ) = 1 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 1 t 2 ( t 4 + 3 8 ) , u 2 ( t ) = 1 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 1 t 2 ( t 3 2 t 2 + t + 1 ) ,
which is identical to the exact solution.
The initial guess is chosen as the following functions
( a ) { v 1 , 0 ( t ) = t 2 1 2 t , v 2 , 0 ( t ) = 2 t + 1 2 . ( b ) { v 1 , 0 ( t ) = t 4 + t 3 3 4 , v 2 , 0 ( t ) = t 3 3 7 t .
Remark 4.
It is found that standard HPM gave exact results for any chosen initial guess.
Case 3. Let us search the semi-bounded solution of Equation (69) in the form
u i ( t ) = 1 + t 1 t v i ( t ) , i = { 1 , 2 } .
The exact solution is
u 1 ( t ) = 1 + t 1 t ( t 3 + t 2 t + 1 ) , u 2 ( t ) = 1 + t 1 t ( t 2 t + 2 ) .
In this case, solving Equation (70) by applying standard HPM (42) yields
p 0 : v 1 , 0 ( t ) = f 1 ( t ) = t 3 1 2 t ,   v 2 , 0 ( t ) = f 2 ( t ) = t 2 2 t + 1 2 , p 1 : v 1 , 1 ( t ) = t 2 1 2 t + 1 ,   v 2 , 1 ( t ) = t + 3 2 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (69) for the semi-bounded solution case is
u 1 ( t ) = 1 + t 1 t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 + t 1 t ( t 3 + t 2 t + 1 ) , u 2 ( t ) = 1 + t 1 t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 + t 1 t ( t 2 t + 2 ) .
which is identical to the exact solution.
We have chosen the following functions as initial guesses:
( a ) { v 1 , 0 ( t ) = t 3 + t 2 1 2 t , v 2 , 0 ( t ) = t 4 t 2 2 t . ( b ) { v 1 , 0 ( t ) = t 5 t 3 + t 2 1 4 , v 2 , 0 ( t ) = t 3 1 7 t 2 + t .
Remark 5.
In this case, the standard HPM also provided an exact solution regardless of the initial guess.
Case 4. Let us now search the semi-bounded solution of Equation (69) in the form
u i ( t ) = 1 t 1 + t v i ( t ) , i = { 1 , 2 } .
The exact solution is given as follows
u 1 ( t ) = 1 t 1 + t ( t 3 + t 2 + t + 1 ) , u 2 ( t ) = 1 t 1 + t ( t 2 + 3 t + 2 ) .
In order to solve Equation (70) in this case, we apply standard HPM (42), which yields
p 0 : v 1 , 0 ( t ) = f 1 ( t ) = t 3 1 2 t ,   v 2 , 0 ( t ) = f 2 ( t ) = t 2 2 t + 1 2 , p 1 : v 1 , 1 ( t ) = 2 t 3 + t 2 + 3 2 t + 1 ,   v 2 , 1 ( t ) = 2 t 2 + 5 t + 3 2 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (69) for the semi-bounded is
u 1 ( t ) = 1 t 1 + t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 t 1 + t ( t 3 + t 2 + t + 1 ) , u 2 ( t ) = 1 t 1 + t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 t 1 + t ( t 2 + 3 t + 2 ) ,
which is identical to the exact solution.
Remark 6.
According to the Theorem 1., the HPM provides an exact solution for any initial guess in the case of the semi-bounded solutions.
Example 2
(Sharma et al. [40]): Solve the system of CSIEs of the form
1000 π 1 1 u 1 ( τ ) τ t d τ + 10 π 1 1 u 2 ( τ ) τ t d τ = f 1 ( t ) + i g 1 ( t ) , 500 π 1 1 u 1 ( τ ) τ t d τ + 200 π 1 1 u 2 ( τ ) τ t d τ = f 2 ( t ) + i g 2 ( t ) ,
where
{ f 1 ( t ) = 990 t 8 + 1089 t 7 + 937 t 6 26704 t 5 25 349161 t 4 1000 + 792327 t 3 2000 + 1761 t 2 250 53511 t 4000 53929 2000 , g 1 ( t ) = 990 t 8 1189 t 7 8971 t 6 10 + 119047 t 5 100 + 163961 t 4 500 279198 t 3 625 30873 t 2 10000 + 69533 t 4000 + 1130501 40000 , f 2 ( t ) = 300 t 8 + 330 t 7 + 215 t 6 2447 t 5 10 8607 t 4 100 + 735 t 3 8 17253 t 2 2000 + 29541 t 4000 14701 1000 , g 2 ( t ) = 300 t 8 380 t 7 197 t 6 + 1462 t 5 5 + 9419 t 4 100 27549 t 3 250 183 t 2 400 7957 t 2000 + 57853 4000 .
Remark 7.
Sharma et al. [40] investigated Example 2 using the Galerkin method based on the Legendre polynomials to find a semi-bounded solution. They specifically obtained approximate solutions for n = 8 and obtained the exact solution.
Before applying the standard HPM, we utilize the Gaussian elimination method, which yields
1 π 1 1 u 1 ( τ ) τ t d τ = 1 975 ( f 1 + i g 1 ( t ) ) 1 19500 ( f 2 + i g 2 ( t ) ) , 1 π 1 1 u 2 ( τ ) τ t d τ = 1 390 ( f 1 + i g 1 ( t ) ) + 1 195 ( f 2 + i g 2 ( t ) ) .
Case 1. The bounded solution is searched as follows
u i ( t ) = 1 t 2 v i ( t ) , i = { 1 , 2 } .
The exact solution of Equation (85) for the bounded case is
u 1 ( t ) = 1 t 2 ( t 7 11 t 6 10 9 t 5 20 + 533 t 4 1000 + 2537 t 3 10000 27261 t 2 100000 + 125433 t 1000000 248661 2000000 i ( t 7 + 6 t 6 5 + 41 t 5 100 303 t 4 500 503 t 3 2000 + 936 t 2 3125 133857 t 1000000 248661 2000000 ) ) , u 2 ( t ) = 1 t 2 ( t 7 + 11 t 6 10 + 4 t 5 5 467 t 4 500 1789 t 3 10000 + 4303 t 2 20000 + 207 t 20000 63 5000 i ( t 7 11 t 6 10 79 t 5 100 + 1003 t 4 1000 + 439 t 3 5000 676 t 2 3125 + 13 t 6250 + 42 3125 ) ) .
Comparing Equation (86) with Equation (18) yields
f 1 ( t ) = 1 975 ( f 1 + i g 1 ( t ) ) 1 19500 ( f 2 + i g 2 ( t ) ) , f 2 ( t ) = 1 390 ( f 1 + i g 1 ( t ) ) + 1 195 ( f 2 + i g 2 ( t ) ) , L 1 ( u 1 ( t ) ) = 1 π 1 1 u 1 ( τ ) τ t d τ , L 2 ( u 2 ( t ) ) = 1 π 1 1 u 2 ( τ ) τ t d τ , N 1 ( u 1 ( t ) ) = N 2 ( u 2 ( t ) ) = 0 .
Applying standard HPM (42) yields
p 0 : v 1 , 0 ( t ) = t 8 + 11 t 7 10 + 19 t 6 20 1083 t 5 1000 3537 t 4 10000 + 40161 t 3 100000 + 7667 t 2 1000000 28199 t 2000000 13451 500000 + i ( t 8 6 t 7 5 91 t 6 100 + 603 t 5 500 + 663 t 4 2000 11313 t 3 25000 3143 t 2 1000000 + 18033 t 1000000 + 56491 2000000 ) ,   v 2 , 0 ( t ) = t 8 11 t 7 10 13 t 6 10 + 371 t 5 250 + 4539 t 4 10000 10893 t 3 100000 623 t 2 10000 + 2887 t 40000 1 160 + i ( t 8 + 11 t 7 10 + 129 t 6 100 1553 t 5 1000 1789 t 4 5000 + 3627 t 3 6250 + 557 t 2 100000 2599 t 40000 + 681 400000 ) , p 1 : v 1 , 1 ( t ) = t 8 t 7 10 41 t 6 20 + 633 t 5 1000 + 8867 t 4 10000 14791 t 3 100000 280277 t 2 1000000 + 55813 t 400000 194857 2000000 + i ( t 8 + t 7 5 + 211 t 6 100 199 t 5 250 15 t 4 16 + 10051 t 3 50000 + 302663 t 2 1000000 15189 t 100000 + 205463 2000000 ) ,   v 2 , 1 ( t ) = t 8 + t 7 10 + 12 t 6 5 171 t 5 250 13879 t 4 10000 + 1463 t 3 4000 + 5549 t 2 20000 2473 t 40000 127 20000 + i ( t 8 t 7 10 239 t 6 100 + 763 t 5 1000 + 1701 t 4 1250 12313 t 3 25000 22189 t 2 100000 + 13411 t 200000 + 939 80000 ) , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 , .
The approximate solution of Equation (85) is given by
u 1 ( t ) = 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 t 2 ( t 7 11 t 6 10 9 t 5 20 + 533 t 4 1000 + 2537 t 3 10000 27261 t 2 100000 + 125433 t 1000000 248661 2000000 + i ( t 7 + 6 t 6 5 + 41 t 5 100 303 t 4 500 503 t 3 2000 + 936 t 2 3125 133857 t 1000000 248661 2000000 ) ) , u 2 ( t ) = 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 t 2 ( t 7 + 11 t 6 10 + 4 t 5 5 467 t 4 500 1789 t 3 10000 + 4303 t 2 20000 + 207 t 20000 63 5000 + i ( t 7 11 t 6 10 79 t 5 100 + 1003 t 4 1000 + 439 t 3 5000 676 t 2 3125 + 13 t 6250 + 42 3125 ) ) ,
which is identical to the exact solution.
Remark 8.
It is observed that the HPM gives an exact solution for the system of CSIEs (85) with any choice of initial guess ( v 1 , 0 , v 2 , 0 ) .
Case 2. Let us now search for the unbounded solution of Equation (85) given in the form
u i ( t ) = 1 1 t 2 v i ( t ) , i = { 1 , 2 } .
Equation (85) corresponds to Equation (86). Consequently, standard HPM (36) is used to solve Equation (86) as follows
p 0 : v 1 , 0 ( t ) = t 8 + 11 t 7 10 + 19 t 6 20 1083 t 5 1000 3537 t 4 10000 + 40161 t 3 100000 + 7667 t 2 1000000 28199 t 2000000 13451 500000 + i ( t 8 6 t 7 5 91 t 6 100 + 603 t 5 500 + 663 t 4 2000 11313 t 3 25000 3143 t 2 1000000 + 18033 t 1000000 + 56491 2000000 ) , v 2 , 0 ( t ) = t 8 11 t 7 10 13 t 6 10 + 371 t 5 250 + 4539 t 4 10000 10893 t 3 100000 623 t 2 10000 + 2887 t 40000 1 160 + i ( t 8 + 11 t 7 10 + 129 t 6 100 1553 t 5 1000 1789 t 4 5000 + 3627 t 3 6250 + 557 t 2 100000 2599 t 40000 + 681 400000 ) , p 1 : v 1 , 1 ( t ) = t 9 + 21 t 8 10 + 7 t 7 20 2583 t 6 1000 + 3793 t 5 10000 + 115931 t 4 100000 273343 t 3 1000000 311893 t 2 2000000 + 227 t 31250 + 33877 4000000 + i ( t 9 11 t 8 5 21 t 7 100 + 679 t 6 250 1089 t 5 2000 61851 t 4 50000 + 334877 t 3 1000000 + 85843 t 2 500000 11841 t 1000000 9197 1000000 ) , v 2 , 1 ( t ) = t 9 21 t 8 10 7 t 7 10 + 1667 t 6 500 5051 t 5 10000 32061 t 4 20000 + 1777 t 3 5000 + 5801 t 2 20000 2473 t 40000 923 80000 + i ( t 9 + 21 t 8 10 + 69 t 7 100 3393 t 6 1000 + 422 t 5 625 + 9857 t 4 6250 2473 t 3 5000 23533 t 2 100000 + 13411 t 200000 923 80000 ) , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 , .
The approximate solution of Equation (85) is
u 1 ( t ) = 1 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 1 t 2 ( t 9 + 11 t 8 10 + 29 t 7 20 1633 t 6 1000 7037 t 5 10000 + 80561 t 4 100000 + 128267 t 3 1000000 296559 t 2 2000000 13671 t 2000000 73731 4000000 + i ( t 9 6 t 8 5 141 t 7 100 + 903 t 6 500 + 1323 t 5 2000 11319 t 4 12500 117643 t 3 1000000 + 168543 t 2 1000000 + 387 t 62500 + 38097 2000000 ) ) , u 2 ( t ) = 1 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 1 t 2 ( t 9 11 t 8 10 9 t 7 5 + 1017 t 6 500 + 9789 t 5 10000 22983 t 4 20000 757 t 3 4000 + 911 t 2 4000 + 207 t 20000 1423 80000 + i ( t 9 + 11 t 8 10 + 179 t 7 100 2103 t 6 1000 4389 t 5 5000 + 30483 t 4 25000 + 2143 t 3 25000 718 t 2 3125 + 13 t 6250 + 11233 800000 ) ) ,
which is identical to the exact solution.
Remark 9.
It is observed that the HPM provides an exact solution for the system of CSIEs (85) with any initial guess ( v 1 , 0 , v 2 , 0 ) .
Case 3. Let us search the semi-bounded solution of Equation (85) given in the form
u i ( t ) = 1 + t 1 t v i ( t ) , i = { 1 , 2 } .
By applying standard HPM (42) to Equation (86), we obtain
p 0 : v 1 , 0 ( t ) = t 8 + 11 t 7 10 + 19 t 6 20 1083 t 5 1000 3537 t 4 10000 + 40161 t 3 100000 + 7667 t 2 1000000 28199 t 2000000 13451 500000 + i ( t 8 6 t 7 5 91 t 6 100 + 603 t 5 500 + 663 t 4 2000 11313 t 3 25000 3143 t 2 1000000 + 18033 t 1000000 + 56491 2000000 ) , v 2 , 0 ( t ) = t 8 11 t 7 10 13 t 6 10 + 371 t 5 250 + 4539 t 4 10000 10893 t 3 100000 623 t 2 10000 + 2887 t 40000 1 160 + i ( t 8 + 11 t 7 10 + 129 t 6 100 1553 t 5 1000 1789 t 4 5000 + 3627 t 3 6250 + 557 t 2 100000 2599 t 40000 + 681 400000 ) ,
p 1 : v 1 , 1 ( t ) = t 7 8 t 6 5 + t 5 10 + 633 t 4 1000 + 1247 t 3 10000 40571 t 2 100000 + 263863 t 1000000 229697 1000000 + i ( t 7 + 17 t 6 10 19 t 5 100 343 t 4 500 197 t 3 2000 + 10913 t 2 25000 282867 t 1000000 + 485561 2000000 ) , v 2 , 1 ( t ) = t 7 + 8 t 6 5 + t 5 4 1209 t 4 1000 + 753 t 3 5000 + 2671 t 2 10000 1969 t 40000 127 20000 + i ( t 7 8 t 6 5 6 t 5 25 + 1273 t 4 1000 1381 t 3 5000 22397 t 2 100000 + 10723 t 200000 + 939 80000 ) ,
p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 , .
The approximate solution of Equation (85) for the semi-bounded solution case is
u 1 ( t ) = 1 + t 1 t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 + t 1 t ( t 8 + 21 t 7 10 13 t 6 20 983 t 5 1000 + 2793 t 4 10000 + 52631 t 3 100000 398043 t 2 1000000 + 499527 t 2000000 256599 1000000 + i ( t 8 11 t 7 5 + 79 t 6 100 + 127 t 5 125 709 t 4 2000 27551 t 3 50000 + 433377 t 2 1000000 132417 t 500000 + 135513 500000 ) ) ,   u 2 ( t ) = 1 + t 1 t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 + t 1 t ( t 8 21 t 7 10 + 3 t 6 10 + 867 t 5 500 7551 t 4 10000 7881 t 3 20000 + 128 t 2 625 + 459 t 20000 63 5000 + i ( t 8 + 21 t 7 10 31 t 6 100 1793 t 5 1000 + 572 t 4 625 + 7603 t 3 25000 273 t 2 1250 71 t 6250 + 42 3125 ) ) ,
which is identical to the exact solution.
Remark 10.
Similar to the other cases, the standard HPM provided the exact solution for any initial guess in this case.
Case 4. Let us search the semi-bounded solution of Equation (85) given in the following form
u i ( t ) = 1 t 1 + t v i ( t ) , i = { 1 , 2 } .
By applying standard HPM (42) to Equation (86), we obtain
p 0 : v 1 , 0 ( t ) = t 8 + 11 t 7 10 + 19 t 6 20 1083 t 5 1000 3537 t 4 10000 + 40161 t 3 100000 + 7667 t 2 1000000 28199 t 2000000 13451 500000 i ( t 8 6 t 7 5 91 t 6 100 + 603 t 5 500 + 663 t 4 2000 11313 t 3 25000 3143 t 2 1000000 + 18033 t 1000000 + 56491 2000000 ) , v 2 , 0 ( t ) = t 8 11 t 7 10 13 t 6 10 + 371 t 5 250 + 4539 t 4 10000 10893 t 3 100000 623 t 2 10000 + 2887 t 40000 1 160 i ( t 8 + 11 t 7 10 + 129 t 6 100 1553 t 5 1000 1789 t 4 5000 + 3627 t 3 6250 + 557 t 2 100000 2599 t 40000 + 681 400000 ) ,   p 1 : v 1 , 1 ( t ) = 2 t 8 6 t 7 5 5 t 6 2 + 583 t 5 500 + 2851 t 4 2500 10513 t 3 25000 38711 t 2 250000 + 7601 t 500000 + 871 25000 + i ( 2 t 8 + 7 t 7 5 + 63 t 6 25 701 t 5 500 1189 t 4 1000 + 25027 t 3 50000 + 84403 t 2 500000 20913 t 1000000 14927 400000 ) , v 2 , 1 ( t ) = 2 t 8 + 6 t 7 5 + 16 t 6 5 809 t 5 500 3917 t 4 2500 + 5809 t 3 10000 + 1439 t 2 5000 2977 t 40000 127 20000 + i ( 2 t 8 6 t 7 5 159 t 6 50 + 883 t 5 500 + 7243 t 4 5000 17721 t 3 25000 21981 t 2 100000 + 16099 t 200000 + 939 80000 ) , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 , .
The results of Equation (97) give the approximate solution of Equation (85) as follows
u 1 ( t ) = 1 t 1 + t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) ) = 1 t 1 + t ( t 8 t 7 10 31 t 6 20 + 83 t 5 1000 + 7867 t 4 10000 1891 t 3 100000 147177 t 2 1000000 + 441 t 400000 + 3969 500000 + i ( t 8 + t 7 5 + 161 t 6 100 49 t 5 250 343 t 4 400 + 2401 t 3 50000 + 165663 t 2 1000000 9 t 3125 567 62500 ) ) , u 2 ( t ) = 1 t 1 + t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) ) = 1 t 1 + t ( t 8 + t 7 10 + 19 t 6 10 67 t 5 500 11129 t 4 10000 + 29 t 3 800 + 451 t 2 2000 9 t 4000 63 5000 + i ( t 8 t 7 10 189 t 6 100 + 213 t 5 1000 + 2727 t 4 2500 3213 t 3 25000 1339 t 2 6250 + 97 t 6250 + 42 3125 ) ) ,
which is the exact solution of Example 2.
Remark 11.
In this semi-bounded case also, the standard HPM provided the exact solution for any initial guess.
Example 3
(Turhan et al. [12]): Consider the system of SIEs of the form
1 π 1 1 u 1 ( τ ) τ t d τ + 2 π 1 1 u 2 ( τ ) τ t d τ + 1 π 1 1 t 3 τ 3 u 1 ( τ ) d τ = 2 t 5 10 t 3 13 20 t , 3 π 1 1 u 1 ( τ ) τ t d τ + 1 π 1 1 u 2 ( τ ) τ t d τ + 1 π 1 1 t 5 τ 5 u 1 ( τ ) d τ = t 5 15 2 t 3 3 40 t .
Remark 12.
Turhan et al. [12] investigated Example 3, employing the Chebyshev series method to discover a bounded solution. Remarkably, they were able to achieve the exact solution successfully.
Before implementing the standard HPM, we apply the Gaussian elimination method, effectively reducing Equation (99) to the desired form
1 π 1 1 u 1 ( τ ) τ t d τ + 2 5 π 1 1 t 5 τ 5 u 1 ( τ ) d τ 1 5 π 1 1 t 3 τ 3 u 1 ( τ ) d τ = t 3 + 1 10 t 1 π 1 1 u 2 ( τ ) τ t d τ 1 5 π 1 1 t 5 τ 5 u 1 ( τ ) d τ + 3 5 π 1 1 t 3 τ 3 u 1 ( τ ) d τ = t 5 9 2 t 3 3 8 t
Case 1. We know that the bounded solution is searched in the form
u i ( t ) = 1 t 2 v i ( t ) , i = { 1 , 2 } .
In this case, the exact solution of Equation (99) is
u 1 ( t ) = 1 t 2 ( t 2 + 2 5 ) , u 2 ( t ) = 1 t 2 ( t 4 + 5 t 2 + 3 ) .
By comparing Equation (100) to Equation (18), we obtain the following
f 1 ( t ) = t 3 + 1 10 t , f 2 ( t ) = t 5 9 2 t 3 3 8 t , L 1 ( u 1 ( t ) ) = 1 π 1 1 u 1 ( τ ) τ t d τ , L 2 ( u 2 ( t ) ) = 1 π 1 1 u 2 ( τ ) τ t d τ , N 1 ( u 1 ( t ) ) = 2 5 π 1 1 t 5 τ 5 u 1 ( τ ) d τ 1 5 π 1 1 t 3 τ 3 u 1 ( τ ) d τ , N 2 ( u 2 ( t ) ) = 1 5 π 1 1 t 5 τ 5 u 1 ( τ ) d τ + 3 5 π 1 1 t 3 τ 3 u 1 ( τ ) d τ .
Using the standard HPM (36), we solve Equation (100) as follows
p 0 : v 1 , 0 ( t ) = t 3 + 1 10 t ,   v 2 , 0 ( t ) = t 5 9 2 t 3 3 8 t , p 1 : v 1 , 1 ( t ) = 3 320 t 4 1603 1600 t 2 5117 12800 , v 2 , 1 ( t ) = 643 640 t 4 + 31889 6400 t 2 + 76593 25600 , p 2 : v 1 , 2 ( t ) = 3 320 t 4 3 1600 t 2 + 3 12800 , v 2 , 2 ( t ) = 3 640 t 4 + 111 6400 t 2 + 207 25600 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 3 , 4 .
The approximate solution of Equation (99) is given by
u 1 ( t ) = 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) + v 1 , 2 ( t ) ) = 1 t 2 ( t 2 + 2 5 ) , u 2 ( t ) = 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) + v 2 , 2 ( t ) ) = 1 t 2 ( t 4 + 5 t 2 + 3 ) ,
which is identical to the exact solution.
Remark 13.
In the bounded case, the standard HPM (36), gave an exact solution for any initial guess.
Case 2. Let us search the unbounded solution of Equation (99) by using standard HPM (36) of the form
u i ( t ) = 1 1 t 2 v i ( t ) , i = { 1 , 2 } .
The exact unbounded solution of Equation (99) is
u 1 ( t ) = 1 1 t 2 ( t 4 + 3 5 t 2 + 3 40 ) , u 2 ( t ) = 1 1 t 2 ( t 6 4 t 4 + 2 t 2 + 13 16 ) .
It is known that Equation (99) is equivalent to Equation (100). Therefore, we can apply standard HPM (36) to Equation (100), which yields
p 0 : v 1 , 0 ( t ) = t 10 + 2 ,   v 2 , 0 ( t ) = 3 t 8 + 2 , p 1 : v 1 , 1 ( t ) = 1 8 t 6 789 800 t 4 + 1913 3200 t 2 1 10 t 12321 6400 , v 2 , 1 ( t ) = 159 160 t 6 6441 1600 t 4 + 12867 6400 t 2 + 3 8 t 15169 12800 , p 2 : v 1 , 1 ( t ) = 1 80 t 6 11 800 t 4 + 7 3200 t 2 + 1 6400 , v 2 , 1 ( t ) = 1 160 t 6 + 41 1600 t 4 67 6400 t 2 31 12800 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 3 , 4 .
The approximate solution of Equation (99) for the unbounded case is
u 1 ( t ) = 1 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) + v 1 , 2 ( t ) ) = 1 1 t 2 ( t 4 + 3 5 t 2 + 3 40 ) , u 2 ( t ) = 1 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) + v 2 , 2 ( t ) ) = 1 1 t 2 ( t 6 4 t 4 + 2 t 2 + 13 16 ) ,
which is identical to the exact solution.
Remark 14.
In the unbounded case, the standard HPM (36) also gave an exact solution for any initial guess.
Case 3. Let us now search for the semi-bounded solution of Equation (99) given in the form
u i ( t ) = 1 + t 1 t v i ( t ) , i = { 1 , 2 } .
The exact semi-bounded solution of Equation (99) is
u 1 ( t ) = 1 + t 1 t ( t 3 + t 2 2 5 t + 2 5 ) , u 2 ( t ) = 1 + t 1 t ( t 5 + t 4 5 t 3 + 5 t 2 3 t + 3 ) .
In this case, we apply standard HPM (36) to solve Equation (100), yielding
p 0 : v 1 , 0 ( t ) = t 10 ,   v 2 , 0 ( t ) = ( 9 2 t 3 3 8 t ) , p 1 : v 1 , 1 ( t ) = 40 t 5 40 t 4 + 3196 t 3 3196 t 2 + 1603 t 1283 3200 , v 2 , 1 ( t ) = 6360 t 5 6360 t 4 + 3324 t 3 32124 t 2 + 16857 t 19257 6400 , p 2 : v 1 , 2 ( t ) = 40 t 5 40 t 4 4 t 3 + 4 t 2 + 3 t 3 3200 , v 2 , 2 ( t ) = 40 t 5 40 t 4 124 t 3 + 124 t 2 57 t + 57 6400 p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (99) for the semi-bounded is
u 1 ( t ) = 1 + t 1 t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) + v 1 , 2 ( t ) ) = 1 + t 1 t ( t 3 + t 2 2 5 t + 2 5 ) , u 2 ( t ) = 1 + t 1 t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) + v 2 , 2 ( t ) ) = 1 + t 1 t ( t 5 + t 4 5 t 3 + 5 t 2 3 t + 3 ) ,
which is identical to the exact solution.
Remark 15.
In the semi-bounded case, the standard HPM (36) gave an exact solution for any initial guess.
Case 4. Let us search the semi-bounded solution of Equation (99) given by
u i ( t ) = 1 t 1 + t v i ( t ) , i = { 1 , 2 } .
The exact semi-bounded solution of Equation (99) is
u 1 ( t ) = 1 t 1 + t ( t 3 + t 2 + 2 5 t + 2 5 ) , u 2 ( t ) = 1 t 1 + t ( t 5 + t 4 + 5 t 3 + 5 t 2 + 3 t + 3 ) .
By applying standard HPM (36), we obtain
p 0 : v 1 , 0 ( t ) = t 10 ,   v 2 , 0 ( t ) = 9 2 t 3 3 8 t , p 1 : v 1 , 1 ( t ) = 40 t 5 + 40 t 4 + 3196 t 3 + 3196 t 2 + 963 t + 1283 3200 , v 2 , 1 ( t ) = 6360 t 5 + 6360 t 4 + 60924 t 3 + 32124 t 2 + 21657 t + 19257 6400 , p 2 : v 1 , 2 ( t ) = 40 t 5 40 t 4 + 4 t 3 + 4 t 2 3 t 3 3200 , v 2 , 2 ( t ) = 40 t 5 + 40 t 4 124 t 3 124 t 2 57 t 57 6400 p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 2 , 3 .
The approximate solution of Equation (99) for the semi-bounded is
u 1 ( t ) = 1 t 1 + t ( v 1 , 0 ( t ) + v 1 , 1 ( t ) + v 1 , 2 ( t ) ) = 1 t 1 + t ( t 3 + t 2 + 2 5 t + 2 5 ) , u 2 ( t ) = 1 t 1 + t ( v 2 , 0 ( t ) + v 2 , 1 ( t ) + v 2 , 2 ( t ) ) = 1 t 1 + t ( t 5 + t 4 + 5 t 3 + 5 t 2 + 3 t + 3 ) ,
which is identical to the exact solution.
Remark 16.
The standard HPM (36) gave an exact solution for any initial guess.
Example 4
(Ahdiaghdam and Shahmorad [14]): Consider the system of SIEs of the form
1 1 u 1 ( τ ) τ t d τ + 1 1 ( τ t ) u 1 ( τ ) d τ + 1 1 t u 2 ( τ ) d τ = π , 1 1 u 2 ( τ ) τ t d τ + 1 1 τ u 1 ( τ ) d τ + 1 1 ( τ + t ) u 2 ( τ ) d τ = 2 π t , 1 < t < 1 .
The exact unbounded solution is given by
u 1 ( t ) = 2 t 3 1 t 2 , u 2 ( t ) = 18 t 2 2 t 9 9 1 t 2 .
Remark 17.
Example 4 is considered by Ahdiaghdam and Shahmorad [14], who found the unbounded solution as follows
u 1 ( t ) = 2 t + 6 3 1 t 2 , u 2 ( t ) = 2 t 18 9 1 t 2 .
Solution (116) does not satisfy the condition in Equation (9). Fortunately, solution (115) satisfies the condition in Equation (9). Therefore, the real exact solution of Equation (114) should be given as Equation (115). Authors in [14] found exact solutions for the unbounded and semi-bounded cases.
Case 2. Following is the search for the unbounded solution.
u i ( t ) = 1 1 t 2 v i ( t ) , i = { 1 , 2 } .
Comparing Equation (114) with Equation (18), we obtain
f 1 ( t ) = 1 , f 2 ( t ) = 2 t , L 1 ( u 1 ( t ) ) = 1 π 1 1 u 1 ( τ ) τ t d τ , L 2 ( u 2 ( t ) ) = 1 π 1 1 u 2 ( τ ) τ t d τ , N 1 ( u 1 ( t ) ) = 1 π 1 1 ( τ t ) u 1 ( τ ) d τ + 1 π 1 1 t u 2 ( τ ) d τ N 2 ( u 2 ( t ) ) = 1 π 1 1 τ u 1 ( τ ) d τ + 1 π 1 1 ( τ + t ) u 2 ( τ ) d τ .
The initial guess is chosen as the following function
u 1 , 0 ( t ) = 2 t + 6 3 ,   u 2 , 0 ( t ) = 2 t 18 9 .
Standard HPM (36) is then applied, where the results are
p 0 : v 1 , 0 ( t ) = 2 t + 6 3 ,   v 2 , 0 ( t ) = 2 t 18 9 , p 1 : v 1 , 1 ( t ) = 2 ,   v 2 , 1 ( t ) = 2 , p 2 : v 1 , 2 ( t ) = 0 ,   v 2 , 2 ( t ) = 2 t 2 1 , p k : v 1 , k ( t ) = 0 ,   v 2 , k ( t ) = 0 ,   k = 3 , 4 .
The approximate solution of Equation (114) is given by
u 1 ( t ) = 1 1 t 2 ( v 1 , 0 ( t ) + v 1 , 1 ( t ) + v 1 , 2 ( t ) ) = 2 t 3 1 t 2 , u 2 ( t ) = 1 1 t 2 ( v 2 , 0 ( t ) + v 2 , 1 ( t ) + v 2 , 2 ( t ) ) = 18 t 2 2 t 9 9 1 t 2 ,
which is identical to the exact solution.
Let us choose the following initial guess for Equation (114) that is far from the exact solution
u 1 , 0 ( t ) = 1 , u 2 , 0 ( t ) = 1 .
By the chosen initial guess, we solve Equation (114) using the standard HPM. Then, we calculate the error functions by using Maple. Here, the error function is  E i ( t ) = | u i ( t ) v i ( t ) | , i = { 1 , 2 } .
In Table 1, the results demonstrate the robustness and convergence of the method employed in our study.
Regardless of the initial guess chosen, whether close to or far from the exact solution, we observe that the obtained results consistently approach the exact solution. This finding is significant because it indicates the stability and effectiveness of the method in finding the solution, regardless of the starting point. Furthermore, it suggests that the algorithm used in our study has a strong capability to converge towards the desired solution, even if the initial guess is not particularly accurate.
Remark 18.
In Example 4, we have chosen two types of initial guesses (119) and (122). Since the initial guess (119) satisfies Equation (114), we obtain the exact solution. On the other hand, the initial guess (122) does not satisfy Equation (114). Hence, we obtain high accurate approximation solution.
Case 3. Let us search the semi-bounded solution of Equation (114) given in the form
u i ( t ) = 1 + t 1 t v i ( t ) , i = { 1 , 2 } .
In this case, we define the exact solution for Equation (114) as
u 1 ( t ) = 1 + t 1 t ( 56 27 t 38 27 ) , u 2 ( t ) = 1 + t 1 t ( 40 9 t 14 3 ) .
Let us choose the following initial guess given by
u 1.0 ( t ) = f 1 ( t ) = 1 , u 2.0 ( t ) = f 2 ( t ) = 2 t .
We then solve Equation (114) via the standard HPM.
In Table 2, displays the error term of Equation (114) for the semi-bounded case. It indicates a significant reduction in the error term as the number of iteration increases. The proposed method approaches the exact solution with fifty iterations.
Using Equation (37) for choosing the initial guess by decomposition function, we obtain the following
f 1 ( t ) = f 1 , 1 ( t ) + f 1 , 2 ( t ) = 1 , f 1 , 1 ( t ) = 1 2 , f 1 , 2 ( t ) = 1 2 , f 2 ( t ) = f 2 , 1 ( t ) + f 2 , 2 ( t ) = 2 x ,   f 2 , 1 ( t ) = x , f 2 , 2 ( t ) = x .
We solve Equation (114) using MHPM (38) with the chosen initial guess, then compare the results obtained from the HPM and MHPM.
In Table 3, we can observe the error term of Equation (114) for both the MHPM and the HPM. The comparison highlights that the error of MHPM is slightly better than the error of the HPM. It shows that the decomposition function allows the MHPM approaches to obtain the exact solution faster than standard HPM.
Case 4. We can search the semi-bounded solution of Equation (114) given in the form
u i ( t ) = 1 t 1 + t v i ( t ) , i = { 1 , 2 } .
In this case, the exact solution for Equation (114) is defined as
u 1 ( t ) = 1 t 1 + t ( 16 27 t 34 27 ) , u 2 ( t ) = 1 t 1 + t ( 32 9 t 10 3 ) .
Let us choose the following initial guess given by
u 1 , 0 ( t ) = ( t + 1 ) , u 2 , 0 ( t ) = 2 t .
By the chosen initial guess, we solve Equation (114) using the standard HPM.
In Table 4, presents the error term of Equation (114) for the semi-bounded case. It becomes evident that as the number of iterations increases, the error term experiences a significant reduction.

6. Conclusions

In this paper, we have introduced and developed the homotopy perturbation method (HPM) as a semi-analytical solution technique for the system of singular integral equations of the first kind. This method offers a novel approach to tackling this challenging class of equations and has shown promising results in our study. Furthermore, we have applied the HPM to several illustrative examples, as demonstrated earlier. These examples provided valuable insights into the performance and effectiveness of the HPM compared to the Chebyshev series method, which is commonly used for solving singular integral equations. The results obtained from the numerical examples clearly indicated that the HPM outperformed the Chebyshev series method in terms of accuracy and convergence. The solutions obtained through the HPM were in excellent agreement with the exact solutions, validating the reliability and robustness of the method.
By showcasing the numerical examples, we have not only demonstrated the capability of the HPM to produce accurate results but also emphasized its superiority over existing methods. The fact that the HPM coincided with the exact solutions in the examples further strengthens our confidence in its applicability and effectiveness for solving the system of singular integral equations of the first kind. Overall, our study highlights the successful development and application of the HPM for solving a challenging class of equations. The numerical examples presented in this paper provide compelling evidence of the HPM’s superiority over alternative methods, as it consistently yields accurate solutions that coincide with the exact solutions. This suggests that the HPM has the potential to be a valuable tool in various scientific and engineering applications involving singular integral equations.
This characteristic of the method is crucial in practical applications, as it provides reassurance that the algorithm will consistently yield reliable results, irrespective of the initial conditions. It demonstrates the method’s ability to overcome potential errors or uncertainties associated with the initial guess and ensures the accuracy of the final solution. The convergence of the results, regardless of the initial guess, provides confidence in the reliability and robustness of the method. Furthermore, it implies that the method is not sensitive to the choice of initial conditions and can efficiently find the solution under various circumstances. Overall, the findings in Table 1, Table 2, Table 3 and Table 4 reinforce the effectiveness and suitability of the method used in our study, as it consistently approaches the exact solution regardless of the initial guess, validating its stability and robustness in practical applications.

Author Contributions

Researcher H.X.M. contributed on methodology, software, formal analysis, numerical analysis, writing—original draft preparation, investigation resources. Researcher Z.K.E. contributed on methodology, theoretical analysis, supervision, and project administration, visualization, funding acquisition. Researcher S.I. contributed on conceptualization, validation, writing—review and editing, visualization, supervision, funding acquisition. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

This work is part of a research project, UMT/CRIM/2-2/2/14 Jld. 4(44), Project code: TAPE-RG-55233. The authors are grateful for the support of the work by the Research Grant Scheme, Universiti Malaysia Terengganu.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Jakeman, A.J.; Anderssen, R.S. Abel Type Integral Equations in Stereology: I. General Discussion. J. Microsc. 1975, 105, 121–133. [Google Scholar] [CrossRef]
  2. Healy, S.B.; Haase, J.; Lesne, O. Abel Transform Inversion of Radio Occultation Measurements Made with a Receiver inside the Earth’s Atmosphere. In Proceedings of the Annales Geophysicae; Copernicus Publications: Göttingen, Germany, 2002; Volume 20, pp. 1253–1256. [Google Scholar]
  3. Bracewell, R.N.; Riddle, A.C. Inversion of Fan-Beam Scans in Radio Astronomy. Astrophys. J. 1967, 150, 427–434. [Google Scholar] [CrossRef]
  4. Buck, U. Inversion of Molecular Scattering Data. Rev. Mod. Phys. 1974, 42, 369–389. [Google Scholar] [CrossRef]
  5. Kosarev, E.L. Applications of Integral Equations of the First Kind in Experiment Physics. Comput. Phys. Commun. 1980, 20, 69–75. [Google Scholar] [CrossRef]
  6. Hellsten, H.; Andersson, L.E. An Inverse Method for the Processing of Synthetic Aperture Radar Data. Inverse Probl. 1987, 3, 111–124. [Google Scholar] [CrossRef]
  7. Fleurier, C.; Chapelle, J. Inversion of ABEL’s Integral Equation—Application to Plasma Spectroscopy. Comput. Phys. Commun. 1974, 35, 200–206. [Google Scholar] [CrossRef]
  8. Glantschnig, W.J.; Holliday, A. Mass Fraction Profiling Based on X-Ray Tomography and Its Application to Characterizing Porous Silica Boules. Appl. Opt. 1987, 26, 983–989. [Google Scholar] [CrossRef]
  9. Erdogan, F. Approximate Solutions of Systems of Singular Integral Equations. SIAM J. Appl. Math. 1969, 17, 1041–1059. [Google Scholar] [CrossRef]
  10. Kumar, S.; Singh, O.P.; Dixit, S. Homotopy Perturbation Method for Solving System of Generalized Abel’s Integral Equations. Appl. Appl. Math. An Int. J. 2011, 6, 2009–2024. [Google Scholar]
  11. Wazwaz, A.-M. Nonlinear Volterra Integral Equations. In Linear and Nonlinear Integral Equations; Wazwaz, A.-M., Ed.; Springer: Berlin/Heidelberg, Germany, 2011; pp. 387–423. ISBN 978-3-642-21449-3. [Google Scholar]
  12. Turhan, İ.; Oğuz, H.; Yusufoğlu, E. Chebyshev Polynomial Solution of the System of Cauchy-Type Singular Integral Equations of the First Kind. Int. J. Comput. Math. 2013, 90, 944–954. [Google Scholar] [CrossRef]
  13. Duru, H.K.; Yusufoğlu, E. Solution of the System of Cauchy-Type Singular Integral Equations of the First Kind by Third- and Fourth-Kind Chebyshev Polynomials. In Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014), Rodhes, Greece, 22–28 September 2014. [Google Scholar] [CrossRef]
  14. Ahdiaghdam, S.; Shahmorad, S. Approximate Solution of a System of Singular Integral Equations of the First Kind by Using Chebyshev Polynomials. Iran. J. Numer. Anal. Optim. 2019, 9, 31–47. [Google Scholar] [CrossRef]
  15. Didgar, M.; Vahidi, A. An Approximate Approach for Systems of Singular Volterra Integral Equations Based on Taylor Expansion. Commun. Theor. Phys. 2018, 70, 145–152. [Google Scholar] [CrossRef]
  16. Ladopoulos, E.G. Singular Integral Equations; Springer: Berlin/Heidelberg, Germany, 2000. [Google Scholar] [CrossRef]
  17. Ioakimidis, N.I. Supplementing the Numerical Solution of Singular/Hypersingular Integral Equations/Inequalities with Parametric Inequality Constraints with Applications to Crack Problems. Comput. Assist. Methods Eng. Sci. 2017, 24, 41–65. [Google Scholar]
  18. Ioakimidis, N.I.; Anastasselos, G.T. Direct Taylor-Series Solution of Singular Integral Equations with MAPLE. Comput. Struct. 1992, 45, 613–617. [Google Scholar] [CrossRef]
  19. Eshkuvatov, Z. Homotopy Perturbation Method and Chebyshev Polynomials for Solving a Class of Singular and Hypersingular Integral Equations. Numer. Algebr. Control Optim. 2018, 8, 337–350. [Google Scholar] [CrossRef]
  20. Eshkuvatov, Z.K.; Zulkarnain, F.S.; Nik Long, N.M.A.; Muminov, Z. Homotopy Perturbation Method for the Hypersingular Integral Equations of the First Kind. Ain Shams Eng. J. 2018, 9, 3359–3363. [Google Scholar] [CrossRef]
  21. Eshkuvatov, Z.K.; Nik Long, N.M.A.; Abdulkawi, M. Approximate Solution of Singular Integral Equations of the First Kind with Cauchy Kernel. Appl. Math. Lett. 2009, 22, 651–657. [Google Scholar] [CrossRef]
  22. Muskheleshvili, N.I. Singular integral equations with Cauchy type kernels. In Singular Integral Equations; Chap., 6; Radok, J.R.M., Ed.; Dover Publications: New York, NY, USA, 2008; pp. 123–128. [Google Scholar]
  23. Lifanov, I.K. Singular Integral Equations and Discrete Vortices; De Gruyter: Berlin, Germany; Boston, MA, USA, 1996; pp. 45–53. ISBN 906764207X. [Google Scholar]
  24. Aminikhah, H.; Salahi, M. A New HPM for Integral Equations. Appl. Appl. Math. Int. J. 2009, 4, 122–133. [Google Scholar]
  25. Biazar, J.; Ghazvini, H. Numerical Solution for Special Nonlinear Fredholm Integral Equation by HPM. Appl. Math. Comput. 2008, 195, 681–687. [Google Scholar] [CrossRef]
  26. Abbasbandy, S. Application of He’s Homotopy Perturbation Method to Functional Integral Equations. Chaos Solitons Fractals 2007, 31, 1243–1247. [Google Scholar] [CrossRef]
  27. Abbasbandy, S. Numerical Solutions of the Integral Equations: Homotopy Perturbation Method and Adomian’s Decomposition Method. Appl. Math. Comput. 2006, 173, 493–500. [Google Scholar] [CrossRef]
  28. Abbasbandy, S. The Application of Homotopy Analysis Method to Nonlinear Equations Arising in Heat Transfer. Phys. Lett. A 2006, 360, 109–113. [Google Scholar] [CrossRef]
  29. Odibat, Z.; Momani, S. Modified Homotopy Perturbation Method: Application to Quadratic Riccati Differential Equation of Fractional Order. Chaos Solitons Fractals 2008, 36, 167–174. [Google Scholar] [CrossRef]
  30. Siddiqui, A.M.; Mahmood, R.; Ghori, Q.K. Homotopy Perturbation Method for Thin Film Flow of a Third Grade Fluid down an Inclined Plane. Chaos Solitons Fractals 2008, 35, 140–147. [Google Scholar] [CrossRef]
  31. Cveticanin, L. Homotopy–Perturbation Method for Pure Nonlinear Differential Equation. Chaos Solitons Fractals 2006, 30, 1221–1230. [Google Scholar] [CrossRef]
  32. Eshkuvatov, Z.K.; Ismail, S.; Mamatova, H.X.; Viscarra, D.S.; Aloev, R.D. Modified HAM for solving linear system of Fredholm-Volterra Integral Equations. Malays. J. Math. Sci. 2022, 16, 87–103. [Google Scholar] [CrossRef]
  33. Boujemaa, H.; Oulgiht, B.; Ragusa, M.A. A new class of fractional Orlicz-Sobolev space and singular elliptic problems. J. Math. Anal. Appl. 2023, 526, 127342. [Google Scholar] [CrossRef]
  34. Liu, X.; Bo, Y.; Jin, Y.F. A numerical method for the variable-order time-fractional wave equations based on the H2N2 approximation. J. Funct. Sapces 2022, 2022, 3438289. [Google Scholar] [CrossRef]
  35. Zhang, W.; Li, R. Strong convergence of the Euler-Maruyama method for the generalized stochastic Volterra integral equations driven by Levy noise. Filomat 2022, 36, 6713–6734. [Google Scholar] [CrossRef]
  36. Eberly, D. Stability Analysis for Systems of Differential Equations; Geometric Tools, LLC: Redmond, WA, USA, 2008. [Google Scholar]
  37. Elliott, D. A Convergence Theorem For Singular Integral Equations. Austral. Math. Soc. 1981, 22, 539–552. [Google Scholar] [CrossRef]
  38. Ayati, Z.; Biazar, J. On the Convergence of Homotopy Perturbation Method. J. Egypt. Math. Soc. 2015, 23, 424–428. [Google Scholar] [CrossRef]
  39. Eshkuvatov, Z.K.; Ahmedov, A.; Nik Long, N.M.A.; Amalina, N.J. Approximating Cauchy-Type Singular Integral by an Automatic Quadrature Scheme. J. Comput. Appl. Math. 2011, 235, 4675–4686. [Google Scholar] [CrossRef]
  40. Sharma, V.; Setia, A.; Agarwal, R.P. Numerical Solution for System of Cauchy Type Singular Integral Equations with Its Error Analysis in Complex Plane. Appl. Math. Comput. 2018, 328, 338–352. [Google Scholar] [CrossRef]
Table 1. Errors term (unbounded solution) of Equation (114) for standard HPM at M = 50.
Table 1. Errors term (unbounded solution) of Equation (114) for standard HPM at M = 50.
tU1(t)U2(t)E1(t)E2(t)
−0.95−2.028289948197773.254159925661161.8014833608 × 10−158.947367359 × 10−14
−0.70−0.653464039213070.189815744723795.8039265767 × 10−162.882616866 × 10−14
−0.30−0.20965696734438−0.789707910330511.8621279393 × 10−169.248568765 × 10−15
0.000.00000000000000−1.000000000000000.00000000000000.000000000000
0.500.38490017945975−0.705650329009543.418600331 × 10−161.697904831 × 10−14
0.700.65346403921307−0.245826948084915.803926576 × 10−162.882616866 × 10−14
0.952.028289948197771.901966626862641.801483360 × 10−158.947367359 × 10−14
Table 2. Errors term (semi-bounded solution) of Equation (114) for standard HPM at M = 50.
Table 2. Errors term (semi-bounded solution) of Equation (114) for standard HPM at M = 50.
tU1(t)U2(t)E1(t)E2(t)
−0.95−0.5408773195194−1.42336136715631.3650345104957 × 10−131.2578778554944 × 10−15
−0.70−1.2011291387440−3.26732019606533.1217939169280 × 10−131.9733350361090 × 10−15
−0.30−1.4893409754315−4.40279631423204.1695251528505 × 10−132.6069791150908 × 10−16
0.00−1.4074074074074−4.66666666666664.3701667798948 × 10−134.1448326252672 × 10−15
0.50−0.6415002990995−4.23390197405723.7821114999152 × 10−131.8118581756136 × 10−14
0.700.1057989396821−3.70296288887403.1159899903512 × 10−133.0915582232374 × 10−14
0.953.5157025768761−2.77555466595481.3470196768869 × 10−131.0082617926126 × 10−13
Table 3. The error term of MHPM ( ε i ( t ) ) and HPM ( E i ( t ) ) for M = 50.
Table 3. The error term of MHPM ( ε i ( t ) ) and HPM ( E i ( t ) ) for M = 50.
t ε 1 ( t ) ε 2 ( t ) E1(t)E2(t)
−0.953.6481618306462 × 10−142.2550146982292 × 10−151.3650345104957 × 10−131.2578778554944 × 10−15
−0.708.3428680766814 × 10−144.8172590587367 × 10−153.1217939169280 × 10−131.9733350361090 × 10−15
−0.301.1141697686596 × 10−135.3443071859360 × 10−154.1695251528505 × 10−132.6069791150908 × 10−16
0.001.1676256669354 × 10−134.1448326252672 × 10−154.3701667798948 × 10−134.1448326252672 × 10−15
0.501.0099115145525 × 10−131.8802301822417 × 10−153.7821114999152 × 10−131.8118581756136 × 10−14
0.708.3138484437974 × 10−147.5644509717512 × 10−153.1159899903512 × 10−133.0915582232374 × 10−14
0.953.5580876626020 × 10−143.6176630333961 × 10−141.3470196768869 × 10−131.0082617926126 × 10−13
Table 4. Errors term of standard HPM for Equation (114) with M = 50.
Table 4. Errors term of standard HPM for Equation (114) with M = 50.
tU1(t)U2(t)E1(t)E2(t)
−0.95−4.348368976662580.27755546659542.3368952774 × 10−131.8593678657 × 10−13
−0.70−2.01017985396020−2.01017985396ther025.4151602282 × 10−135.4078776822× 10−14
−0.30−1.47381082970237−3.088945985540587.24423287407 × 10−131.5573596666 × 10−14
0.00−1.25925925925925−3.333333333333337.59655712819 × 10−132.9605947323 × 10−15
0.50−0.89810041873941−2.950901375858086.580520754485 × 10−136.4383639573 × 10−15
0.70−0.70325177553406−2.445822546768925.426768081409 × 10−137.0559164526 × 10−15
0.95−0.29178908026704−1.074637832203022.372924944696 × 10−133.8194607747 × 10−15
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

Mamatova, H.X.; Eshkuvatov, Z.K.; Ismail, S. A Hybrid Method for All Types of Solutions of the System of Cauchy-Type Singular Integral Equations of the First Kind. Mathematics 2023, 11, 4404. https://doi.org/10.3390/math11204404

AMA Style

Mamatova HX, Eshkuvatov ZK, Ismail S. A Hybrid Method for All Types of Solutions of the System of Cauchy-Type Singular Integral Equations of the First Kind. Mathematics. 2023; 11(20):4404. https://doi.org/10.3390/math11204404

Chicago/Turabian Style

Mamatova, H. X., Z. K. Eshkuvatov, and Sh. Ismail. 2023. "A Hybrid Method for All Types of Solutions of the System of Cauchy-Type Singular Integral Equations of the First Kind" Mathematics 11, no. 20: 4404. https://doi.org/10.3390/math11204404

APA Style

Mamatova, H. X., Eshkuvatov, Z. K., & Ismail, S. (2023). A Hybrid Method for All Types of Solutions of the System of Cauchy-Type Singular Integral Equations of the First Kind. Mathematics, 11(20), 4404. https://doi.org/10.3390/math11204404

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