Next Article in Journal
The Generalized H-Bézier Model: Geometric Continuity Conditions and Applications to Curve and Surface Modeling
Previous Article in Journal
Using a Fuzzy Inference System to Obtain Technological Tables for Electrical Discharge Machining Processes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Numerical Algorithm for the Solutions of ABC Singular Lane–Emden Type Models Arising in Astrophysics Using Reproducing Kernel Discretization Method

by
Omar Abu Arqub
1,
Mohamed S. Osman
2,3,*,
Abdel-Haleem Abdel-Aty
4,5,
Abdel-Baset A. Mohamed
6,7 and
Shaher Momani
8,9
1
Department of Mathematics, Faculty of Science, Al-Balqa Applied University, Salt 19117, Jordan
2
Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt
3
Department of Mathematics, Faculty of Applied Science, Umm Alqura University, Makkah 21955, Saudi Arabia
4
Department of Physics, College of Sciences, University of Bisha, P.O. Box 344, Bisha 61922, Saudi Arabia
5
Physics Department, Faculty of Science, Al-Azhar University, Assiut 71524, Egypt
6
Department of Mathematics, College of Science and Humanities in Al-Aflaj, Prince Sattam bin Abdulaziz University, Al-Aflaj 11942, Saudi Arabia
7
Faculty of Science, Assiut University, Assiut 71515, Egypt
8
Department of Mathematics and Sciences, College of Humanities and Sciences, Ajman University, Ajman, UAE
9
Department of Mathematics, Faculty of Science, The University of Jordan, Amman 11942, Jordan
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(6), 923; https://doi.org/10.3390/math8060923
Submission received: 6 May 2020 / Revised: 1 June 2020 / Accepted: 3 June 2020 / Published: 5 June 2020

Abstract

:
This paper deals with the numerical solutions and convergence analysis for general singular Lane–Emden type models of fractional order, with appropriate constraint initial conditions. A modified reproducing kernel discretization technique is used for dealing with the fractional Atangana–Baleanu–Caputo operator. In this tendency, novel operational algorithms are built and discussed for covering such singular models in spite of the operator optimality used. Several numerical applications using the well-known fractional Lane–Emden type models are examined, to expound the feasibility and suitability of the approach. From a numerical viewpoint, the obtained results indicate that the method is intelligent and has several features stability for dealing with many fractional models emerging in physics and mathematics, using the new presented derivative.

1. Prolegomena and Presentation

Fractional calculus is dealing with investigations and applications of derivatives and integrations of arbitrary order that provide an attractive mechanism for explaining the memory and hereditary effort of complex systems [1,2,3,4,5]. Fractional calculus theory dates back to Leibniz in the sixteenth century, and after that, many forms of fractional operators have been introduced in the classical theory. Among them are the Riemann–Liouville, Caputo–Liouville, Atangana–Baleanu–Caputo, and Riesz operator approaches [6,7,8,9,10,11,12,13,14,15,16,17,18]. Fractional calculus attracted focus in current scientific research, due to its nonlocal nature and its ability to handle the effects of external forces of phenomena that cannot be modeled in a traditional way. Recently, a new definition of fractional derivative has proposed, the ABC fractional derivative [19,20,21,22,23,24,25,26,27,28,29,30,31].
At all events, it is not easy to find accurate numerical solutions to FLETM due to the complexity that occurs inside the Mittag–Leffler function in the fractional ABC derivatives. Thereafter, software computer programming is ordinarily used to obtain numerical solutions in acceptable accuracy. Over this treatise, we face to utilize the RKDM to gain approximate numerical outcomes of FLETM, utilizing the ABC fractional sense. More specifically, we consider the subsequent form [32,33].
0 A B C l δ ψ ( l ) + κ 1 q 1 ( l ) l ψ ( l ) + κ 2 q 2 ( l ) ψ ( l ) + Φ ( l , ψ ( l ) ) = T ( l ) ,
subject to the CICs
ψ ( 0 ) = α   and   l ψ ( 0 ) = β .
We are standing for the following: l J [ 0 , 1 ] ; δ ( 1 , 2 ] ; α , β , κ 1 , κ 2 with κ 1 0 κ 2 ; ψ C ( J ) ; q 1 , q 2 C ( J ) while q 1 ( 0 ) = 0 = q 2 ( 0 ) ; Φ C ( J × ) ; T C ( J { 0 } ) . We are recording 0 A B C l δ ψ ( l ) to sign the ABC fractional derivative of ψ in l over J of order δ with
0 A B C l δ ψ ( l ) = ( 1 δ ) ( 1 δ + δ Γ 1 ( δ ) ) 0 l 2 ψ ( k ) n = 0 ( 1 ) n Γ ( n δ + 1 ) ( δ 2 δ ) n ( l k ) n δ d k ,
in which l = 0 is a base point acquaint at l J B ( J ) and ψ S 2 ( J B ( J ) ) , whereas S 2 is the Sobolev functions’ space of order 2 on the domain J except the boundary B ( J ) of J erected as
S 2 ( J B ( J ) ) = { ψ L 2 ( J B ( J ) ) : l ψ ( l ) , l 2 ψ ( l ) L 2 ( J B ( J ) ) } .
The FLETM is categorized as a singular differential problem and supplied as an instrument in the formulation of the phenomena that emerge with various applications across mathematical physics and astrophysics. It characterizes the equilibrium thickness allocation in the self-gravitating sphere of polytrophic isothermal gas and, at the origin, contained singularity nodes. The FLETM has weight in the domain of modeling the clusters of galaxies, stellar structure, and radiative cooling. Interested reader can go through [32,33,34,35,36], to identify more details, properties, results, and applications on such singular models.
The standard RKDM main field topics are in the modelling and simulation of sundry-dimensional issues in applied computational physical, applied mathematics, and engineering [37,38,39], it has been used in creating numerical and approximate solutions for integral and differential models in the shape of infinite convergent series with floor extent of calculations, without any limited assumptions. This approach adjusted has been utilized as a solver technique to deal with complexes’ nonlinear and discontinues shapes of integral/differential problems arising in various applications area range from engineering to physics as utilized in [40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59].

2. Concrete Structure of the RKDM

