<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JAMP</journal-id><journal-title-group><journal-title>Journal of Applied Mathematics and Physics</journal-title></journal-title-group><issn pub-type="epub">2327-4352</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jamp.2023.111005</article-id><article-id pub-id-type="publisher-id">JAMP-122461</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Application of HAM for Nonlinear Integro-Differential Equations of Order Two
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Zainidin</surname><given-names>Eshkuvatov</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Davron</surname><given-names>Khayrullaev</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Muzaffar</surname><given-names>Nurillaev</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Shalela</surname><given-names>Mohd Mahali</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Anvar</surname><given-names>Narzullaev</given-names></name><xref ref-type="aff" rid="aff4"><sup>4</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Faculty of Applied Mathematics and Intellectual Technologies, National University of Uzbekistan, Tashkent, Uzbekistan</addr-line></aff><aff id="aff3"><addr-line>Faculty of Ocean Engineering Technology and Informatics, University Malaysia Terengganu (UMT), Terengganu, Malaysia</addr-line></aff><aff id="aff4"><addr-line>Faculty of Science and Technology, University Sains Islam Malaysia (USIM), Bandar Baru Nilai, Malaysia</addr-line></aff><aff id="aff2"><addr-line>Faculty of Physics and Mathematics, Tashkent State Pedagogical University (TSPU), Tashkent, Uzbekistan</addr-line></aff><pub-date pub-type="epub"><day>06</day><month>01</month><year>2023</year></pub-date><volume>11</volume><issue>01</issue><fpage>55</fpage><lpage>68</lpage><history><date date-type="received"><day>11,</day>	<month>November</month>	<year>2022</year></date><date date-type="rev-recd"><day>14,</day>	<month>January</month>	<year>2023</year>	</date><date date-type="accepted"><day>17,</day>	<month>January</month>	<year>2023</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this work, we consider the second order nonlinear integro-differential Equation (IDEs) of the Volterra-Fredholm type. One of the popular methods for solving Volterra or Fredholm type IDEs is the method of quadrature while the problem of consideration is a linear problem. If IDEs are nonlinear or integral kernel is complicated, then quadrature rule is not most suitable; therefore, other types of methods are needed to develop. One of the suitable and effective method is homotopy analysis method (HAM) developed by Liao in 1992. To apply HAM, we firstly reduced the IDEs into nonlinear integral Equation (IEs) of Volterra-Fredholm type; then the standard HAM was applied. Gauss-Legendre quadrature formula was used for kernel integrations. Obtained system of algebraic equations was solved numerically. Moreover, numerical examples demonstrate the high accuracy of the proposed method. Comparisons with other methods are also provided. The results show that the proposed method is simple, effective and dominated other methods.
 
