Next Article in Journal
Statistics for Continuous Time Markov Chains, a Short Review
Previous Article in Journal
A Robust Framework for Probability Distribution Generation: Analyzing Structural Properties and Applications in Engineering and Medicine
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Comprehensive Study of Nonlinear Mixed Integro-Differential Equations of the Third Kind for Initial Value Problems: Existence, Uniqueness and Numerical Solutions

1
School of Mathematics, Harbin Institute of Technology, Harbin 150001, China
2
Department of Mathematics, Faculty of Science, Benha University, Benha 13518, Egypt
3
Department of Statistic and Operations Research, College of Science, King Saud University, Riyadh 11451, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(4), 282; https://doi.org/10.3390/axioms14040282
Submission received: 29 January 2025 / Revised: 19 March 2025 / Accepted: 24 March 2025 / Published: 8 April 2025
(This article belongs to the Section Mathematical Analysis)

Abstract

:
Nonlinear mixed integro-differential equations (NM-IDEs) of the third kind present a complex challenge during solving initial value problems (IVPs), particularly after converting them from standard forms. In this work, we address the existence and uniqueness of a type of NM-IDEs employing Picard’s method. Additionally, we estimate the solution using the homotopy analysis method (HAM) and analyze the convergence of the approach. To demonstrate the credibility of the theoretical results, various applications are given, and the numerical results are displayed in a group of figures and tables to highlight that solving IVPs by first converting them to NM-IDEs and using the HAM is a computationally efficient approach.

1. Introduction

Second-order ordinary initial value problems (IVPs) and integral equations (IEs) are frequently encountered in the domains of physical mathematics and engineering [1,2,3,4,5,6]. Furthermore, an abundance of theoretical and numerical studies on IVPs and IEs solutions has been published, and many authors have worked seriously in recent years to investigate their solutions [7,8,9,10,11,12,13]. For instance, symmetric Obrechkoff methods for solving a certain class of IVPs related to second-order ordinary differential equations (ODEs) were addressed by Achar [14]. In a study by Wang et al. [15], Filon-type asymptotic approaches were explored and developed for solving highly oscillatory second-order IVPs. Furthermore, Rahmanzadeh et al. [16] provided a comparison of the Euler, Runge–Kutta, and implicit Runge–Kutta methods for solving certain IVPs. The discontinuous Galerkin approach was introduced and examined by Baccouch [17,18], involving nonlinear second-order IVPs for ODEs. Moreover, Ramosa [19] introduced block multistep methods to obtain numerical solutions for second-order IVPs. An explicit Obrechkoff approach for solving second-order linear periodic and oscillatory IVPs of ODEs was introduced by Khalsaraei and Shokri [20]. Chen et al. [9] introduced a novel reproducing kernel approach for Duffing equations. Furthermore, Yüzbaşı [21] solved the nonlinear Fredholm–Volterra IDEs through a collocation method driven by Bernstein polynomials, and Alalyani et al. [22] solved a third-kind mixed integro-differential equation with a singular kernel using the orthogonal polynomial method and the separation of variables, reducing the MIDE to Fredholm integral equations, focusing on a specific type of equation transformation. For the purpose of solving NIDEs, Hemeda [23] suggested a pleasant iterative method. Motivated by the above discussions, we consider the nonlinear second-order ordinary IVPs of the form
μ ( ξ ) u ( ξ ) = h ( ξ ) + Γ [ ξ , u ( ξ ) , u ( ξ ) ] , ξ [ 0 , T ]
with the conditions
u ( 0 ) = c 0 , u ( 0 ) = c 1 ,
where μ ( ξ ) and h ( ξ ) are given smooth functions, Γ is a nonlinear function, and c j for j = 0 , 1 are constants. The considered equation appears in many applications in dynamical systems [24,25,26]. By integrating Equation (1), we obtain
μ ( ξ ) u ( ξ ) μ ( 0 ) u ( 0 ) μ ( ξ ) u ( ξ ) + μ ( 0 ) u ( 0 ) + 0 ξ μ ( s ) u ( s ) d s = 0 ξ h ( s ) d s + 0 ξ Γ [ s , u ( s ) , u ( s ) ] d s .
By integrating Equation (2), we obtain
μ ( ξ ) u ( ξ ) = μ ( 0 ) u ( 0 ) + 0 ξ [ 2 μ ( s ) ( ξ s ) μ ( s ) ] u ( s ) d s { μ ( 0 ) u ( 0 ) μ ( 0 ) u ( 0 ) } ξ + 0 ξ ( ξ s ) h ( s ) d s + 0 t ( ξ s ) Γ [ s , u ( s ) , u ( s ) ] d s .
Equation (3) can be generalized as an NM-IDE of the third kind as follows:
μ ( ξ ) u ( ξ ) = H ( ξ ) + λ 0 ξ k 1 ( ξ , τ ) u ( τ ) d τ + λ 0 ξ k 2 ( ξ , τ ) Γ [ τ , u ( τ ) , u ( τ ) ] d τ ,
where H ( ξ ) = μ ( 0 ) u ( 0 ) { μ ( 0 ) u ( 0 ) μ ( 0 ) u ( 0 ) } ξ + 0 ξ ( ξ τ ) h ( τ ) d τ and k 1 ( ξ , τ ) = 2 μ ( τ ) ( ξ τ ) μ ( τ ) and k 2 ( ξ , τ ) = ξ τ .
This study makes the following significant contributions:
  • Converting the IVPs to a form of NM-IDEs of the third kind.
  • Investigating the solvability of the second- and the third-kind NM-IDEs via Picard’s method.
  • Applying the homotoy analysis method to express the solution of the equation under consideration in addition to the convergence of the approach.