This part is dedicated to describing some adaptive necessary rules and preliminaries for the RKDM, especially those concerning the kernel functions and independency. We take A C ( J ) to denote the set of absolutely continuous functions on J and we take L 2 ( J ) to denote the set of square-integrable functions on J .
Assume that is a reproducing kernel Hilbert space. From the Riesz representation theorem, it follows that for every k J , there exists only one H l ( k ) , such that for every F , we have
k J :   F ( k ) , H l ( k ) = F ( l ) .
Definition 1. 
[23] Let Π ( J ) be a Hilbert space with inner product and functional structures, as is given below:
{ Π ( J ) = { ψ ( l ) : ψ ( l ) , l ψ ( l ) , l 2 ψ ( l ) A C ( J ) ;   l 3 ψ ( l ) L 2 ( J ) ; ψ ( 0 ) = l ψ ( 0 ) = 0 } , ψ 1 ( l ) , ψ 2 ( l ) Π = l 2 ψ 1 ( 0 ) l 2 ψ 2 ( 0 ) + J l 3 ψ 1 ( l ) l 3 ψ 2 ( l ) d l , ψ Π = ψ ( l ) , ψ ( l ) Π .
Definition 2. 
[23] Let Δ ( J ) be a Hilbert space with inner product and functional structures, as is given below:
{ Δ ( J ) = { ψ ( l ) : ψ ( l ) A C ( J ) ;   l ψ ( l ) L 2 ( J ) } , ψ 1 ( l ) , ψ 2 ( l ) Δ = J ψ 1 ( l ) ψ 2 ( l ) d l + l ψ 1 ( l ) l ψ 2 ( l ) d l , ψ Δ = ψ ( l ) , ψ ( l ) Δ .
Theorem 1. 
[23] The space Π ( J ) is a complete reproducing kernel with rule
F l ( k ) = 1 120 { l 2 ( 5 k 2 l + k 3 + 10 l 2 ( 3 + k ) ) , k l , k 2 ( 5 l 2 k + l 3 + 10 k 2 ( 3 + l ) ) , k > l .
Theorem 2. 
[23] The space Δ ( J ) is a complete reproducing kernel with rule
G l ( k ) = s i n h ( 1 ) 2 { c o s h ( l + k 1 ) + c o s h ( l k 1 ) , k l , c o s h ( l + k 1 ) + c o s h ( k l 1 ) , k > l .
When applied the RKDM, one must firstly split the convex compact set J into regular sections encoded with l i . This assumes that the acquired set { l i } i = 1 will be dense in J . We attempt to cover J , as well as the numerical procedure ought to end in finite phases.
To examine the independency, suppose { θ i } i = 1 m are not all zero, such that i = 1 m θ i F l i ( k ) = 0 . Take h s ( k ) Π ( J ) , such that h s ( k i ) = δ i , k , i = 1 , 2 , , m , then
0 = h s ( k ) , i = 1 m θ i F l i ( k ) Π = i = 1 m θ i h s ( k ) , F l i ( k ) Π = i = 1 m θ i h s ( k i ) = θ i ,
for i = 1 , 2 , , m . This shows that { F l i ( k ) } i = 1 m is linearly independent for all m 1 and, thus, { F l i ( k ) } i = 1 is linearly independent in Π ( J ) . Similarly, one can find that { G l i ( k ) } i = 1 is linearly independent too.

3. Solutions Shape of FLETM

Multiplying (1) by q 1 ( l ) q 2 ( l ) , we get
q ( l ) 0 A B C l δ ψ ( l ) + κ 1 q 2 ( l ) l ψ ( l ) + κ 2 q 1 ( l ) ψ ( l ) +   Φ ¯ ( l , ψ ( l ) ) =   T ¯ ( l ) ,
in which q ( l ) = q 1 ( l ) q 2 ( l ) ,   Φ ¯ ( l , ψ ( l ) ) = q 1 ( l ) q 2 ( l ) Φ ( l , ψ ( l ) ) , and   T ¯ ( l ) = q 1 ( l ) q 2 ( l ) T ( l ) .
The replacement ψ ( l ) : ψ ( l ) ( β l + α ) converts FLETM given by (11) and (2) into homogenous one. We are denoting the new equation by
q ( l ) 0 A B C l δ ψ ( l ) + κ 1 q 2 ( l ) l ψ ( l ) + κ 2 q 1 ( l ) ψ ( l ) +   Φ ¯ ( l , ψ ( l ) ( β l + α ) ) = T ¯ ¯ ( l ) ,
subject to the CICs
ψ ( 0 ) = 0   and   l ψ ( 0 ) = 0 .
The function T ¯ ¯ ( l ) appears from substituting ψ ( l ) ( β l + α ) instead of ψ ( l ) in (12). In fact, after simplification and transform the extra mathematical terms into the right hand side of (12), one can write T ¯ ¯ ( l ) = q ( l ) 0 A B C l δ ( β l + α ) + κ 1 q 2 ( l ) l ( β l + α ) + κ 2 q 1 ( l ) ( β l + α ) + T ¯ ( l ) .
Define the linear operator A : Π ( J ) Δ ( J ) and its map A [ ψ ] ( l ) as
A [ ψ ] ( l ) = q ( l ) 0 A B C l δ ψ ( l ) + κ 1 q 2 ( l ) l ψ ( l ) + κ 2 q 1 ( l ) ψ ( l ) .
Putting ζ ( l , ψ ( l ) , l ψ ( l ) ) : = T ¯ ¯ ( l )   Φ ¯ ( l , ψ ( l ) ( β l + α ) ) , then (14) and (13) are converted into the form
{ A [ ψ ] ( l ) = ζ ( l , ψ ( l ) , l ψ ( l ) ) , ψ ( 0 ) = 0   a n d   l ψ ( 0 ) = 0 .
We arrange the system of orthogonal functions taking S i ( l ) = G l i ( l ) , Λ i ( l ) = A * [ S i ] ( l ) , i = 1 , 2 , 3 , , such that { l i } i = 1 is dense on J . The Gram–Schmidt orthogonalization process is used to generate the system of orthonormal functions {   Λ ¯ i ( l ) } i = 1 on Π ( J ) , where
  Λ ¯ i ( l ) = j = 1 i ε i j Λ j ( l ) ,
with the orthogonalization coefficients ε i j with the indexes i = 2 , 3 , , and j = 1 , 2 , , i 1 are computed in the subsequent algorithm.
Algorithm 1. Steps of the orthonormal Gram–Schmidt process:
    Step 1: For i = 2 , 3 , and j = 1 , 2 , , i 1 , do the following:     
ε 11 = 1 Λ 1 Π , ε i i = 1 Λ i Π 2 p = 1 i 1 Λ i ( t ) , Λ ¯ p ( t ) Π 2 , i 1 , ε i j = 1 Λ i Π 2 p = 1 i 1 Λ i ( t ) ,   Λ ¯ p ( t ) Π 2 p = j i 1 Λ i ( t ) ,   Λ ¯ p ( t ) Π ε p j , i > j .

    Output: The orthogonalization coefficients ε i j .
    Step 2: For i = 1 , 2 , 3 , set
Λ ¯ i ( l ) = j = 1 i ε i j Λ j ( l ) .

    Output: System of orthonormal functions {   Λ ¯ i ( l ) } i = 1 .
Remark 1. 
In the third formula of (17), the calculations of ε i j , i > j are obtaining recursively as follows:
  • If i = 2 and j = 1 , then
    ε 21 = 1 Λ 2 Π 2 p = 1 1 Λ 1 ( t ) , Λ ¯ p ( t ) Π 2 p = 1 1 Λ 2 ( t ) , Λ ¯ p ( t ) Π ε p 1 ,
    where
    p = 1 1 Λ 2 ( t ) , Λ ¯ p ( t ) Π ε p 1 = Λ 2 ( t ) , Λ ¯ 1 ( t ) Π ε 11 = Λ 2 ( t ) , Λ ¯ 1 ( t ) Π 1 Λ 1 Π .
  • If i = 3 and j = 1 , 2 , then
    ε 31 = 1 Λ 3 Π 2 p = 1 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π 2 p = 1 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π ε p 1 ,
    where
    p = 1 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π ε p 1 = Λ 3 ( t ) , Λ ¯ 1 ( t ) Π ε 11 + Λ 3 ( t ) , Λ ¯ 2 ( t ) Π ε 21 = Λ 3 ( t ) , Λ ¯ 1 ( t ) Π 1 Λ 1 Π + Λ 3 ( t ) , Λ ¯ 2 ( t ) Π ε 21
    in which ε 21 comes from (19). Similarly,
    ε 32 = 1 Λ 3 Π 2 p = 1 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π 2 p = 2 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π ε p 2 ,
    where
    p = 2 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π ε p 2 = Λ 3 ( t ) , Λ ¯ 2 ( t ) Π ε 22 = Λ 3 ( t ) , Λ ¯ 2 ( t ) Π 1 Λ 2 Π 2 p = 1 1 Λ 2 ( t ) , Λ ¯ p ( t ) Π 2 .
  • If i = 4 and j = 1 , 2 , 3 then
    ε 41 = 1 Λ 4 Π 2 p = 1 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π 2 p = 1 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 1 ,
    where
    p = 1 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 1 = Λ 4 ( t ) , Λ ¯ 1 ( t ) Π ε 11 + Λ 4 ( t ) , Λ ¯ 2 ( t ) Π ε 21 + Λ 4 ( t ) , Λ ¯ 3 ( t ) Π ε 31 = Λ 4 ( t ) , Λ ¯ 1 ( t ) Π 1 Λ 1 Π + Λ 4 ( t ) , Λ ¯ 2 ( t ) Π ε 21 + Λ 4 ( t ) , Λ ¯ 3 ( t ) Π ε 31 ,
    in which ε 21 comes from (19) and ε 31 comes from (21). Similarly,
    ε 42 = 1 Λ 4 Π 2 p = 1 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π 2 p = 2 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 2 ,
    where
    p = 2 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 2 = Λ 4 ( t ) , Λ ¯ 2 ( t ) Π ε 22 + Λ 4 ( t ) , Λ ¯ 3 ( t ) Π ε 32 = Λ 4 ( t ) , Λ ¯ 2 ( t ) Π 1 Λ i Π 2 p = 1 i 1 Λ i ( t ) , Λ ¯ p ( t ) Π 2 + Λ 4 ( t ) , Λ ¯ 3 ( t ) Π ε 32 ,
    in which ε 32 comes from (23). Finally,
    ε 43 = 1 Λ 4 Π 2 p = 1 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π 2 p = 3 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 3 ,
    where
    p = 3 3 Λ 4 ( t ) , Λ ¯ p ( t ) Π ε p 3 = Λ 4 ( t ) , Λ ¯ 3 ( t ) Π ε 33 = Λ 4 ( t ) , Λ ¯ 3 ( t ) Π 1 Λ 3 Π 2 p = 1 2 Λ 3 ( t ) , Λ ¯ p ( t ) Π 2 .
Analogue for the remaining indexes i = 4 ,   5 , and j = 1 , 2 , , i 1 .
Lemma 1. 
The system { Λ i ( l ) } i = 1 is complete on Π ( J ) .
Proof. 
Λ i ( l ) = A * [ S i ] ( l ) assures that Λ i ( l ) Π ( J ) . For each ψ ( l ) Π ( J ) , if ψ ( l ) , Λ i ( l ) Π = 0 , i = 1 , 2 , , then
ψ ( l ) , Λ i ( l ) Π = ψ ( l ) , A * [ S i ] ( l ) Π = A [ ψ ] ( l ) , S i ( l ) Δ = A [ ψ ] ( l i ) = 0 .
From (5) we get A [ ψ ] ( l i ) = A [ ψ ] ( l ) , S i ( l ) Π = 0 . By the density of { l i } i = 1 in J , we have A [ ψ ] ( l ) = 0 . The existence of A 1 yields ψ ( l ) = 0 . Subsequently, { Λ i ( l ) } i = 1 is complete on Π ( J ) . □
Definition 3. 
[60] If ψ is a continuous function and { Λ ¯ i ( l ) } i = 1 an orthonormal functions system, then ψ ( l ) , Λ ¯ i ( l ) Π , i = 1 , 2 , are called Fourier functions of ψ with respect to the system { Λ ¯ i ( l ) } i = 1 and ψ ( l ) = i = 1 ψ ( l ) , Λ ¯ i ( l ) Π Λ ¯ i ( l ) is called its Fourier expansion.
Theorem 3. 
The subsequent are achieved:
  • Whenever n the analytic solution of (15) fulfills:
    ψ ( l ) = i = 1 j = 1 i ε i j ζ ( l j , ψ ( l j ) , l ψ ( l j ) ) Λ ¯ i ( l ) .
  • The n -term numerical solution of Equation (15) fulfills:
    ψ n ( l ) = i = 1 n j = 1 i ε i j ζ ( l j , ψ ( l j ) , l ψ ( l j ) ) Λ ¯ i ( l ) .
Proof. 
Assume that ε i j are orthogonalization coefficients for the orthonormal functions systems {   Λ ¯ i ( l ) } i = 1 . Then
ψ ( l ) = i = 1 ψ ( l ) , Λ ¯ i ( l ) Π Λ ¯ i ( l ) = i = 1 ψ ( l ) , j = 1 i ε i j Λ j ( l ) Π Λ ¯ i ( l ) = i = 1 j = 1 i ε i j ψ ( l ) , A * [ S j ] ( l ) Π Λ ¯ i ( l ) = i = 1 j = 1 i ε i j A [ ψ ] ( l ) , S j ( l ) Δ   Λ ¯ i ( l ) = i = 1 j = 1 i ε i j ζ ( l , ψ ( l ) , l ψ ( l ) ) , S j ( l ) Δ   Λ ¯ i ( l ) = i = 1 j = 1 i ε i j ζ ( l j , ψ ( l j ) , l ψ ( l j ) ) Λ ¯ i ( l ) .
For the numerical computations, we truncate the series in (32) using the n -term numerical solution of ψ ( l ) . □
The attached steps focusing on the computational steps require using an appropriate software package for solving (15) using RKDM, and in order to evaluate the numerical approximation ψ n of ψ in Π ( J ) .
Algorithm 2. Steps of RKDM for numerical approximations model of FLETM in ABC derivative:
  Step I: Fix l , k in J and do Phases 1 and 2:
     Phase 1: Set l i = 1 n i in the index i = 0 , 1 , , n .
     Phase 2: Set Λ i ( l ) = A * [ S i ] ( l ) in the index i = 1 , 2 , , n .
  Output: the orthogonal function system Λ i ( l ) .
  Step II: For the indices i = 1 , 2 , and j = 1 , 2 , , i 1 do Algorithm 1.
  Output: the orthogonalization coefficients ε i j .
  Step III: Set   Λ ¯ i ( l ) = j = 1 i ε i j Λ j ( l ) in the indices i = 1 , 2 , , n .
  Output: the orthonormal function system   Λ ¯ i ( l ) .
  Step IV: Set ψ 0 ( l 1 ) = 0 and with the indices i = 1 , 2 , , n do Phases 1, 2, and 3:
     Phase 1: Set ψ i ( l i ) = ψ i 1 ( l i ) .
     Phase 2: Set i = j = 1 i ε i j ζ ( l j , ψ ( l j ) , l ψ ( l j ) ) .
     Phase 3: Set ψ n ( l ) = j = 1 i j Λ ¯ j ( l ) .
  Output: The n -term numerical approximation ψ n ( l ) of ψ ( l ) .

4. Convergence Analysis

In this part, the convergence of numerical solution and error behavior are presented. Using convergent series representation, the following two theorems explain that FLETM described in Equation (15) is conditionally formulated and consistent.
To achieve our goal, we assume ψ n 1 Π is bounded whenever n and { l i } i = 1 is dense on J . Then the error n = ψ ψ n Π 2 is decreasing for sufficiently large n , since we have
n n 1 = i = n + 1 ψ ( l ) , Λ ¯ i ( l ) A   Λ ¯ i ( l ) Π 2 i = n μ ( l ) , Λ ¯ i ( l ) A   Λ ¯ i ( l ) Π 2 = i = n + 1 ψ ( l ) , Λ ¯ i ( l ) Π 2 i = n ψ ( l ) , Λ ¯ i ( l ) Π 2 < 0 .
The convergence of i = 1 ψ ( l ) , Λ ¯ i ( l ) Π Λ ¯ i ( l ) yields n 0 whenever n as long as ψ ( l ) and ψ n ( l ) are extracted from (32) and (33).
Lemma 2. 
For ψ Π ( J ) , it holds | ψ ( l ) | 3.5 ψ Π , | l ψ ( l ) | 3 ψ Π , and | l 2 ψ ( l ) | 2 ψ Π .
Proof. 
The proof is straightforward from l 2 ψ ( l ) l 2 ψ ( 0 ) = 0 l p 2 ψ ( p ) d p , Holder’s inequality, and (6). □
If ψ n 1 ψ Π 0 and l n k whenever n then ζ ( l n , ψ n 1 ( l n ) , l ψ n 1 ( l n ) ) ζ ( k , ψ ( k ) , l ψ ( k ) ) . This can be seen directly from Lemma 2 and the fact that ζ ( l , ψ ( l ) , l ψ ( l ) ) C ( J × × , ) . We denote i = j = 1 i ε i j ζ ( l j , ψ ( l j ) , l ψ ( l j ) ) . This allows us to rewrite ψ n ( l ) as
ψ n ( l ) = i = 1 n i Λ ¯ i ( l ) .
Theorem 4. 
From (36), it holds that ψ n ( l ) ψ ( l ) whenever n .
Proof. 
Clearly, ψ n + 1 ( l ) = ψ n ( l ) + n + 1 Λ ¯ n + 1 ( l ) . From the orthogonality of { Λ ¯ i ( l ) } i = 1 , we get
ψ n + 1 Π 2 = ψ n Π 2 + n + 1 2 = ψ n 1 Π 2 + n 2 + n + 1 2 = = ψ 0 Π 2 + i = 1 n + 1 i 2 .
This implies ψ n + 1 Π ψ n Π and there exists γ in such that i = 1 i 2 = γ , which means that { i 2 } i = 1 l 2 . In order to have
ψ m ( l ) ψ m 1 ( l ) ψ m 1 ( l ) ψ m 2 ( l ) ψ n + 1 ( l ) ψ n ( l ) ,
it is sufficient to have for m > n that
ψ m ψ n Π 2 = ψ m ψ m 1 + ψ m 1 + ψ n + 1 ψ n Π 2 = ψ m ψ m 1 Π 2 + ψ m 1 ψ m 2 Π 2 + + ψ n + 1 ψ n Π 2 ,
whereas, ψ m ψ m 1 Π 2 = m 2 . As n , m one has ψ m ψ n Π 2 = l = n + 1 m i 2 0 . By the completeness, ψ n ( l ) Π ( J ) such that ψ n ( l ) ψ ( l ) as n . □
Theorem 5. 
One has ψ ( l ) = i = 1 i Λ ¯ i ( l ) whenever n in (36).
Proof. 
Taking the lim n   on both sides of (36), one get ψ ( l ) = i = 1 i Λ ¯ i ( l ) . Thus
A [ ψ ] ( l k ) = i = 1 i A [ Λ ¯ i ] ( l ) , S k ( l ) Δ = i = 1 i   Λ ¯ i ( l ) , A * [ S k ] ( l ) Π = i = 1 i Λ ¯ i ( l ) , Λ k ( l ) Π ,
and
k = 1 l ε k k A [ ψ ] ( l k ) = i = 1 i Λ ¯ i ( l ) , k = 1 l ε k k Λ k ( l ) Π = i = 1 i Λ ¯ i ( t ) , Λ ¯ k ( l ) Π = l .
If l = 1 , then A [ ψ ] ( l 1 ) = ζ ( l 1 , ψ 0 ( l 1 ) , l ψ 0 ( l 1 ) ) and if l = 2 , then A [ ψ ] ( l 2 ) = ζ ( l 2 , ψ 1 ( l 2 ) , l ψ 1 ( l 2 ) ) . Generally, we have A [ ψ ] ( l n ) = ζ ( l n , ψ n 1 ( l n ) , l ψ n 1 ( l n ) ) . By the density condition, k J ; { l n q } q = 1 such that l n q k whenever q or A [ ψ ] ( l n q ) = ζ ( l n q , ψ n q 1 ( l n q ) , l ψ n q 1 ( l n q ) ) . Letting j one can get A [ ψ ] ( k ) = ζ ( k , ψ ( k ) , l ψ ( k ) ) . Since   Λ ¯ i ( l ) Π ( J ) , then ψ ( l ) satisfies (15). □

5. Model Experiments and Computational Results

In this important portion; in order to solve FLETM in (1) and (2) numerically using the RKDM, three models are presented in certain specific form. In the examples, we demonstrate the performance and efficiency of the proposed approach in term of tables and figures, with some scientific explanations’ comments.

5.1. Certain Examples

In the subsequent FLETM, the readers should note that ψ ( 0 ) and l ψ ( 0 ) are known and may not be homogeneous. The forcing term T ( l ) can be obtain by substituting ψ ( l ) through the given model.
Example 1. 
Consider the following FLETM in ABC sense:
0 A B C l δ ψ ( l ) + 1 l l ψ ( l ) + 1 l ψ ( l ) + l n ( ψ ( l ) ) = T ( l ) ,
subject to the CICs
ψ ( 0 ) = 1   and   l ψ ( 0 ) = δ ,
where the analytic solution is given by
ψ ( l ) = e δ l .
Example 2. 
Consider the following FLETM in ABC sense:
0 A B C l δ ψ ( l ) + 1 s i n ( l ) l ψ ( l ) ψ ( l ) + s i n ( ψ ( l ) ) = T ( l ) ,
subject to the CICs
ψ ( 0 ) = 0   and   l ψ ( 0 ) = 0 ,
where the analytic solution is given by
ψ ( l ) = l 2 δ l 3 .
Example 3. 
Consider the following FLETM in ABC sense:
0 A B C l δ ψ ( l ) + 1 l 2 l ψ ( l ) 1 l 4 ψ ( l ) + ψ ( l ) 3 = T ( l ) ,
subject to the CICs
ψ ( 0 ) = 0   and   l ψ ( 0 ) = δ ,
where the analytic solution is given by
ψ ( l ) = δ l l 2 .
Recall that l [ 0 , 1 ] ; δ ( 1 , 2 ] ; ψ C ( J ) ; and T C ( J { 0 } ) , while 0 A B C l δ ψ ( l ) denotes the ABC fractional derivative of ψ in l over J of order δ .

5.2. Results and Discussions

Take into consideration Algorithms 1 and 2, following the RKDM, using l i = i n , i = 0 , 1 , , n = 50 the numerical validations for different values of grid points l i J will be exhibited. For this purpose, Table 1, Table 2 and Table 3 tabulates the evolution of the absolute errors A b as
A b [ ψ 50 ] ( l i ) = | ψ ( l i ) ψ 50 ( l i ) | ,
for Examples 1, 2, and 3, simultaneously.
From the tables, we observe that the RKDM numerical outcomes are unanimous with analytic solutions during in the area of interest. Additional iterations will lead to more refined solutions along the memory and heritage characteristics of δ . The ABC fractional derivative orders have powerful belongings on the model shapes, which head for lead to remarkable behaviors in the incident of a considerable departure from the value of δ = 2 .
The 3 D surfaces plot of the RKDM numerical solutions for Examples 1, 2, and 3 are drawn in Figure 1a–c simultaneously, for different values of grid points l i J when δ ( 1 , 2 ] . It appears that all figures almost look identical in their behaviors, and in good agreement with each other, particularly when comparing the case of δ = 2 . Moreover, the RKDM numerical solutions are very close at the CICs.

6. Conclusions and Outline

The attractive RKDM has been successfully employed to construct and predict the numerical/analytic solutions for FLETM under the ABC fractional sense. Convergence and consistency were discussed, which turns out that the proposed scheme has decreasing absolute error in the Π ( J ) space. Three FLETM models have been given to test applicability and straightforwardness of the presented approach. The gained numerical data reveal that the numerical solutions are conformable with each other at the selected parameters and nods. Finally, one can see that the RKDM is a methodical and convenient scheme to address various fractional differential/integral problems across applied sciences and engineering area.
In the near future, we intend to conduct more research as a continuation of this work. One of these research studies is related to the applications of the RKDM to solve numerically the Lane–Emden type models that contain functions with singularities or weak regularity, subject to CICs or constraint boundary conditions.

Author Contributions

Conceptualization, O.A.A. and S.M.; methodology O.A.A.; software, A.-H.A.-A.; validation, M.S.O. and A.-B.A.M.; formal analysis, O.A.A.; investigation, O.A.A.; resources, M.S.O.; data curation, A.-H.A.-A.; writing—original draft preparation, M.S.O.; writing—review and editing, O.A.A.; visualization, O.A.A.; supervision, S.M.; project administration, A.-B.A.M.; funding acquisition, A.-B.A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This project was supported by the Deanship of Scientific Research at Prince Sattam Bin Abdulaziz University under the research project No.2020/01/11801.

Acknowledgments

This research was supported by the Ajman University grant: 2019–20.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

FLETMfractional Lane–Emden type model
ABCAtangana–Baleanu–Caputo
RKDMreproducing kernel discretization method
CICconstraint initial condition

References

  1. Herrmann, R. Fractional Calculus: An Introduction for Physicists; World Scientific: Singapore, 2014. [Google Scholar]
  2. Tarasov, V.E. Fractional Dynamics: Applications of Fractional Calculus to Dynamics of Particles, Fields and Media; Springer: Heidelberg, Germany, 2011. [Google Scholar]
  3. West, B.J. Fractional Calculus View of Complexity: Tomorrow’s Science; Taylor & Francis: Oxfordshire, UK, 2015. [Google Scholar]
  4. Kilbas, A.; Srivastava, H.; Trujillo, J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  5. West, B.J. Natures Patterns and the Fractional Calculus; De Gruyter: Berlin, Germany, 2017. [Google Scholar]
  6. Abu Arqub, O.; El-Ajou, A.; Momani, S. Constructing and predicting solitary pattern solutions for nonlinear time-fractional dispersive partial differential equations. J. Comput. Phys. 2015, 293, 385–399. [Google Scholar] [CrossRef]
  7. El-Ajou, A.; Abu Arqub, O.; Momani, S. Approximate analytical solution of the nonlinear fractional KdV-Burgers equation: A new iterative algorithm. J. Comput. Phys. 2015, 293, 81–95. [Google Scholar] [CrossRef]
  8. El-Ajou, A.; Abu Arqub, O.; Momani, S.; Baleanu, D.; Alsaedi, A. A novel expansion iterative method for solving linear partial differential equations of fractional order. Appl. Math. Comput. 2015, 257, 119–133. [Google Scholar] [CrossRef]
  9. Ray, S.S. New exact solutions of nonlinear fractional acoustic wave equations in ultrasound. Comput. Math. Appl. 2016, 71, 859–868. [Google Scholar]
  10. Ray, S.S.; Sahoo, S. Analytical approximate solutions of Riesz fractional diffusion equation and Riesz fractional advection-dispersion equation involving nonlocal space fractional derivatives. Math. Method. Appl. Sci. 2015, 38, 2840–2849. [Google Scholar] [CrossRef]
  11. Ghanbari, B.; Osman, M.S.; Baleanu, D. Generalized exponential rational function method for extended Zakharov–Kuzetsov equation with conformable derivative. Mod. Phys. Lett. A 2019, 34, 1950155. [Google Scholar] [CrossRef]
  12. Zhuang, P.; Liu, F.; Anh, V.; Turner, I. Numerical methods for the variable-order fractional advection-diffusion equation with a nonlinear source term. SIAM J. Numer. Anal. 2009, 47, 1760–1781. [Google Scholar] [CrossRef] [Green Version]
  13. Osman, M.S. New analytical study of water waves described by coupled fractional variant Boussinesq equation in fluid dynamics. Pramana 2019, 93, 26. [Google Scholar] [CrossRef]
  14. Liu, J.G.; Osman, M.S.; Zhu, W.H.; Zhou, L.; Ai, G.P. Different complex wave structures described by the Hirota equation with variable coefficients in inhomogeneous optical fibers. Appl. Phys. B 2019, 125, 175. [Google Scholar] [CrossRef]
  15. Osman, M.S.; Wazwaz, A.M. A general bilinear form to generate different wave structures of solitons for a (3+ 1) -dimensional Boiti-Leon-Manna-Pempinelli equation. Math. Method Appl. Sci. 2019, 42, 6277–6283. [Google Scholar] [CrossRef]
  16. Osman, M.S.; Lu, D.; Khater, M.M.A.; Attia, R.A.M. Complex wave structures for abundant solutions related to the complex Ginzburg–Landau model. Optik 2019, 192, 162927. [Google Scholar] [CrossRef]
  17. Ding, Y.; Osman, M.S.; Wazwaz, A.M. Abundant complex wave solutions for the nonautonomous Fokas–Lenells equation in presence of perturbation terms. Optik 2019, 181, 503–513. [Google Scholar] [CrossRef]
  18. Lu, D.; Tariq, K.U.; Osman, M.S.; Baleanu, D.; Younis, M.; Khatera, M.M.A. New analytical wave structures for the (3 + 1)-dimensional Kadomtsev-Petviashvili and the generalized Boussinesq models and their applications. Results Phys. 2019, 14, 102491. [Google Scholar] [CrossRef]
  19. Atangana, A.; Baleanu, D. New fractional derivatives with non-local and non-singular kernel: Theory and application to heat transfer model. Therm. Sci. 2016, 20, 763–769. [Google Scholar] [CrossRef] [Green Version]
  20. Atangana, A.; Nieto, J.J. Numerical solution for the model of RLC circuit via the fractional derivative without singular kernel. Adv. Mech. Eng. 2015, 7, 1–7. [Google Scholar] [CrossRef]
  21. Maayah, B.; Yousef, F.; Abu Arqub, O.; Momani, S.; Alsaedi, A. Computing bifurcations behavior of mixed type singular time-fractional partial integrodifferential equations of Dirichlet functions types in Hilbert space with error analysis. Filomat 2019, 33, 3845–3853. [Google Scholar] [CrossRef]
  22. Atangana, A.; Gómez-Aguilar, J.F. Decolonisation of fractional calculus rules: Breaking commutativity and associativity to capture more natural phenomena. Eur. Phys. J. Plus 2018, 133, 1–22. [Google Scholar] [CrossRef]
  23. Abu Arqub, O.; Al-Smadi, M. Atangana-Baleanu fractional approach to the solutions of Bagley-Torvik and Painlevé equations in Hilbert space. Chaos Solitons Fractals 2018, 117, 161–167. [Google Scholar] [CrossRef]
  24. Abu Arqub, O.; Maayah, B. Modulation of reproducing kernel Hilbert space method for numerical solutions of Riccati and Bernoulli equations in the Atangana-Baleanu fractional sense. Chaos Solitons Fractals 2019, 125, 163–170. [Google Scholar] [CrossRef]
  25. Abu Arqub, O.; Maayah, B. Numerical solutions of integrodifferential equations of Fredholm operator type in the sense of the Atangana-Baleanu fractional operator. Chaos Solitons Fractals 2018, 117, 117–124. [Google Scholar] [CrossRef]
  26. Abu Arqub, O.; Maayah, B. Fitted fractional reproducing kernel algorithm for the numerical solutions of ABC-Fractional Volterra integro-differential equations. Chaos Solitons Fractals 2019, 126, 394–402. [Google Scholar] [CrossRef]
  27. Djida, J.D.; Atangana, A.; Area, I. Numerical computation of a fractional derivative with non-local and non-singular kernel. Math. Model. Nat. Phenom. 2017, 12, 4–13. [Google Scholar] [CrossRef]
  28. Atangana, A.; Gómez-Aguilar, J.F. Fractional derivatives with no-index law property: Application to chaos and statistic. Chaos Solitons Fractals 2018, 114, 516–535. [Google Scholar] [CrossRef]
  29. Atangana, A. On the new fractional derivative and application to nonlinear Fisher’s reaction-diffusion equation. Appl. Math. Comput. 2016, 273, 948–956. [Google Scholar] [CrossRef]
  30. Atangana, A.; Koca, I. On the new fractional derivative and application to Nonlinear Baggs and Freedman model. J. Nonlinear Sci. Appl. 2016, 9, 2467–2480. [Google Scholar] [CrossRef] [Green Version]
  31. Algahtani, O. Comparing the Atangana-Baleanu and Caputo-Fabrizio derivative with fractional order: Allen Cahn model. Chaos Solitons Fractals 2016, 89, 552–559. [Google Scholar] [CrossRef]
  32. Akgül, A.; Inc, M.; Karatas, E.; Baleanu, D. Numerical solutions of fractional differential equations of Lane-Emden type by an accurate technique. Adv. Differ. Equ. 2015, 2015, 220. [Google Scholar] [CrossRef] [Green Version]
  33. Singh, O.P.; Pandey, R.K.; Singh, V.K. An analytic algorithm of Lane–Emden type equations arising in astrophysics using modified Homotopy analysis method. Comput. Phys. Commun. 2009, 180, 1116–1124. [Google Scholar] [CrossRef]
  34. Kıymaz, O.; Mirasyedioğlu, Ş. A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equation. Appl. Math. Comput. 2005, 171, 1218–1225. [Google Scholar]
  35. Iqbal, S.; Javed, A. Application of optimal homotopy asymptotic method for the analytic solution of singular Lane–Emden type equation. Appl. Math. Comput. 2011, 217, 7753–7761. [Google Scholar] [CrossRef]
  36. Pandey, R.K.; Kumar, N. Solution of Lane–Emden type equations using Bernstein operational matrix of differentiation. New Astron. 2012, 17, 303–308. [Google Scholar] [CrossRef]
  37. Cui, M.; Lin, Y. Nonlinear Numerical Analysis in the Reproducing Kernel Space; Nova Science: Hauppauge, NY, USA, 2009. [Google Scholar]
  38. Berlinet, A.; Agnan, C.T. Reproducing Kernel Hilbert Space in Probability and Statistic; Kluwer Academic Publishers: New York, NY, USA, 2004. [Google Scholar]
  39. Daniel, A. Reproducing Kernel Spaces and Applications; Springer: Basel, Switzerland, 2003. [Google Scholar]
  40. Abu Arqub, O.; Al-Smadi, M.; Momani, S.; Hayat, T. Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput. 2016, 20, 3283–3302. [Google Scholar] [CrossRef]
  41. Abu Arqub, O.; Al-Smadi, M.; Momani, S.; Hayat, T. Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput. 2017, 21, 7191–7206. [Google Scholar] [CrossRef]
  42. Abu Arqub, O. Adaptation of reproducing kernel algorithm for solving fuzzy Fredholm-Volterra integrodifferential equations. Neural Comput. Appl. 2017, 28, 1591–1610. [Google Scholar] [CrossRef]
  43. Abu Arqub, O. Fitted reproducing kernel Hilbert space method for the solutions of some certain classes of time-fractional partial differential equations subject to initial and Neumann boundary conditions. Comput. Math. Appl. 2017, 73, 1243–1261. [Google Scholar] [CrossRef]
  44. Abu Arqub, O. Numerical solutions for the Robin time-fractional partial differential equations of heat and fluid flows based on the reproducing kernel algorithm. Int. J. Numer. Meth. Heat 2018, 28, 828–856. [Google Scholar] [CrossRef]
  45. Abu Arqub, O. The reproducing kernel algorithm for handling differential algebraic systems of ordinary differential equations. Math. Meth. Appl. Sci. 2016, 39, 4549–4562. [Google Scholar] [CrossRef]
  46. Abu Arqub, O.; Al-Smadi, M.; Shawagfeh, N. Solving Fredholm integro-differential equations using reproducing kernel Hilbert space method. Appl. Math. Comput. 2013, 219, 8938–8948. [Google Scholar] [CrossRef]
  47. Abu Arqub, O.; Al-Smadi, M. Numerical algorithm for solving two-point, second-order periodic boundary value problems for mixed integro-differential equations. Appl. Math. Comput. 2014, 243, 911–922. [Google Scholar] [CrossRef]
  48. Abu Arqub, O. Approximate solutions of DASs with nonclassical boundary conditions using novel reproducing kernel algorithm. Fundam. Inform. 2016, 146, 231–254. [Google Scholar] [CrossRef]
  49. Abu Arqub, O.; Al-Smadi, M. Numerical algorithm for solving time-fractional partial integrodifferential equations subject to initial and Dirichlet boundary conditions. Numer. Meth. Part. Differ. Equ. 2018, 34, 1577–1597. [Google Scholar] [CrossRef]
  50. Abu Arqub, O. Solutions of time-fractional Tricomi and Keldysh equations of Dirichlet functions types in Hilbert space. Numer. Meth. Part. Differ. Equ. 2018, 34, 1759–1780. [Google Scholar] [CrossRef]
  51. Abu Arqub, O. Numerical solutions of systems of first-order, two-point BVPs based on the reproducing kernel algorithm. Calcolo 2018, 55, 1–28. [Google Scholar] [CrossRef]
  52. Abu Arqub, O.; Odibat, Z.; Al-Smadi, M. Numerical solutions of time-fractional partial integrodifferential equations of Robin functions types in Hilbert space with error bounds and error estimates. Nonlinear Dyn. 2018, 94, 1819–1834. [Google Scholar] [CrossRef]
  53. Abu Arqub, O.; Al-Smadi, M. An adaptive numerical approach for the solutions of fractional advection–diffusion and dispersion equations in singular case under Riesz’s derivative operator. Physica A 2020, 540, 123257. [Google Scholar] [CrossRef]
  54. Abu Arqub, O. Numerical algorithm for the solutions of fractional order systems of Dirichlet function types with comparative analysis. Fundam. Inform. 2019, 166, 111–137. [Google Scholar] [CrossRef]
  55. Al-Smadi, M.; Abu Arqub, O. Computational algorithm for solving fredholm time-fractional partial integrodifferential equations of dirichlet functions type with error estimates. Appl. Math. Comput. 2019, 342, 280–294. [Google Scholar] [CrossRef]
  56. Abu Arqub, O.; Shawagfeh, N. Application of reproducing kernel algorithm for solving Dirichlet time-fractional diffusion-Gordon types equations in porous media. J. Porous Media 2019, 22, 411–434. [Google Scholar] [CrossRef]
  57. Jiang, W.; Chen, Z. A collocation method based on reproducing kernel for a modified anomalous sub-diffusion equation. Numer. Meth. Part. Differ. Equ. 2014, 30, 289–300. [Google Scholar] [CrossRef]
  58. Geng, F.Z.; Qian, S.P.; Li, S. A numerical method for singularly perturbed turning point problems with an interior layer. J. Comput. Appl. Math. 2014, 255, 97–105. [Google Scholar] [CrossRef]
  59. Lin, Y.; Cui, M.; Yang, L. Representation of the exact solution for a kind of nonlinear partial differential equations. Appl. Math. Lett. 2006, 19, 808–813. [Google Scholar] [CrossRef] [Green Version]
  60. Parashar, B.P. Differential and Integral Equations, 2nd ed.; CBS Publishers: Delhi, India, 2008. [Google Scholar]
Figure 1. The 3 D computational values of the RKDM when l i J and δ ( 1 , 2 ] : (a) Example 1; (b) Example 2; and (c) Example 3.
Figure 1. The 3 D computational values of the RKDM when l i J and δ ( 1 , 2 ] : (a) Example 1; (b) Example 2; and (c) Example 3.
Mathematics 08 00923 g001
Table 1. Numerical results of Example 1 using RKDM.
Table 1. Numerical results of Example 1 using RKDM.
δ = 2 δ = 1.75 δ = 1.5 δ = 1.25
l i A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i )
0 0 0 0 0
0.1 5.58923 × 10 7 2.39589 × 10 6 9.76028 × 10 6 1.26481 × 10 5
0.2 7.29487 × 10 7 8.43183 × 10 6 5.53946 × 10 5 4.51370 × 10 4
0.3 5.10731 × 10 7 9.31378 × 10 6 6.44253 × 10 5 8.45264 × 10 4
0.4 4.86899 × 10 7 4.02242 × 10 6 5.96694 × 10 5 6.39510 × 10 4
0.5 3.73586 × 10 7 6.44048 × 10 6 9.76767 × 10 5 8.49810 × 10 4
0.6 5.96425 × 10 7 9.83946 × 10 6 3.13543 × 10 5 7.18295 × 10 4
0.7 8.30602 × 10 7 8.11052 × 10 6 1.78901 × 10 5 2.28708 × 10 4
0.8 3.09230 × 10 7 3.03588 × 10 6 8.12647 × 10 5 5.51276 × 10 4
0.9 7.82026 × 10 6 2.81165 × 10 6 5.67583 × 10 5 6.57153 × 10 4
1.0 6.27080 × 10 6 3.20502 × 10 5 2.14565 × 10 4 3.76831 × 10 4
Table 2. Numerical results of Example 2 using RKDM.
Table 2. Numerical results of Example 2 using RKDM.
δ = 2 δ = 1.75 δ = 1.5 δ = 1.25
l i A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i )
0 0 0 0 0
0.1 1.66034 × 10 7 3.79764 × 10 6 8.68106 × 10 5 7.78427 × 10 4
0.2 2.58021 × 10 7 6.04130 × 10 6 6.66813 × 10 5 4.83384 × 10 4
0.3 2.47746 × 10 7 2.43097 × 10 6 5.42359 × 10 5 4.13100 × 10 4
0.4 6.83007 × 10 8 7.36473 × 10 6 1.28745 × 10 5 9.26837 × 10 4
0.5 1.54628 × 10 7 7.49228 × 10 6 7.24921 × 10 5 2.34712 × 10 4
0.6 4.61756 × 10 7 9.86819 × 10 6 3.86754 × 10 5 7.72225 × 10 4
0.7 8.34165 × 10 8 6.41801 × 10 6 2.32842 × 10 5 2.55304 × 10 4
0.8 9.75666 × 10 8 6.05864 × 10 6 6.41085 × 10 5 5.48677 × 10 4
0.9 1.96125 × 10 7 1.54146 × 10 6 5.49951 × 10 5 6.03551 × 10 4
1.0 2.45293 × 10 7 9.86166 × 10 6 2.78153 × 10 5 9.96146 × 10 4
Table 3. Numerical results of Example 3 using RKDM.
Table 3. Numerical results of Example 3 using RKDM.
δ = 2 δ = 1.75 δ = 1.5 δ = 1.25
l i A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i ) A b [ ψ 50 ] ( l i )
0 0 0 0 0
0.1 8.72538 × 10 7 8.35309 × 10 6 4.24210 × 10 5 9.37424 × 10 4
0.2 7.62576 × 10 7 5.90241 × 10 6 1.89126 × 10 5 4.86929 × 10 4
0.3 4.31937 × 10 7 7.87242 × 10 6 9.13479 × 10 5 2.67124 × 10 4
0.4 4.71124 × 10 7 3.19969 × 10 6 7.50933 × 10 5 7.64597 × 10 4
0.5 3.51107 × 10 6 6.03111 × 10 6 4.86751 × 10 5 7.01821 × 10 4
0.6 8.69821 × 10 6 6.45966 × 10 5 2.98386 × 10 5 8.42708 × 10 4
0.7 2.50806 × 10 6 2.80152 × 10 5 7.89215 × 10 5 4.27468 × 10 4
0.8 1.25974 × 10 6 3.66312 × 10 5 4.03998 × 10 5 8.68758 × 10 4
0.9 2.14535 × 10 6 5.01585 × 10 5 1.76836 × 10 4 8.38715 × 10 4
1.0 2.93206 × 10 6 1.57354 × 10 5 2.81862 × 10 4 9.03151 × 10 4

Share and Cite

MDPI and ACS Style

Arqub, O.A.; Osman, M.S.; Abdel-Aty, A.-H.; Mohamed, A.-B.A.; Momani, S. A Numerical Algorithm for the Solutions of ABC Singular Lane–Emden Type Models Arising in Astrophysics Using Reproducing Kernel Discretization Method. Mathematics 2020, 8, 923. https://doi.org/10.3390/math8060923

AMA Style

Arqub OA, Osman MS, Abdel-Aty A-H, Mohamed A-BA, Momani S. A Numerical Algorithm for the Solutions of ABC Singular Lane–Emden Type Models Arising in Astrophysics Using Reproducing Kernel Discretization Method. Mathematics. 2020; 8(6):923. https://doi.org/10.3390/math8060923

Chicago/Turabian Style

Arqub, Omar Abu, Mohamed S. Osman, Abdel-Haleem Abdel-Aty, Abdel-Baset A. Mohamed, and Shaher Momani. 2020. "A Numerical Algorithm for the Solutions of ABC Singular Lane–Emden Type Models Arising in Astrophysics Using Reproducing Kernel Discretization Method" Mathematics 8, no. 6: 923. https://doi.org/10.3390/math8060923

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