</p></abstract><kwd-group><kwd>Integral-Differential Equations</kwd><kwd> Homotopy Analyses Method</kwd><kwd> Iterative System</kwd><kwd> Algebraic Equations</kwd><kwd> Gauss-Legendre Quadrature Formula</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>In the recent literature, there is a growing interest to solve IDEs, because many problems in mathematical physics, theory of elasticity, visco-dynamics fluid and mixed problems of mechanics of continuous media reduce to the integro-differential Equation (IDEs) (Volterra or Fredholm type) of the first or second kind. Many methods are elaborated as a numerical tool to solve IDEs with initial and boundary conditions, for instance, Adomian decomposition method (ADM) (proposed by Adomian [<xref ref-type="bibr" rid="scirp.122461-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.122461-ref2">2</xref>] ). It has been shown that ADM yields a rapid convergence of the solution series to linear and nonlinear deterministic and stochastic equations. Then, this has been extended by Wazwaz [<xref ref-type="bibr" rid="scirp.122461-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.122461-ref4">4</xref>] to Volterra integral equation and to boundary value problems for higher-order integro-differential equations. There are many other methods developed by different researchers for linear and nonlinear IDEs with initial, boundary or mixed conditions, for instance homotopy analysis method (HAM) developed by Liao [<xref ref-type="bibr" rid="scirp.122461-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.122461-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.122461-ref7">7</xref>] , modified HAM [<xref ref-type="bibr" rid="scirp.122461-ref8">8</xref>] , q-HAM [<xref ref-type="bibr" rid="scirp.122461-ref9">9</xref>] , new development of HAM [<xref ref-type="bibr" rid="scirp.122461-ref10">10</xref>] , homotopy perturbation method (HPM) developed by Ji-Huan He [<xref ref-type="bibr" rid="scirp.122461-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.122461-ref12">12</xref>] , HPM for nonlinear differential-difference equations [<xref ref-type="bibr" rid="scirp.122461-ref13">13</xref>] , HPM for nth-Order Integro-Differential Equations [<xref ref-type="bibr" rid="scirp.122461-ref14">14</xref>] , collocation method [<xref ref-type="bibr" rid="scirp.122461-ref15">15</xref>] , new boundary element method [<xref ref-type="bibr" rid="scirp.122461-ref16">16</xref>] , Linear Programming Method [<xref ref-type="bibr" rid="scirp.122461-ref17">17</xref>] , Laplace Decomposition Algorithm [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] , polynomial approximations [<xref ref-type="bibr" rid="scirp.122461-ref19">19</xref>] , Wavelet Galerkin method [<xref ref-type="bibr" rid="scirp.122461-ref20">20</xref>] , and so on.</p><p>In this paper, we consider nonlinear Fredholm-Volterra integro-differential Equations (FVIDEs) of the order two in the form:</p><p>∑ k = 0 2 c k ( t ) u ( k ) ( t ) = g ( t ) z ( u ( t ) ) + μ 1 ∫ a t K 1 ( t , s ) G 1 [ u ( s ) , u ′ ( s ) ] d s                                                                           + μ 2 ∫ a b K 2 ( t , s ) G 2 [ u ( s ) , u ′ ( s ) ] d s (1)</p><p>with the initial conditions</p><p>u ( a ) = b 0 ,     u ′ ( a ) = b 1 , (2)</p><p>where u ( k ) ( t ) is the k<sup>th</sup> derivative of the unknown function u ( x ) that needs to be determined, K 1 ( t , s ) and K 2 ( t , s ) are the kernels of the equation, c k ( t ) and g ( t ) are known analytic functions, G 1 and G 2 are nonlinear functions of u , u ′ , and μ 1 ,   μ 2 , b 0 , b 1 are real constants.</p><p>Primarily, to solve nonlinear IDEs (1) and (2), we have applied a integral transformation to reduce it to nonlinear integral Equations (NIEs) of Volterra-Fredholm type; then, we applied the standard HAM together with Gauss-Legendre quadrature Formulas (GLQFs). Once solving nonlinear IEs, the inverse transformation is used to restore the original solutions of the problem (1) and (2). The results obtained are compared with other methods at the same number of iterations with a different number of node points.</p></sec><sec id="s2"><title>2. Gauss-Legendre Quadrature Formula</title><p>In Eshquvatov et al. [<xref ref-type="bibr" rid="scirp.122461-ref19">19</xref>] , for the kernels of Fredgholm and Volterra integrals on the interval [ a , b ] the Gauss-Legendre QF are developed</p><p>Q 1 ( s ) = ∫ a b K 1 ( s , t ) x ( t ) d t = b − a 2 ∑ j = 1 n + 1 W 1 , j ( s ) x ( t 1 , j ) + R n + 1 , 1 ( s ) , (3)</p><p>Q 2 ( s ) = ∫ a s K 2 ( s , t ) x ( t ) d t = s − a 2 ∑ j = 1 m + 1 W 2 , j ( s ) x ( s 2 , j ) + R n + 1 , 2 ( t ) , (4)</p><p>where</p><p>W 1 , j ( s ) = K 1 ( s , t 1 , j ) w j ,     t 1 , j = b − a 2 r j + b + a 2 ,     j = { 1 , ⋯ , n + 1 }</p><p>W 2 , j ( s ) = K 2 ( s , t 2 , j ) w j ,       t 2 , j = b − s m 2 r j + b + s m 2 ,       n ≥ m ≥ 2 ,</p><p>with</p><p>w j = 2 ( 1 − r j 2 ) [ P ′ n ( r j ) ] 2 ,     j = 1 , 2 , ⋯ , n + 1 ,             ∑ k = 1 n + 1 w k = 2 , (5)</p><p>with r j are the roots of the Legendre polynomial P n + 1 ( r ) , i.e.</p><p>P n + 1 ( r j ) = 0 , j = 1 , 2 , ⋯ , n + 1 ,       r j ∈ [ − 1 , 1 ] (6)</p><p>Application of Gauss-Legendre QF for the nonlinear integral is as follows</p><p>∫ a s K 1 ( s , τ ) c 2 ( s ) G 1 [ u ( τ ) , u ′ ( τ ) ] d τ = b − s 2 ∑ k = 1 m + 1 W 1 , k ( s ) G 1 [ u ( τ k ) , u ′ ( τ k ) ] + R n + 1 , 1 ( s ) , ∫ a b K 2 ( s , τ ) c 2 ( s ) G 2 [ u ( τ ) , u ′ ( τ ) ] d τ = b − a 2 ∑ k = 1 n + 1 W 2 , k ( s ) G 2 [ u ( τ k ) , u ′ ( τ k ) ] + R n + 1 , 2 ( s ) , (7)</p><p>where</p><p>s m = a + m h ,     h = b − a n + 1 ,</p><p>and</p><p>W k , 1 ( t ) = K 1 ( s , τ k , 1 ) c 2 ( s ) w k ,         τ k , 1 = b − s m 2 r k + b + s m 2 ,     n ≥ m ≥ 2 , W k , 2 ( t ) = K 2 ( s , τ k , 2 ) c 2 ( s ) w k ,         τ k , 2 = b − a 2 r k + b + a 2 , (8)</p><p>here w k and r k are defined by (5) and (6) respectively.</p><p>Quadrature Formulas (7) and (8) are used in the evaluation of kernel integrals when integrals in (9) and (11) have no antiderivative functions.</p></sec><sec id="s3"><title>3. Homotopy Analysis Method (HAM)</title><p>Let us rewrite Eq. (1) and (2) in the form</p><p>L u + ∑ k = 0 1 c k ( t ) c 2 ( t ) u ( k ) ( t ) = g ( t ) c 2 ( t ) z ( u ( t ) ) + μ 1 ∫ a t K 1 ( t , s ) c 2 ( t ) G 1 [ u , u ′ ] d s + μ 2 ∫ a b K 2 ( t , s ) c 2 ( t ) G 2 [ u , u ′ ] d s , (9)</p><p>where L u = d 2 d t 2 u ( t ) is the second order differential operator.</p><p>Acing inverse operator L − 1 ( &#183; ) = ∫ a t ∫ a t 1 ( &#183; ) d τ d t 1 = ∫ a t ( t − s ) ( &#183; ) d s on both sides of Eq. (9) and taking into account initial conditions (2), we obtain</p><p>u ( t ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) u ( k ) ( s ) d s − ∫ a t ( t − s ) g * ( s ) z ( u ( s ) ) d s   + μ 1 ∫ a t ( t − s ) G 1 * [ u ( s ) , u ′ ( s ) ] d s + μ 2 ∫ a t ( t − s ) G 2 * [ u ( s ) , u ′ ( s ) ] d s = b 0 + b 1 ( t − a ) (10)</p><p>where c k * ( t ) = c k ( t ) c 2 ( t ) , k = { 0 , 1 } , g * ( t ) = g ( t ) c 2 ( t ) , and</p><p>G 1 * [ u ( s ) , u ′ ( s ) ] = ∫ a s K 1 ( s , τ ) c 2 ( s ) G 1 [ u ( τ ) , u ′ ( τ ) ] d τ , G 2 * [ u ( s ) , u ′ ( s ) ] = ∫ a b K 2 ( s , τ ) c 2 ( s ) G 2 [ u ( τ ) , u ′ ( τ ) ] d τ . (11)</p><p>Writing Eq. (10) in the form,</p><p>N [ ϕ ( t , q ) ] = P ( t ) , (12)</p><p>where P ( t ) = b 0 + b 1 ( t − a ) and</p><p>N [ ϕ ( t , q ) ] = ϕ ( t , q ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) ϕ ( k ) ( s , q ) d s     − ∫ a t ( t − s ) g * ( s ) z ( ϕ ( s , q ) ) d s     + μ 1 ∫ a t ( t − s ) G 1 * [ ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ] d s     + μ 2 ∫ a t ( t − s ) G 2 * [ ϕ ( s , q ) , ∂ ∂ s ( s , q ) ] d s (13)</p><p>We apply HAM. To do this end search solution of (14) in the series form</p><p>ϕ ( t , q ) = ∑ m = 0 ∞ u m ( t ) q m = u 0 ( t ) + ∑ m = 1 ∞ u m ( t ) q m (14)</p><p>For the sake of clarity, we will first present a brief description of the standard HAM proposed by Liao ( [<xref ref-type="bibr" rid="scirp.122461-ref5">5</xref>] , 1992). He constructed the so-called zeroth-order deformation equation</p><p>( 1 − q ) L [ ϕ ( t , q ) − u 0 ( t ) ] = q ℏ H ( t ) { N [ ϕ ( t , q ) ] − P ( t ) } (15)</p><p>Since h ≠ 0 , H ( t ) ≠ 0 , ∀ t ∈ [ a , b ] then q = 0 and q = 1, leads</p><p>ϕ ( t , 0 ) = u 0 ( t ) ,         N [ ϕ ( t , 1 ) ] = P ( t ) ,</p><p>It is known that m-th order deformation equation is</p><p>L [ u m ( t ) − χ m u m − 1 ( t ) ] = ℏ R m ( u &#175; m − 1 ) , (16)</p><p>where χ m = { 0 ,       m ≤ 1 1 ,       m &gt; 1 and</p><p>R m ( u &#175; m − 1 ) = 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ N ( ϕ ( t , q ) ) − P ( t ) ] | q = 0 (17)</p><p>On the basis of Equations (18) and (19), we find sequence of solutions u 1 ( t ) , u 2 ( t ) , u 3 ( t ) , ⋯ , u n ( t ) , ⋯ and substitute it into (16) at q = 1 we obtain approximate solution of the form</p><p>u ( t ) = ϕ ( t , 1 ) = ∑ m = 0 n u m ( t ) = u 0 ( t ) + ∑ m = 1 n u m ( t ) . (18)</p><p>To find iterative solution u m ( t ) of the problem (14) and (15), let us choose initial guess u 0 ( t ) and for m = 1 , we have</p><p>u 1 ( t ) = ℏ [ N ( ϕ ( t , q ) ) − P ( t ) ] | q = 0 = ℏ { ϕ ( t , q ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) ϕ ( k ) ( s , q ) d s     − ∫ a t ( t − s ) g * ( s ) z ( ϕ ( s , q ) ) d s     + μ 1 ∫ a t ( t − s ) G 1 * [ ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ] d s     + μ 2 ∫ a t ( t − s ) G 2 * [ ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ] d s } q = 0</p><p>= [ u 0 ( t ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) u 0 ( k ) ( s ) d s     − ∫ a t ( t − s ) g * ( s ) [ z ( ϕ ( s , q ) ) ] q = 0 d s     + μ 1 ∫ a t ( t − s ) G 1 * [ ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ] q = 0 d s     + μ 2 ∫ a t ( t − s ) G 2 * [ ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ] q = 0 d s − P ( t ) ] , (19)</p><p>For m = 2 , from (18) and (19) it follows that</p><p>u 2 ( t ) = u 1 ( t ) + ℏ ∂ ∂ q [ N ( ϕ ( t , q ) ) − P ( t ) ] | q = 0 = u 1 ( t ) + ℏ { u 1 ( t ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) u 1 ( k ) ( s ) d s     − ∫ a t ( t − s ) g * ( s ) ∂ ∂ q [ z ( ϕ ( s , q ) ) ] q = 0 d s     + μ 1 ∫ a t ( t − s ) ∂ ∂ q [ G 1 * ( ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ) ] q = 0 d s     + μ 2 ∫ a t ( t − s ) ∂ ∂ q [ G 2 * ( ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ) ] q = 0 d s } (20)</p><p>Continue this procedure, we obtain</p><p>u m ( t ) = u m − 1 ( t ) + ℏ 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ N ( ϕ ( t , q ) ) − P ( t ) ] | q = 0 = u m − 1 ( t ) + ℏ { u m − 1 ( t ) − ∑ k = 0 1 ∫ a t ( t − s ) c k * ( s ) u m − 1 ( k ) ( s ) d s     − ∫ a t ( t − s ) g * ( s ) 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ z ( ϕ ( s , q ) ) ] q = 0 d s + μ 1 ∫ a t ( t − s ) 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ G 1 * ( ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ) ] q = 0 d s + μ 2 ∫ a t ( t − s ) 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ G 2 * ( ϕ ( s , q ) , ∂ ∂ s ϕ ( s , q ) ) ] q = 0 d s } (21)</p><p>Finding all iterations u m ( t ) , m = 1 , 2 , ⋯ and substituting it into (18) yields approximate solution of the Equation (12) which is equivalent solution of integro-differential Equations (1) with initial conditions (2).</p></sec><sec id="s4"><title>4. Numerical Experiments</title><p>Example 1. (Ahmed Hamoud.et al. [<xref ref-type="bibr" rid="scirp.122461-ref16">16</xref>] ) Consider the following Fredgholm integro-differential equation with initial condition.</p><p>u ′ ( s ) = e s ( 1 + s ) − s + ∫ 0 1 s u ( t ) d t , u ( 0 ) = 0. (22)</p><p>The exact solution of (22) is u ( s ) = s e s .</p><p>To apply HAM convert Eq. (22) into integral equations of the form</p><p>u ( s ) − s 2 2 ∫ 0 1 u ( t ) d t = s e s − s 2 2 . (23)</p><p>Let us write Eq. (23) in the operator form</p><p>N ( ϕ ( s , q ) ) = P ( s ) , (24)</p><p>where</p><p>N ( ϕ ( s , q ) ) = ϕ ( s , q ) − s 2 2 ∫ 0 1 ϕ ( t , q ) d t ,           P ( s ) = s e s − s 2 2 . (25)</p><p>Choose initial guess as u 0 ( s ) = s then from (21) - (23) it follows that</p><p>u 1 ( s ) = ℏ [ N ( ϕ ( s , q ) ) − P ( s ) ] | q = 0 = ℏ [ ϕ ( s , q ) − s 2 2 ∫ 0 1 ϕ ( t , q ) d t − ( s e s − s 2 2 ) ] q = 0 = ℏ [ u 0 ( s ) − s 2 2 ∫ 0 1 u 0 ( t ) d t − ( s e s − s 2 2 ) ] = ℏ [ s + s 2 4 − s e s ] , (26)</p><p>u 2 ( s ) = u 1 ( s ) + ℏ ∂ ∂ q [ N ( ϕ ( s , q ) ) − P ( s ) ] | q = 0 = u 1 ( s ) + ℏ [ u 1 ( s ) − s 2 2 ∫ 0 1 u 1 ( t ) d t ] = u 1 ( s ) ( 1 + ℏ ) + ℏ 2 s 2 6 , (27)</p><p>In general, m-th term of iteration can be computed as</p><p>u m ( s ) = u m − 1 ( s ) + ℏ 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 [ N ( ϕ ( s , q ) ) ] | q = 0 = u m − 1 ( s ) ( 1 + ℏ ) − ℏ s 2 2 ∫ 0 1 u m − 1 ( t ) d t . (28)</p><p>So that three-term approximate solution at ℏ = − 1 is</p><p>U 2 ( s ) ℏ = − 1 = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) ] ℏ = − 1 = s e s − s 2 24 (29)</p><p>We find U 3 ( s ) , U 5 ( s ) , and U 10 ( s ) for ℏ = − 1 according to (18)</p><p>U 3 ( s ) ℏ = − 1 = s e s − s 2 144 U 5 ( s ) ℏ = − 1 = s e s − s 2 5184 U 10 ( s ) ℏ = − 1 = s e s − s 2 40310784 (30)</p><p>Numerical results are summarized in <xref ref-type="table" rid="table1">Table 1</xref>.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> HAM for Example 1 at different values of “N”</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >S</th><th align="center" valign="middle" >Exact u ( s ) = s e s</th><th align="center" valign="middle" >Error (N = 3)</th><th align="center" valign="middle" >Error (N = 5)</th><th align="center" valign="middle" >Error (N = 10)</th></tr></thead><tr><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >0.2</td><td align="center" valign="middle" >0.2442805</td><td align="center" valign="middle" >0.0002777</td><td align="center" valign="middle" >0.0000077</td><td align="center" valign="middle" >9.92 10<sup>−10</sup></td></tr><tr><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.5967298</td><td align="center" valign="middle" >0.0011111</td><td align="center" valign="middle" >0.0000308</td><td align="center" valign="middle" >3.96 10<sup>−9</sup></td></tr><tr><td align="center" valign="middle" >0.6</td><td align="center" valign="middle" >1.0932712</td><td align="center" valign="middle" >0.0025000</td><td align="center" valign="middle" >0.0000694</td><td align="center" valign="middle" >8.93 10<sup>−9</sup></td></tr><tr><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >1.7804327</td><td align="center" valign="middle" >0.0044444</td><td align="center" valign="middle" >0.0001234</td><td align="center" valign="middle" >1.58 10<sup>−8</sup></td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >2.7182818</td><td align="center" valign="middle" >0.0069444</td><td align="center" valign="middle" >0.0001929</td><td align="center" valign="middle" >2.48 10<sup>−8</sup></td></tr></tbody></table></table-wrap><p>From <xref ref-type="table" rid="table1">Table 1</xref>, and Eq. (30), we can conclude that the proposed method approaches to exact solution very fast when number of iteration is increased.</p><p>Example 2. (Huseen [<xref ref-type="bibr" rid="scirp.122461-ref9">9</xref>] ) Let us consider non-linear VIEs</p><p>u ′ ( s ) = − 1 + ∫ 0 s u 2 ( t ) d t , u ( 0 ) = 0. (31)</p><p>Solution: There is no analytic solution of Equation (31). To solve it by standard HAM, we rewrite it in the operator form</p><p>N ( ϕ ( s , q ) ) = f ( s ) , (32)</p><p>where</p><p>{ N ( ϕ ( s , q ) ) = ∂ ∂ s ϕ ( s , q ) − ∫ 0 s ϕ 2 ( t , q ) d t , f ( s ) = − 1. (33)</p><p>It is known that</p><p>{ ϕ ( s , q ) = u 0 ( s ) + ∑ m = 1 ∞ q m u m ( s ) , ∂ ∂ q ϕ ( s , q ) | q = 0 = u 1 ( s ) , ∂ m − 1 ∂ q m − 1 ϕ ( s , q ) | q = 0 = ( m − 1 ) ! u m − 1 ( s ) , ∂ ∂ q ϕ 2 ( s , q ) | q = 0 = 2 u 0 ( s ) u 1 ( s ) ,     ∂ ∂ q ϕ 2 ( s , q ) | q = 0 = u 0 2 ( s ) , 1 ( m − 1 ) ! ∂ m − 1 ∂ q m − 1 ϕ 2 ( s , q ) | q = 0 = ∑ i = 0 m − 1 u i ( s ) u m − 1 − i (34)</p><p>Applying HAM yields</p><p>L [ u 1 ( s ) ] = ℏ [ ∂ ∂ s u 0 ( s ) − ∫ 0 s u 0 2 ( t ) d t − f ( s ) ] , L [ u 2 ( s ) − u 1 ( s ) ] = ℏ [ ∂ ∂ s u 1 ( s ) − 2 ∫ 0 s u 0 ( t ) u 1 ( t ) d t ] , L [ u m ( s ) − u m − 1 ( s ) ] = ℏ 1 ( m − 1 ) ! ∂ m − 1 ∂ s m − 1 [ N ( ϕ ( s , q ) ) ] | q = 0                                                         = ℏ [ ∂ ∂ s u m − 1 ( s ) − ∫ 0 s ∑ i = 0 m − 1 u i ( t ) u m − 1 − i ( t ) d t ] . (35)</p><p>Since L u ( s ) = d d s u ( s ) , by choosing initial guess as u 0 ( s ) = − s it follows that</p><p>u 1 ( s ) = − ℏ 12 ⋅ s 4 u 2 ( s ) = u 1 ( s ) − ℏ 2 252 ⋅ s 4 ( 21 + s 3 ) u 3 ( s ) = u 2 ( s ) + ℏ 2 6048 ⋅ s 4 ( 504 ( 1 + ℏ ) + 24 ( 1 + 2 ℏ ) s 3 + ℏ s 6 ) . (36)</p><p>Five terms approximation of the HAM at ℏ = − 1 is</p><p>U 5 H A M ( s ) = u 0 ( s ) + u 1 ( s ) + u 2 ( s ) + u 3 ( s ) + u 4 ( s ) + u 5 ( s ) = − s + 1 12 s 4 − 1 252 s 7 + 1 6048 s 10 + 1 157248 s 13 + 37 158505984 s 16 . (37)</p><p>Fifth terms approximation of the Adomian decomposition method (ADM) developed in El-Sayed and Abdel-Aziz [<xref ref-type="bibr" rid="scirp.122461-ref21">21</xref>] has the form,</p><p>U 5 A D M ( s ) = u 0 ( s ) + u 1 ( s ) + u 2 ( s ) + u 3 ( s ) + u 4 ( s ) + u 5 ( s ) = − s + 1 12 s 4 − 1 252 s 7 + 1 6048 s 10 + 1 157248 s 13 + 79 264176640 s 16 . (38)</p><p>From (37) and (38), it has almost same terms except last terms. Let us see the numerical comparisons of two methods</p><p>From <xref ref-type="table" rid="table2">Table 2</xref>, it can be seen that HAM is slightly better than ADM. Both methods are highly accurate.</p><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> HAM and ADM for Example 2 at different values of “N = 5”</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >S</th><th align="center" valign="middle" >Exact u ( s ) = s e s</th><th align="center" valign="middle" >HAM</th><th align="center" valign="middle" >ADM</th></tr></thead><tr><td align="center" valign="middle" >0.0000</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >0.0938</td><td align="center" valign="middle" >−0.0937</td><td align="center" valign="middle" >−0.0937935</td><td align="center" valign="middle" >−0.0937935</td></tr><tr><td align="center" valign="middle" >0.2188</td><td align="center" valign="middle" >−0.2186</td><td align="center" valign="middle" >−0.2186089</td><td align="center" valign="middle" >−0.2186090</td></tr><tr><td align="center" valign="middle" >0.3125</td><td align="center" valign="middle" >−0.3117</td><td align="center" valign="middle" >−0.3117041</td><td align="center" valign="middle" >−0.3117060</td></tr><tr><td align="center" valign="middle" >0.4062</td><td align="center" valign="middle" >−0.4040</td><td align="center" valign="middle" >−0.4039240</td><td align="center" valign="middle" >−0.4039390</td></tr><tr><td align="center" valign="middle" >0.5000</td><td align="center" valign="middle" >−0.4948</td><td align="center" valign="middle" >−0.4947605</td><td align="center" valign="middle" >−0.4947230</td></tr><tr><td align="center" valign="middle" >0.6250</td><td align="center" valign="middle" >−0.6124</td><td align="center" valign="middle" >−0.6123349</td><td align="center" valign="middle" >−0.6124310</td></tr><tr><td align="center" valign="middle" >0.7188</td><td align="center" valign="middle" >−0.6969</td><td align="center" valign="middle" >−0.6969540</td><td align="center" valign="middle" >−0.6969410</td></tr><tr><td align="center" valign="middle" >0.8125</td><td align="center" valign="middle" >−0.7771</td><td align="center" valign="middle" >−0.7770340</td><td align="center" valign="middle" >−0.7770900</td></tr><tr><td align="center" valign="middle" >0.9062</td><td align="center" valign="middle" >−0.8520</td><td align="center" valign="middle" >−0.8519477</td><td align="center" valign="middle" >−0.8519340</td></tr><tr><td align="center" valign="middle" >1.0000</td><td align="center" valign="middle" >−0.9205</td><td align="center" valign="middle" >−0.9205260</td><td align="center" valign="middle" >−0.9204760</td></tr></tbody></table></table-wrap><p>Example 3. (Majid Khan, et al. [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] ) Let us consider Fredholm integro-differential equation with initial condition</p><p>u ′ ( s ) = 1 − s 3 + ∫ 0 1 s t u ( t ) d t , u ( 0 ) = 0. (39)</p><p>The exact solution of Eq. (33) is u ( s ) = s .</p><p>To apply HAM convert Eq. (33) into integral equations of the form</p><p>u ( s ) − s 2 2 ∫ 0 1 t u ( t ) d t = s − s 2 6 . (40)</p><p>Let us write Eq. (29) in the operator form</p><p>N ( ϕ ( s , q ) ) = P ( s ) ,</p><p>where</p><p>N ( ϕ ( s , q ) ) = ϕ ( s , q ) − s 2 2 ∫ 0 1 t ϕ ( t , q ) d t ,           P ( s ) = s − s 2 6 . (41)</p><p>Choose initial guess as u 0 ( s ) = s − s 2 12 then from Eqs. (19) - (21), it follows that</p><p>u 1 ( s ) = ℏ [ N ( ϕ ( s , q ) ) − P ( s ) ] | = − ℏ [ 7 s 2 96 ] , . (42)</p><p>u 2 ( s ) = u 1 ( s ) + ℏ ∂ ∂ q [ N ( ϕ ( s , q ) ) − P ( s ) ] | q = 0 = u 1 ( s ) ( 1 + ℏ ) − ℏ 2 s 2 768 .(43)</p><p>So that two-term approximate solution at ℏ = − 1 is</p><p>U 2 ( s ) ℏ = − 1 = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) ] ℏ = − 1 = s − 1 768 s 2 U 5 ( s ) ℏ = − 1 = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) + u 3 ( s ) + u 4 ( s ) + u 5 ( s ) ] ℏ = − 1                               = s − 1 393216 s 2 (44)</p><p>Majid Khan, et al. [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] have developed the Adomian decomposition method (ADM) and two terms approximation of the Laplace decomposition method (LDM). It is shown that ADM at the initial guess u 0 ( s ) = s − s 2 12 has the form</p><p>U 2 ( s ) L D M = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) ] = s − 113 384 s 2 . (45)</p><p>Numerical comparisons of two methods are given in <xref ref-type="table" rid="table3">Table 3</xref>.</p><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> LDM [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] and HAM for Example 3 at different values of “N = 2”</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >S</th><th align="center" valign="middle" >Exact u ( s ) = s</th><th align="center" valign="middle" >Error LDM [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] (N = 2)</th><th align="center" valign="middle" >Error HAM (N = 2)</th><th align="center" valign="middle" >Error HAM (N = 5)</th></tr></thead><tr><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >0.2</td><td align="center" valign="middle" >0.2</td><td align="center" valign="middle" >0.011771</td><td align="center" valign="middle" >0.000260</td><td align="center" valign="middle" >5.08 * 10<sup>−7</sup></td></tr><tr><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.047083</td><td align="center" valign="middle" >0.000520</td><td align="center" valign="middle" >1.01 * 10<sup>−6</sup></td></tr><tr><td align="center" valign="middle" >0.6</td><td align="center" valign="middle" >0.6</td><td align="center" valign="middle" >0.105938</td><td align="center" valign="middle" >0.000781</td><td align="center" valign="middle" >1.52 * 10<sup>−6</sup></td></tr><tr><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >0.188333</td><td align="center" valign="middle" >0.001041</td><td align="center" valign="middle" >2.03 * 10<sup>−6</sup></td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.294271</td><td align="center" valign="middle" >0.001302</td><td align="center" valign="middle" >2.54 * 10<sup>−6</sup></td></tr></tbody></table></table-wrap><p>From <xref ref-type="table" rid="table3">Table 3</xref>, it can be concluded that the standard HAM is dominated the LDM [<xref ref-type="bibr" rid="scirp.122461-ref18">18</xref>] . From last column of <xref ref-type="table" rid="table3">Table 3</xref>, we can observe that error term of the HAM decreases drastically at five iterations only.</p><p>Example 4. (Manafianheris [<xref ref-type="bibr" rid="scirp.122461-ref22">22</xref>] ). Let us consider non-linear FIEs</p><p>u ″ ( s ) = sinh ( s ) + s − ∫ 0 1 s ( cosh 2 ( t ) − u 2 ( t ) ) d t , u ( 0 ) = 0 , ​ ​ ​ ​ ​ ​ ​         u ′ ( 0 ) = 1 (46)</p><p>The exact solution of Eq. (46) is u ( s ) = sinh ( s ) .</p><p>Solution: To apply HAM we convert Eq. (46) into integral equations of the form</p><p>u ( s ) = sinh ( s ) + s 3 12 ( 1 − e 4 − 1 4 e 2 ) + s 3 6 ∫ 0 1 u 2 ( t ) d t</p><p>To solve it by standard HAM we rewrite it in the operator form</p><p>N ( ϕ ( s , q ) ) = f ( s ) ,</p><p>where</p><p>{ N ( ϕ ( s , q ) ) = ∂ 2 ∂ 2 s ϕ ( s , q ) − s 3 6 ∫ 0 1 ϕ 2 ( t , q ) d t , f ( s ) = sinh ( s ) + s 3 12 ( 1 − e 4 − 1 4 e 2 ) .</p><p>In view of Equation (34), we obtain</p><p>L [ u 1 ( s ) ] = ℏ [ N ( ϕ ( s , q ) ) − f ( s ) ] | q = 0 = ℏ [ ∂ ∂ s u m − 1 ( s ) − ∫ 0 1 ∑ i = 0 m − 1 u i ( t ) u m − 1 − i ( t ) d t ] .</p><p>Since L u ( s ) = d 2 d 2 s u ( s ) , if the initial guess is chosen as u 0 ( s ) = sinh ( s ) then the next iteration is</p><p>L [ u 1 ( s ) ] = ℏ [ ∂ 2 ∂ 2 s sinh ( s ) − s 3 6 ∫ 0 1 sinh 2 ( t ) d t − ( sinh ( s ) + s 3 12 ( 1 − e 4 − 1 4 e 2 ) ) ] = 0</p><p>Apparently, the next iterations are as follows</p><p>u 1 ( s ) = u 2 ( s ) = ⋯ = u n ( s ) = 0 .</p><p>So that, U m ( s ) is</p><p>U m ( s ) = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) + ⋯ + u m ( s ) + ⋯ ] | ℏ = − 1 = sinh s (47)</p><p>Thus, for the choice of initial guess u 0 ( s ) = sinh ( s ) we got exact solution. To get approximate solution let us choose an initial guess as u 0 ( s ) = s . In this case, next iterations has the form</p><p>u 1 ( s ) = − ℏ [ sinh ( s ) + s 5 360 + s 5 240 ( 1 − e 4 − 1 4 e 2 ) − s ] u 2 ( s ) = u 1 ( s ) − ℏ 2 [ sinh ( s ) + s 5 360 + s 5 240 ( 1 − e 4 − 1 4 e 2 )                                 − s 5 60 ( 1 e + 1 1680 ( 1 − e 4 − 1 e 2 ) − 739 2520 ) − s ] (48)</p><p>From Eq. (18), one can find two-terms approximate solution at ℏ = − 1 in the form</p><p>U 2 ( s ) = [ u 0 ( s ) + u 1 ( s ) + u 2 ( s ) ] ℏ = − 1 = sinh s + s 5 60 ( 1 e − 319 2520 + 421 1680 ( 1 − e 4 − 1 4 e 4 ) ) ,</p><p>Numerical results of HAM at two iterations with initial guess u 0 ( s ) = s are given in <xref ref-type="table" rid="table4">Table 4</xref>.</p><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> LDM, and HAM for Example 3 at different values of “N = 2”</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >S</th><th align="center" valign="middle" >Exact</th><th align="center" valign="middle" >HAM (N = 2)</th><th align="center" valign="middle" >Error HAM (N = 2)</th></tr></thead><tr><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >0.2</td><td align="center" valign="middle" >0.201336</td><td align="center" valign="middle" >0.20134264</td><td align="center" valign="middle" >0.00000664</td></tr><tr><td align="center" valign="middle" >0.4</td><td align="center" valign="middle" >0.410752</td><td align="center" valign="middle" >0.41096505</td><td align="center" valign="middle" >0.00021273</td></tr><tr><td align="center" valign="middle" >0.6</td><td align="center" valign="middle" >0.636654</td><td align="center" valign="middle" >0.63826899</td><td align="center" valign="middle" >0.00161542</td></tr><tr><td align="center" valign="middle" >0.8</td><td align="center" valign="middle" >0.888106</td><td align="center" valign="middle" >0.89491333</td><td align="center" valign="middle" >0.00680736</td></tr><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.175201</td><td align="center" valign="middle" >0.19597561</td><td align="center" valign="middle" >0.02077443</td></tr></tbody></table></table-wrap><p><xref ref-type="table" rid="table4">Table 4</xref> demonstrates that by increasing the number of iteration, error term of HAM decreases gradually. Thus, the proposed method is highly accurate and suitable. Manafianheris [<xref ref-type="bibr" rid="scirp.122461-ref22">22</xref>] have used LDM for Eq. (46) and got exact solution by LDM. In Eq. (47), it is shown that HAM can also give exact solution too when initial guess u 0 ( s ) = sinh ( s ) .</p></sec><sec id="s5"><title>5. Conclusions</title><p>In this work, we have developed HAM for nonlinear Fredholm-Volterra integro-differential equations by combining Gauss-Legendre quadrature formulas. Numerical results (Example 2 and Example 4) reveled that HAM gave exact solution for the suitable choice of initial guess. From Example 1, it follows that HAM approaches to the exact solution very fast by increasing number of iterations. In Example 2, we can see that HAM and ADM are highly accurate and approaches to the exact solution. Example 3 shows that standard HAM is better than standard ADM. In Example 4, Manafianheris [<xref ref-type="bibr" rid="scirp.122461-ref22">22</xref>] found an exact solution using the Laplace transformation together with ADM, and we also found an exact solution by choosing u 0 ( s ) = sinh ( s ) as an initial guess. For the another initial guess u 0 ( s ) = s , we got a very high accurate solution at m = 2 .</p></sec><sec id="s6"><title>Acknowledgements</title><p>The authors are grateful for the support of the work by University Malaysia Terengganu (UMT) under RMC Research Grant Scheme (UMT, 2020). Project code is 55233, UMT/CRIM/2-2/2/14 Jld. 4(44).</p></sec><sec id="s7"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s8"><title>Cite this paper</title><p>Eshkuvatov, Z., Khayrullaev, D., Nurillaev, M., Mahali, S.M. and Narzullaev, A. (2023) Application of HAM for Nonlinear Integro-Differential Equations of Order Two. Journal of Applied Mathematics and Physics, 11, 55-68. https://doi.org/10.4236/jamp.2023.111005</p></sec></body><back><ref-list><title>References</title><ref id="scirp.122461-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Adomian, G. (1988) A Review of the Decomposition Method in Applied Mathematics. Journal of Mathematical Analysis and Applications, 135, 501-544. https://doi.org/10.1016/0022-247X(88)90170-9</mixed-citation></ref><ref id="scirp.122461-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Adomian, G. (1994) Solving Frontier Problems of Physics: The Decomposition Method. Kluwer Academic Publishers, Boston.</mixed-citation></ref><ref id="scirp.122461-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Wazwaz, A. (2001) A Reliable Algorithm for Solving Boundary Value Problems for Higher-Order Integro-Differentiable Equations. Applied Mathematics and Computation, 118, 327-342. https://doi.org/10.1016/S0096-3003(99)00225-8</mixed-citation></ref><ref id="scirp.122461-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Wazwaz, A. (2002) A Reliable Treatment for Mixed Volterra-Fredholm Integral Equations. Applied Mathematics and Computation, 127, 405-414. https://doi.org/10.1016/S0096-3003(01)00020-0</mixed-citation></ref><ref id="scirp.122461-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Liao, S.J. (1992) The Proposed Homotopy Analysis Technique for the Solution of Nonlinear Problems. PhD Thesis, Shanghai Jiao Tong University, Shanghai.</mixed-citation></ref><ref id="scirp.122461-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Liao, S.J. (2004) On the Homotopy Analysis Method for Nonlinear Problems. Applied Mathematics and Computation, 147, 499-513. https://doi.org/10.1016/S0096-3003(02)00790-7</mixed-citation></ref><ref id="scirp.122461-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Liao, S.J. (2014) Advances in the Homotopy Analysis Method. World Scientific, Singapore. https://doi.org/10.1142/8939</mixed-citation></ref><ref id="scirp.122461-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Bataineh, A.S., Noorani, M.S.M. and Hashim, I. (2009) Modified Homotopy Analysis Method for Solving Systems of Second-Order BVPs. Communications in Nonlinear Science and Numerical Simulation, 14, 430-442. https://doi.org/10.1016/j.cnsns.2007.09.012</mixed-citation></ref><ref id="scirp.122461-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Huseen, S.N. (2020) A Comparative Study of q-Homotopy Analysis Method and Liao’s Optimal Homotopy Analysis Method. Advances in Computer and Communication, 1, 36-45. https://doi.org/10.26855/acc.2020.12.004</mixed-citation></ref><ref id="scirp.122461-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Eshkuvatov, Z.K. (2022) New Development of Homotopy Analysis Method for Non-Linear Integro-Differential Equations with Initial Value Problems. Mathematical Modeling and Computing, 9, 842-859.https://doi.org/10.23939/mmc2022.04.842</mixed-citation></ref><ref id="scirp.122461-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">He, J. (1999) Homotopy Perturbation Technique. Computer Methods in Applied Mechanics and Engineering, 178, 257-262. https://doi.org/10.1016/S0045-7825(99)00018-3</mixed-citation></ref><ref id="scirp.122461-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">He, J. (2000) A Coupling Method of a Homotopy Technique and a Perturbation Technique for Non-Linear Problems. International Journal of Non-Linear Mechanics, 35, 37-43. https://doi.org/10.1016/S0020-7462(98)00085-7</mixed-citation></ref><ref id="scirp.122461-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Yildirim, A. (2010) He’s Homotopy Perturbation Method for Nonlinear Differential-Difference Equations. International Journal of Computer Mathematics, 87, 992-996. https://doi.org/10.1080/00207160802247646</mixed-citation></ref><ref id="scirp.122461-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Golbabai, A. and Javidi, M. (2007) Application of He’s Homotopy Perturbation Method for nth-Order Integro-Differential Equations. Applied Mathematics and Computation, 190, 1409-1416. https://doi.org/10.1016/j.amc.2007.02.018</mixed-citation></ref><ref id="scirp.122461-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Al-Saif, N.S.M. and Ameen, A.S. (2020) Numerical Solution of Mixed Volter-ra-Fredholm Integral Equation Using the Collocation Method. Baghdad Science Journal, 17, 849-853. https://doi.org/10.21123/bsj.2020.17.3.0849</mixed-citation></ref><ref id="scirp.122461-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Hamoud, A.A., Hussain, K.H., Mohammed, N.M. and Ghadle, K.P. (2019) Solving Fredholm Integro-Differential Equations by Using Numerical Techniques. Nonlinear Functional Analysis and Applications, 24, 533-542. http://nfaa.kyungnam.ac.kr/journal-nfaa/index.php/NFAA/article/view/1202</mixed-citation></ref><ref id="scirp.122461-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Dhari, I.A., Mustafa, N.R. and Mustafa, M.M. (2020) Solving Linear Volter-ra-Fredholm Integral Equation of the Second Type Using Linear Programming Method. Baghdad Science Journal, 17, 342-347. https://doi.org/10.21123/bsj.2020.17.1(Suppl.).0342</mixed-citation></ref><ref id="scirp.122461-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Khan, M., Gondal, M.A. and Suleymani, F. (2011) A Novel Two Step Laplasw Decomposition Algorithm for Fredholm Integro-Differential Equation. World Applied Sciences Journal, 13, 2258-2262. https://doi.org/10.1016/j.apm.2011.11.083</mixed-citation></ref><ref id="scirp.122461-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Eshkuvatov, Z.K., Kammuji, M. and Muminov, Z. (2018) Approximate Solution for Linear Integro-Differential Equations of Order One by Legendre Polynomials. Indian Journal of Mathematics, Dharma Prakash Gupta Memorial, 60, 415-438. https://doi.org/10.1063/1.5041639</mixed-citation></ref><ref id="scirp.122461-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Avudainayagam, A. and Van, C. (2000) Wavelet Galerkin Method for Integro-Differential Equations. Applied Numerical Mathematics, 32, 247-254. https://doi.org/10.1016/S0168-9274(99)00026-4</mixed-citation></ref><ref id="scirp.122461-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">El-Sayed, S.M. and Abdel Aziz, M.R. (2003) A Comparison of Adomian’s De-Composition Method and Wavelet Galerkin Method for Solving Integro-Differential Equations. Applied Mathematics and Computation, 136, 151-159. https://doi.org/10.1016/S0096-3003(02)00024-3</mixed-citation></ref><ref id="scirp.122461-ref22"><label>22</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Manafianheris</surname><given-names> J. </given-names></name>,<etal>et al</etal>. (<year>2012</year>)<article-title>Solving the Integro-Differential Equations Using the Modified Laplace Adomian Decomposition Method</article-title><source> Journal of Mathematical Extension</source><volume> 6</volume>,<fpage> 1</fpage>-<lpage>15</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref></ref-list></back></article>