The structure of this document is as follows: We examine the solvability of third-kind NM-IDEs (4) in Section 2. Furthermore, Section 3 discusses using the HAM to solve the equations under consideration. A number of numerical examples are performed in Section 4. Finally, conclusions for this paper are summarized in Section 5.

2. Solvability of NM-IDEs of the Third Kind

Now, we shall consider the space C [ 0 , T ] which denotes the space of continuous functions defined on the interval [ 0 , T ] . In addition, we indicate that Equation (4) has a unique solution u ( ξ ) C [ 0 , T ] under the following conditions:
1.
The kernels k 1 ( ξ , τ ) and k 2 ( ξ , τ ) are continuous in C [ 0 , T ] and fulfill the following: | k 1 ( ξ , τ ) | J 1 and | k 2 ( ξ , τ ) | J 2 ,   ξ ,   τ [ 0 , T ] , 0 τ ξ T < 1 .
2.
The functions μ ( ξ ) and H ( ξ ) are continuous in the space C [ 0 , T ] , satisfying | μ ( ξ ) | J 3 and | H ( ξ ) | J 4 .
3.
The nonlinear function Γ ( ξ , u ( ξ ) , u ( ξ ) ) satisfies
i.
The Lipschitz condition
Γ ( ξ , u 2 ( t ) , u 2 ( ξ ) ) Γ ( ξ , u 1 ( ξ ) , u 1 ( ξ ) ) J 5 u 2 ( ξ ) u 1 ( ξ ) .
ii.
The inequality Γ ( ξ , u , u ) J 6 u ,
where . denotes the supremum norm in the space C [ 0 , T ] , defined as
u ( ξ ) = max 0 ξ T | u ( ξ ) | ,
and the constants J l , l = 1 , 2 , . . , 6 are positive.
Theorem 1. 
If Conditions (1), (2), and (3.i) are fulfilled and
| λ | < J 3 ( J 1 + J 2 J 5 ) T ,
then a distinct solution exists for Equation (4) within the under consideration space C [ 0 , T ] .
Proof. 
Employing Picard’s technique, one can construct the solution of Equation (4) as a series of functions { u n ( ξ ) } 0 such that
μ ( ξ ) u l ( ξ ) = H ( ξ ) + λ 0 ξ k 1 ( ξ , s ) u l 1 ( s ) d s + λ 0 ξ k 2 ( ξ , s ) Γ [ s , u l 1 ( s ) , u l 1 ( s ) ] d s .
Let
ψ l ( ξ ) = ψ l ( ξ ) ψ l 1 ( ξ ) , and ψ 0 ( ξ ) = H ( ξ ) ,
with
u n ( ξ ) = i = 0 n ψ i ( ξ ) , n = 1 , 2 , 3 ,
denoting that the functions ψ l ( ξ ) ,   l = 0 , 1 , 2 , are continuous.
We will now demonstrate that the sequence { u n ( ξ ) } is uniformly convergent. By employing Equation (6) to Equation (7) and using the norm properties, we obtain
ψ l ( ξ ) | λ | | μ ( ξ ) | 0 ξ k 1 ( ξ , s ) ψ l 1 ( s ) d s + | λ | | μ ( ξ ) | 0 ξ k 2 ( ξ , s ) ( Γ [ s , u l ( s ) , u l ( s ) ] Γ [ s , u l 1 ( s ) , u l 1 ( s ) ] ) d s .
Conditions (1), (2) and (3.i) are applied at l = 1 to obtain
ψ 1 ( ξ ) | λ | | μ ( ξ ) | 0 ξ | k 1 ( ξ , s ) | | ψ 0 ( s ) | d s + | λ | | μ ( ξ ) | 0 ξ | k 2 ( ξ , s ) | | Γ [ s , u 1 ( s ) , u 1 ( s ) ] Γ [ s , u 0 ( s ) , u 0 ( s ) ] | d s | λ | J 3 J 4 J 1 T + | λ | J 3 J 2 J 5 J 4 T ( J 1 + J 2 J 5 ) T | λ | J 3 J 4 .
Subsequently, the mathematical induction can be used to obtain
ψ l ( ξ ) η 1 l J 4 , η 1 = | λ | ( J 1 + J 2 J 5 ) T J 3 .
Observe that the series j = 0 η 1 j J 4 must be convergent in order for the sequence u n ( ξ ) to be uniformly convergent. As a result, we have η 1 < 1 because of | λ | < J 3 ( J 1 + J 2 J 5 ) T , and this indicates that the series j = 0 η 1 j J 4 is convergent. Thus, we obtain
u ( ξ ) = i = 0 ψ i ( ξ ) ,
which denotes the solution of Equation (4). □
It is assumed that an additional continuous solution u ˜ ( t ) exists for Equation (4) in order to investigate the uniqueness of the solution to Equation (4). Note that under the given conditions, we acquire
| μ ( ξ ) | u ( ξ ) u ˜ ( ξ ) λ 0 ξ k 1 ( ξ , ν ) ( u ( ν ) u ˜ ( ν ) ) d ν   + λ 0 ξ k 2 ( ξ , ν ) Γ ( ν , u ( ν ) , u ( ν ) ) Γ ( ν , u ˜ ( ν ) , u ˜ ( ν ) ) d ν | λ | J 1 T u u ˜ + | λ | J 2 J 5 T u u ˜ | λ | ( J 1 + J 2 J 5 ) T u u ˜ .
Inequality (13) yields
u ( ξ ) u ˜ ( ξ ) η 1 u ( ξ ) u ˜ ( ξ ) , η 1 = | λ | ( J 1 + J 2 J 5 ) T J 3 .
In the event when u ( ξ ) u ˜ ( ξ ) 0 , the result of (14) is η 1 1 , which is incompatible. As a result, u ( ξ ) u ˜ ( ξ ) = 0 , and it is inferred that u ( ξ ) = u ˜ ( ξ ) , indicating that the solution must be unique.

3. Homotopy Analysis Method for NM-IDEs

Firstly, we will present the fundamental concept of the HAM [6,27] in order to solve the operator equations.
N ( u ( ξ ) ) = 0 , ξ [ 0 , T ] ,
where u ( ξ ) is an unknown function, and N indicates the nonlinear operator.
The homotopy operator H is defined first, as follows:
H ( Φ , p ) = ( 1 p ) ( Φ ( ξ ; p ) u 0 ( ξ ) ) p h N ( Φ ( ξ ; p ) ) ,
where the embedding parameter is p [ 0 , 1 ] , the convergence control parameter is h 0 , and the initial approximated solution to Problem (15) is described by u 0 ( ξ ) .
Taking into account H ( Φ , p ) = 0 , the “zero-order deformation equation” can be obtained as follows:
( 1 p ) Φ ( ξ ; p ) u 0 ( ξ ) = p h N ( Φ ( ξ ; p ) ) .
In the case of p = 0 , the expression Φ ( ξ ; 0 ) u 0 ( ξ ) = 0 indicates that Φ ( t ; 0 ) = u 0 ( ξ ) . Conversely, in the case of p = 1 , the expression N ( Φ ( ξ ; 1 ) ) = 0 denotes that Φ ( ξ ; 1 ) = u ( ξ ) , where u ( ξ ) represents the solution sought in (15). Thus, as the issue changes from being trivial to being original (and when the solution changes from u 0 ( ξ ) u ( ξ ) ), the variation of parameter p : 0 1 matches with these changes.
When Φ ( x ; p ) is expanded by the Maclaurin series with regard to parameter p, one can obtain
Φ ( ξ ; p ) = Φ ( ξ ; 0 ) + j = 1 1 j ! j Φ ( ξ ; p ) p j p = 0 p j .
by denominating
v j ( ξ ) = 1 j ! j Φ ( ξ ; p ) p j p = 0 , j = 1 , 2 , 3 , ,
Equation (18) can be transformed into
Φ ( ξ ; p ) = v 0 ( ξ ) + j = 1 v j ( ξ ) p j .
Given p = 1 , the convergence of the aforementioned series yields
u ( ξ ) = j = 0 v j ( ξ ) .
We now differentiate both sides of Equation (17) j times with regard to p in order to find v j ( ξ ) . We then divide the obtained result by j ! and substitute p = 0 . The so-called j t h -order deformation equation ( j > 0 ) is obtained as follows:
v j ( ξ ) χ j v j 1 ( ξ ) = h R j v ¯ j 1 , ξ ,
where v ¯ j 1 = v 0 ( ξ ) , v 1 ( ξ ) , , v j 1 ( ξ ) ,
χ j = 0 j 1 1 j > 1
and
R j v ¯ j 1 , ξ = 1 ( j 1 ) ! j 1 p j 1 N i = 0 v i ( ξ ) p i p = 0 .
We can accept the partial sum of this series since we have disabled the ability to find the sum of the series in (21),
u ( ξ ) u n ( ξ ) = j = 0 n v j ( ξ ) ,
as the approximately estimated solution to the given problem.
Second, operator N for NM-IDE (4) can be defined as
N ( v ( ξ ) ) = μ ( ξ ) v ( ξ ) H ( ξ ) λ 0 ξ k 1 ( ξ , s ) v ( s ) d s λ 0 ξ k 2 ( ξ , s ) Γ s , v ( s ) , v ( s ) d s .
With the aid of (23) and (24), and from Equations (22) and (26), we can obtain
v 1 ( ξ ) = h R 1 v ¯ 0 , ξ = h μ ( ξ ) v 0 ( ξ ) H ( ξ ) λ 0 ξ k 1 ( ξ , s ) v 0 ( s ) d s λ 0 ξ k 2 ( ξ , s ) Γ s , v 0 ( s ) , v 0 ( s ) d s .
Also, for j 2 , we have
v j ( ξ ) = ( 1 + h μ ( ξ ) ) v j 1 ( ξ ) λ h 0 ξ k 1 ( ξ , s ) v j 1 ( s ) d s λ h ( j 1 ) ! 0 ξ k 2 ( ξ , s ) j 1 p j 1 Γ s , i = 0 v i ( s ) p i , i = 0 v i ( s ) p i p = 0 d s .
We proceed now to prove the theorem, ensuring that the sum of determined series is the solution of the discussed equation.
Theorem 2. 
Assume that the Lipschitz condition ( 3 . i ) is satisfied by the nonlinear operator Γ. The exact solution of NM-IDE (4) will be u ( x ) when the series j = 0 + v j ( ξ ) converges to function u ( x ) , where v j ( ξ ) is provided by Equation (22) and satisfies Definitions (23) and (24).
Proof. 
Firstly, we define
H j ( ξ ) = 1 ( j ) ! j p j Γ ξ , i = 0 v i ( ξ ) p i , i = 0 v i ( ξ ) p i p = 0 .
The convergence of j = 0 + u j ( ξ ) yields
lim j v j ( ξ ) = 0 .
From (23), we obtain
j = 1 n v j ( ξ ) χ j v j 1 ( ξ ) = u 1 ( ξ ) + v 2 ( ξ ) v 1 ( ξ ) + v 3 ( ξ ) v 2 ( ξ ) + + v n ( ξ ) v n 1 ( ξ ) = v n ( ξ ) ,
which, together with Equation (30), yields
j = 1 v j ( ξ ) χ j v j 1 ( ξ ) = lim n v n ( ξ ) = 0 .
From Equation (32) and Equation (22), we obtain
h j = 1 R j v ¯ j 1 , ξ = j = 1 v j ( ξ ) χ j v j 1 ( ξ ) = 0 .
Since h 0 , Equation (32) gives
j = 1 R j v ¯ j 1 , ξ = 0 .
Equation (34) as well as Definitions (19) and (24) yield
0 = j = 1 + R j v j 1 , ξ = j = 1 + μ ( ξ ) v j 1 ( ξ ) 1 χ j H ( ξ ) λ 0 ξ k 1 ( ξ , s ) v j 1 ( s ) d s λ 0 ξ k 2 ( ξ , s ) j 1 N k = 0 k = + v k ( s ) p k ( j 1 ) ! p j 1 p = 0 d s
= j = 1 + μ ( ξ ) v j 1 ( ξ ) 1 χ j H ( ξ ) λ 0 ξ k 1 ( ξ , s ) v j 1 ( s ) d s λ 0 ξ k 2 ( ξ , s ) H j 1 ( s ) d s = j = 1 + μ ( ξ ) v j 1 ( ξ ) H ( ξ ) λ 0 ξ k 1 ( ξ , s ) j = 1 + v j 1 ( s ) d s λ 0 ξ k 2 ( ξ , s ) j = 1 + H j 1 ( ξ ) d s = μ ( ξ ) u ( ξ ) H ( ξ ) λ 0 ξ k 1 ( ξ , s ) u ( s ) d s λ 0 ξ k 2 ( ξ , s ) Γ ( s , u ( s ) , u ( s ) ) d s .
The series j = 0 + v j ( ξ ) converges to u ( ξ ) if the nonlinear operator Γ is a contraction. Consequently, the series j = 0 + H j ( ξ ) converges to Γ ( ξ , u ( ξ ) , u ( ξ ) ) [28]. Equation (35) is expressed from (34) as
μ ( ξ ) u ( ξ ) = H ( ξ ) + λ 0 ξ k 1 ( ξ , ν ) u ( ν ) d ν + λ 0 ξ k 2 ( ξ , ν ) Γ [ ν , u ( ν ) , u ( ν ) ] d ν .
As a result, u ( ξ ) is the exact solution of NM-IDE (4), and the proof is completed. □
We now offer the necessary condition for the series under consideration to converge.
Theorem 3. 
Let h be appropriately chosen so that 0 < ζ < 1 occurs and v l + 1 ζ v l , l l 0 , for some l 0 N . In this case, as n + , u n ξ , h in (25) converges.
Proof. 
The sequence V n can be defined as
V 0 = v 0 V 1 = v 0 + v 1 V n = v 0 + v 1 + + v n
Currently, we demonstrate that in the space C [ 0 , T ] , V n is a Cauchy sequence. Consider
V m + 1 V m v m + 1 ζ v m ζ 2 v m 1 ζ m l 0 + 1 v l 0 .
For each l , m N , m l > l 0 , we have
V m V l = V m V m 1 + V m 1 V m 2 + + V l + 1 V l ( V m V m 1 + V m 1 V m 2 + + V l + 1 V l ζ m l 0 v k 0 + ζ m l 0 1 v l 0 + + ζ m l 0 + 1 v l 0 = 1 ζ m l 1 ξ ζ l l 0 + 1 v l 0 ,
and since 0 < ζ < 1 , we obtain
lim m , l V m V l = 0 .
Given that V n is a Cauchy sequence in the considered space C [ 0 , T ] , as n , V n = u n ( ξ , h ) converges. This completes the proof. □
The next theorem concerns the error estimation of the approximate solution u n ( ξ ) .
Theorem 4. 
If assumptions of Theorem 3 are satisfied and n N and n l 0 , then we obtain the error estimation of the approximate solution, which is defined by
u ( ξ ) u n ( ξ ) ζ n + 1 l 0 1 ζ v l 0 .
Proof. 
Consider n N and n l 0 . Thus, one can obtain
u ( ξ ) u n ( ξ ) = sup ξ [ 0 , T ] u ( ξ ) j = 0 n v j ( x , ξ ) sup ξ [ 0 , T ] j = n + 1 v j ( ξ ) j = n + 1 sup ξ [ 0 , T ] v j ( x , ξ ) j = n + 1 ζ j k 0 v l 0 = ζ n + 1 l 0 1 ζ v l 0 .
In this particular case, at l 0 = 0 , we obtain
u ( ξ ) u n ( ξ ) ζ n + 1 1 ζ v 0 .

4. Numerical Results and Discussion

Example 1. 
Consider the following singular initial value problem [7]:
u ( ξ ) + 2 ξ u ( ξ ) + u 5 ( ξ ) = 0 , ξ > 0 u ( 0 ) = 1 , u ( 0 ) = 0 ,
where the exact solution u ( ξ ) = 1 ξ 2 3 + 1 . By integrating Equation (44) two times and using the initial conditions, Equation (44) can be converted to the third-kind NV-IE as follows:
ξ u ( ξ ) = ξ 0 ξ ( ξ ν ) ν u 5 ( ν ) d ν ,
In this example, comparing the approximate solution, which utilizes the HAM at n = 5 and h = 0.01 with the exact solution, the error behavior is shown in Figure 1. It illustrates that these parameters provide a good approximation for the solution and that h = 0.01 is an optimal choice for convergence. Further, Figure 2 displays the behavior of maximum error e m a x ( h ) = max i | u ( ξ i , h ) u n ( ξ i , h ) | ξ i [ 0 , 10 ] , which indicates that the best valid region of h is [ 1.4 , 0.9 ] { 0 } .
Shiralashetti et al. [7] employed the Haar wavelet collocation method (HWCM) to derive a numerical solution for Equation (44). In contrast, our study utilized the HAM to solve Equation (45), demonstrating that our results achieve significantly higher accuracy compared to those presented in [7]. This enhanced precision is thoroughly examined and validated in Table 1, which provides a detailed comparison of the numerical outcomes. The superior accuracy of the HAM underscores its effectiveness and reliability in addressing the specific challenges posed by the equation, highlighting its advantages over the HWCM approach in this context.
Example 2. 
Consider the following nonlinear Lane Emden equation [10]:
u ( ξ ) + 2 ξ u ( ξ ) 6 u ( ξ ) = 4 u ( ξ ) ln ( u ( ξ ) ) , ξ > 0 u ( 0 ) = 1 , u ( 0 ) = 0 ,
where the exact solution u ( ξ ) = e ξ 2 . By integrating Equation (46) two times and using the initial conditions, Equation (46) can be converted to the third-kind NM-IDE as follows:
ξ u ( ξ ) = ξ + 6 0 ξ ( ξ ν ) ν u ( ν ) d ν + 4 0 ξ ( ξ ν ) ν u ( ν ) ln ( u ( ν ) ) d ν ,
According to Figure 3, which uses the HAM to show the error behavior (in this case, at n = 5 and h = 0.05 ), these parameters provide a good approximation for the solution, and h = 0.05 is the best choice for convergence. Moreover, Figure 4 displays the behavior of maximum error e m a x ( h ) ξ i [ 0 , 5 ] and shows that the best valid region of h is [ 0.4 , 0 ) .
In [10], Geng et al. explored the numerical solution of Equation (46) by integrating the Replicating kernel Hilbert space approach (RKHSA) with the homotopy perturbation method (HPM). Building on this work, we applied the HAM to Equation (47) and achieved results far more accurate than those reported in [10]. This superior precision is clearly demonstrated in Table 2, which provides a comprehensive comparison of the numerical outcomes. The enhanced accuracy of our results underscores the effectiveness and robustness of the HAM in addressing the complexities of the equation, highlighting its advantages over the combined RKHSA and HPM approach used in previous studies.
Example 3. 
Consider the following Lienard equation [8]:
u ( ξ ) + u ( ξ ) u ( ξ ) + u ( ξ ) + u 2 ( ξ ) = f ( ξ ) , ξ > 0 u ( 0 ) = 1 , u ( 0 ) = 0 ,
where f ( ξ ) = cos 2 ξ sin ξ cos ξ , and the exact solution u ( ξ ) = cos ( ξ ) . By integrating Equation (48) two times and using the initial conditions, Equation (48) becomes
u ( ξ ) = H ( ξ ) 0 ξ ( ξ ν ) u ( ν ) d ν 0 ξ ( ξ ν + 1 2 ) u 2 ( ν ) d ν ,
The error behavior (in this case, employing the HAM at n = 3 and h = 0.02 ) is shown in Figure 5. These parameters provide a good approximation for the solution, and h = 0.02 is the optimal choice for convergence. Further, Figure 6 displays the behavior of maximum error e m a x ( h ) ξ i [ 0 , 4 ] , which indicates that the best valid region of h is [ 0.2 , 0 ) .
A particular Schauder basis that is naturally related to the differential problem was used by Gámez et al. [8] to approximate the solution of Equation (48). We used the HAM to estimate the solution of Equation (49) in our study, and we showed that our results are more accurate than those found in [8]. Table 3, which offers a thorough comparison of the numerical results, carefully verifies this improved precision. The higher accuracy of our findings demonstrates the efficacy and dependability of our methodology in handling the equation’s complexity and emphasizes its benefits over the Schauder basis method used in previous research.
Example 4. 
Consider the following Duffing equation [9]:
u ( ξ ) + u ( ξ ) + ξ ( 1 ξ ) u 3 ( ξ ) = f ( ξ ) , u ( 0 ) = 0 , u ( 0 ) = π , 0 ξ < 1 ,
where f ( ξ ) = ( 1 ξ ) ξ sin 3 ( π ξ ) π 2 sin ( π ξ ) + π cos ( π ξ ) , and the exact solution u ( ξ ) = sin ( π ξ ) . By integrating Equation (50) two times and using the initial conditions, Equation (50) can be converted to
u ( ξ ) = H ( ξ ) + 0 ξ u ( ν ) d ν + 1 2 0 ξ ( ξ ν ) ν ( 1 ν ) u 3 ( ν ) d ν ,
Using the HAM at n = 10 and h = 0.15 in this example results in the error behavior seen in Figure 7. The ideal value for convergence is h = 0.15 , and these parameters provide a decent approximation for the solution. Moreover, Figure 8 shows the behavior of maximum error e m a x ( h ) ξ i [ 0 , 10 ] , which indicates that the best valid region of h is [ 4.9 , 4.3 ] { 0 } .
In [9], Chen et al. developed an approximate solution for Equation (50) by enhancing the reproducing kernel method (RKM). In our study, we applied the HAM to Equation (51) and demonstrated that our results surpass the accuracy of those reported in [9]. This significant improvement in precision is clearly illustrated in Table 4, which provides a detailed comparative analysis of the numerical results. The enhanced accuracy achieved through the HAM underscores its superior capability in addressing the intricacies of the equation, highlighting its effectiveness over the improved RKM approach utilized in prior research.

5. Conclusions

In this paper, we considered a novel strategy that is the conversion of traditional IVPs into NM-IDEs of the third kind. In addition, we discussed the existence and uniqueness of the solution using Picard’s method. Moreover, we presented the HAM to obtain the approximate solution. To demonstrate the reliability and accuracy of the proposed method and to depict the error behavior, illustrative examples were provided. In conclusion, converting IVPs to NM-IDEs and using the HAM offers significant computational advantages.

Author Contributions

A.S.R.: Conceptualization, Investigation, Writing—original draft, Writing—review and editing, Software, Making major revisions, Formal analysis; S.S.A.: Formal analysis, Writing—original draft, Validation, Data curation, Writing—review and editing; A.M.A.: Writing—original draft, Making major revisions, Data curation, Formal analysis, Validation; G.A.M.: Methodology, Writing—review and editing, Making major revisions, Software, Data curation, Formal analysis. All authors have read and agreed to the published version of the manuscript..

Funding

This research was conducted under a project titled “Researchers Supporting Project”, funded by King Saud University, Riyadh, Saudi Arabia, under grant number (RSPD2025R533).

Data Availability Statement

Not applicable.

Acknowledgments

The authors express their appreciation to King Saud University for funding this research study through Researchers Supporting Project number (RSPD2025R533), King Saud University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Brenan, K.E.; Campbell, S.L.; Petzold, L.R. Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations; SIAM: Philadelphia, PA, USA, 1995. [Google Scholar]
  2. Wanner, G.; Hairer, E. Solving Ordinary Differential Equations II; Springer: Berlin/Heidelberg, Germany, 1996; Volume 375. [Google Scholar]
  3. Mickens, R.E. Truly Nonlinear Oscillations: Harmonic Balance, Parameter Expansions, Iteration, and Averaging Methods; World Scientific: Singapore, 2010. [Google Scholar]
  4. Biazar, J.; Ghanbari, B. HAM solution of some initial value problems arising in heat radiation equations. J. King Saud Univ. Sci. 2012, 24, 161–165. [Google Scholar]
  5. Mosa, G.A.; Abdou, M.A.; Rahby, A.S. Numerical solutions for nonlinear Volterra-Fredholm integral equations of the second kind with a phase lag. AIMS Math. 2021, 6, 8525–8543. [Google Scholar]
  6. Rahby, A.S.; Abdou, M.A.; Mosa, G.A. On the solutions of the second kind nonlinear Volterra-Fredholm integral equations via homotopy analysis method. Int. J. Anal. Appl. 2022, 20, 35. [Google Scholar]
  7. Shiralashetti, S.C.; Deshi, A.B.; Desai, P.B.M. Haar wavelet collocation method for the numerical solution of singular initial value problems. Ain Shams Eng. J. 2016, 7, 663–670. [Google Scholar]
  8. Gámez, D.; Guillem, A.I.G.; Galán, M.R. Nonlinear initial-value problems and Schauder bases. Nonlinear Anal. Theory Methods Appl. 2005, 63, 97–105. [Google Scholar]
  9. Chen, Z.; Jiang, W.; Du, H. A new reproducing kernel method for Duffing equations. Int. J. Comput. Math. 2021, 98, 2341–2354. [Google Scholar]
  10. Geng, F.; Cui, M.; Zhang, B. Method for solving nonlinear initial value problems by combining homotopy perturbation and reproducing kernel Hilbert space methods. Nonlinear Anal. Real World Appl. 2010, 11, 637–644. [Google Scholar]
  11. Abdulqader, A.J.; Abdulmaged, R.B.; Abdali, B.M. Numerical solution for solving nonlinear Volterra-Fredholm system by using iterative techniques. J. Interdiscip. Math. 2024, 27, 991–1000. [Google Scholar]
  12. Mahdy, A.M.S.; Abdou, M.A.; Mohamed, D.S. Numerical solution, convergence and stability of error to solve quadratic mixed integral equation. J. Appl. Math. Comput. 2024, 70, 5887–5916. [Google Scholar] [CrossRef]
  13. Alalyani, A.; Abdou, M.A.; Basseem, M. The orthogonal polynomials method using Gegenbauer polynomials to solve mixed integral equations with a Carleman kernel. AIMS Math. 2024, 9, 19240–19260. [Google Scholar]
  14. Achar, S.D. Symmetric multistep Obrechkoff methods with zero phase-lag for periodic initial value problems of second order differential equations. Appl. Math. Comput. 2011, 218, 2237–2248. [Google Scholar]
  15. Wang, B.; Liu, K.; Wu, X. A Filon-type asymptotic approach to solving highly oscillatory second-order initial value problems. J. Comput. Phys. 2013, 243, 210–223. [Google Scholar] [CrossRef]
  16. Rahmanzadeh, M.; Cai, L.; White, R.E. A new method for solving initial value problems. Comput. Chem. Eng. 2013, 58, 33–39. [Google Scholar] [CrossRef]
  17. Baccouch, M. A posteriori error estimates and adaptivity for the discontinuous Galerkin solutions of nonlinear second-order initial-value problems. Appl. Numer. Math. 2017, 121, 18–37. [Google Scholar] [CrossRef]
  18. Baccouch, M. Superconvergence of the discontinuous Galerkin method for nonlinear second-order initial-value problems for ordinary differential equations. Appl. Numer. Math. 2017, 115, 160–179. [Google Scholar] [CrossRef]
  19. Ramos, H.; Mehta, S.; Vigo-Aguiar, J. A unified approach for the development of k-step block Falkner-type methods for solving general second-order initial-value problems in ODEs. J. Comput. Appl. Math. 2017, 318, 550–564. [Google Scholar] [CrossRef]
  20. Khalsaraei, M.M.; Shokri, A. An explicit six-step singularly P-stable Obrechkoff method for the numerical solution of second-order oscillatory initial value problems. Numer. Algorithms 2020, 84, 871–886. [Google Scholar] [CrossRef]
  21. Yüzbaşı, S. A collocation method based on Bernstein polynomials to solve nonlinear Fredholm–Volterra integro-differential equations. Appl. Math. Comput. 2016, 273, 142–154. [Google Scholar] [CrossRef]
  22. Alalyani, A.; Abdou, M.A.; Basseem, M. On a Solution of a Third Kind Mixed Integro-Differential Equation with Singular Kernel Using Orthogonal Polynomial Method. J. Appl. Math. 2023, 2023, 5163398. [Google Scholar] [CrossRef]
  23. Hemeda, A.A. A friendly iterative technique for solving nonlinear integro-differential and systems of nonlinear integro-differential equations. Int. J. Comput. Methods 2018, 15, 1850016. [Google Scholar] [CrossRef]
  24. Hamed, Y.S.; Amer, Y.A. Nonlinear saturation controller for vibration supersession of a nonlinear composite beam. J. Mech. Sci. Technol. 2014, 28, 2987–3002. [Google Scholar] [CrossRef]
  25. Warminski, J.; Bochenski, M.; Jarzyna, W.; Filipek, P.; Augustyniak, M. Active suppression of nonlinear composite beam vibrations by selected control algorithms. Commun. Nonlinear Sci. Numer. Simul. 2011, 16, 2237–2248. [Google Scholar]
  26. Warminski, J.; Cartmell, M.P.; Bochenski, M.; Ivanov, I. Analytical and experimental investigations of an autoparametric beam structure. J. Sound Vib. 2008, 315, 486–508. [Google Scholar] [CrossRef]
  27. Liao, S. Homotopy analysis method: A new analytic method for nonlinear problems. Appl. Math. Mech. 1998, 19, 957–962. [Google Scholar]
  28. Cherruault, Y. Convergence of Adomian’s method. Kybernetes 1989, 18, 31–38. [Google Scholar]
Figure 1. The behavior of the error at n = 5 ,   h = 0.01 employing HAM.
Figure 1. The behavior of the error at n = 5 ,   h = 0.01 employing HAM.
Axioms 14 00282 g001
Figure 2. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Figure 2. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Axioms 14 00282 g002
Figure 3. The error behavior at n = 5 ,   h = 0.05 using HAM.
Figure 3. The error behavior at n = 5 ,   h = 0.05 using HAM.
Axioms 14 00282 g003
Figure 4. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Figure 4. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Axioms 14 00282 g004
Figure 5. The error behavior employing the HAM at n = 3 , h = 0.02 .
Figure 5. The error behavior employing the HAM at n = 3 , h = 0.02 .
Axioms 14 00282 g005
Figure 6. The maximum error e m a x ( h ) behavior at n = 3 with corresponding h using HAM.
Figure 6. The maximum error e m a x ( h ) behavior at n = 3 with corresponding h using HAM.
Axioms 14 00282 g006
Figure 7. The error behavior at n = 10 and h = 0.15 when utilizing HAM.
Figure 7. The error behavior at n = 10 and h = 0.15 when utilizing HAM.
Axioms 14 00282 g007
Figure 8. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Figure 8. The maximum error e m a x ( h ) behavior at n = 5 with corresponding h using HAM.
Axioms 14 00282 g008
Table 1. Comparison of the maximum error e m a x ( ξ ) for the HAM and HWCM [7].
Table 1. Comparison of the maximum error e m a x ( ξ ) for the HAM and HWCM [7].
HAMHWCM
8 × 10 10 24 × 10 6
Table 2. Comparison of the maximum error e m a x ( ξ ) for the HAM and RKHSA with HPM [10].
Table 2. Comparison of the maximum error e m a x ( ξ ) for the HAM and RKHSA with HPM [10].
HAMRKHSA with HPM
1.2 × 10 13 2.16 × 10 5
Table 3. Comparison of the maximum error e m a x ( ξ ) for the HAM and SB [8].
Table 3. Comparison of the maximum error e m a x ( ξ ) for the HAM and SB [8].
HAMSB
9 × 10 6 5.89 × 10 5
Table 4. Comparison of the maximum error e m a x ( ξ ) for the HAM and RKM [9].
Table 4. Comparison of the maximum error e m a x ( ξ ) for the HAM and RKM [9].
HAMRKM
6 × 10 10 1.4 × 10 9
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

Rahby, A.S.; Askar, S.S.; Alshamrani, A.M.; Mosa, G.A. A Comprehensive Study of Nonlinear Mixed Integro-Differential Equations of the Third Kind for Initial Value Problems: Existence, Uniqueness and Numerical Solutions. Axioms 2025, 14, 282. https://doi.org/10.3390/axioms14040282

AMA Style

Rahby AS, Askar SS, Alshamrani AM, Mosa GA. A Comprehensive Study of Nonlinear Mixed Integro-Differential Equations of the Third Kind for Initial Value Problems: Existence, Uniqueness and Numerical Solutions. Axioms. 2025; 14(4):282. https://doi.org/10.3390/axioms14040282

Chicago/Turabian Style

Rahby, Ahmed S., Sameh S. Askar, Ahmad M. Alshamrani, and Gamal A. Mosa. 2025. "A Comprehensive Study of Nonlinear Mixed Integro-Differential Equations of the Third Kind for Initial Value Problems: Existence, Uniqueness and Numerical Solutions" Axioms 14, no. 4: 282. https://doi.org/10.3390/axioms14040282

APA Style

Rahby, A. S., Askar, S. S., Alshamrani, A. M., & Mosa, G. A. (2025). A Comprehensive Study of Nonlinear Mixed Integro-Differential Equations of the Third Kind for Initial Value Problems: Existence, Uniqueness and Numerical Solutions. Axioms, 14(4), 282. https://doi.org/10.3390/axioms14040282

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