Volume 3, Issue 6 e1195
RESEARCH ARTICLE
Full Access

Numerical approximations for a class of nonlinear higher order singular boundary value problem by using homotopy perturbation and variational iteration method

Biswajit Pandit

Biswajit Pandit

Department of Mathematics, Indian Institute of Technology Patna, Patna, India

Search for more papers by this author
Amit Kumar Verma

Amit Kumar Verma

Department of Mathematics, Indian Institute of Technology Patna, Patna, India

Search for more papers by this author
Ravi P. Agarwal

Corresponding Author

Ravi P. Agarwal

Department of Mathematics, Texas A & M, University-Kingsville, Kingsville, Texas, USA

Correspondence Ravi P. Agarwal, Department of Mathematics, Texas A & M, University-Kingsville, 700 University Blvd., MSC 172, Kingsville, TX 78363-8202, USA.

Email: [email protected]

Search for more papers by this author
First published: 28 September 2021
Citations: 2

Abstract

In this work, we focus on the non-linear fourth order class of singular boundary value problem which contains the parameter λ . We convert this non-linear differential equation into third order non-linear differential equation. The third order problem is singular, non self adjoint, and nonlinear. Moreover, depending upon λ , it admits multiple solutions. Hence, it is too difficult to capture these solutions by any discrete method such as finite difference and so forth. Here we develop an iterative technique with the help of homotopy perturbation method and variational iteration method in a suitable way. Convergence of this series solution is studied in a novel way. We compute these solutions numerically. For small positive values of λ , singular BVP has two solutions while solutions can not be found for large positive values of λ . Furthermore, we also find dual solutions for λ < 0 .

1 INTRODUCTION

Molecular beam epitaxy is a technique of depositing epitaxial thin films1, 2 from molecular or atomic beams on a heated crystaline substrate under ultra-high vacuum (UHV) conditions. It has a lot of advantages over other epitaxial techniques such as LPE, HVPE, and so forth. A particular advantage is that it permits the growth of crystalline layers at desire temperatures where solid-state diffusion is negligible. In Reference 3, Escudero et al. consider the function
φ : Ω 2 × + , ()
which describes the height of growing interface at a spatial point x Ω 2 at time t + . They considered conservative counterpart of the Kardar–Parisi–Zhang equation4
φ t = μ Δ 2 φ + ζ Δ φ 2 + η ( x , t ) , ()
where x = ( x 1 , x 2 ) be the spatial variable and η ( x , t ) be the noise term or viscosity term such that Gaussian distributed random variable5 takes the account of the thermal fluctuations. After simplification as given in Reference 3, from (2) we get
φ t = 2 K 1 det ( D 2 φ ) K 2 4 φ + η ( x , t ) . ()
The Equation (3) is known as a higher order conservative counterpart of the Kardar–Parisi–Zhang equation,4 which is an analogue of Equation (2). It is conservative in the sense that, if we choose appropriate boundary condition, then we get the first moment Ω σ d x as a constant. Each terms in Equation (3) have a clear geometrical meaning which was described in Reference 3. To know more about η ( x , t ) , reader may read Reference 5. Now, we set Equation (3) in a possible continuum description.6 Therefore the stationary version of (3) is given by
Δ 2 φ = det ( D 2 φ ) + λ f ( x ) , x 2 , boundary conditions , ()
where λ is a parameter and f ( x ) is a know function. In the following, we consider homogeneous Dirichlet and Navier boundary conditions, which are
φ = 0 , φ n = 0 on Ω . ()
and
φ = 0 , Δ φ = 0 on Ω , ()
where n is unit normal to Ω , respectively. In Reference 7, Escudero et al. theoretically proved that, for any f ( x ) L 1 ( Ω ) , λ 0 such that 0 < λ < λ 0 the problem (4) has at least two solutions. Now we set the problem on a unit disk and consider f ( x ) = 1 .
Define
r = | x | , φ ( x ) = ϕ ( | x | ) . ()
Using (7) and (4), we get a fourth order singular non-self adjoint8(p. 58) boundary value problem
1 r r 1 r r ϕ = ϕ ϕ r + λ . ()
Subject to homogeneous Dirichlet boundary condition is
ϕ ( 0 ) = 0 , ϕ ( 1 ) = 0 , ϕ ( 1 ) = 0 , lim r 0 r ϕ ( r ) = 0 , ()
and homogeneous Navier boundary condition of type one is
ϕ ( 0 ) = 0 , ϕ ( 1 ) = 0 , ϕ ( 1 ) + ϕ ( 1 ) = 0 , lim r 0 r ϕ ( r ) = 0 , ()
and homogeneous Navier boundary condition of type two is
ϕ ( 0 ) = 0 , ϕ ( 1 ) = 0 , ϕ ( 1 ) = 0 , lim r 0 r ϕ ( r ) = 0 . ()
In Reference 3 Escudero et al. proved that, there exists λ 0 such that 0 < λ < λ 0 the Equation (8) has at least two solutions. They did not find the value of λ 0 . By using the variational approach, they proved that for 0 λ < λ 0 the Equation (8) has two solutions. Corresponding to Dirichlet boundary condition, the estimated value of λ 0 is between 144 and 307 and corresponding to Equation (11), the estimated value of λ 0 is lie in the interval 9 λ 0 11 . 63 .9 They did not give any conclusion regarding Equation (10) and λ < 0 .

In 2019, Verma et al. extend their results analytically as well as numerically. By using monotone upper and lower solution technique, they10 established the existence of the solution and derived the rigorous bounds of the parameter corresponding to the boundary conditions (9) to (11). They also applied11, 12 HPM, VIM, and Adomian decomposition method on the second order SBVP which arise in the MBE. In Reference 13, they have applied Adomian decomposition method on fourth order singular boundary value problem. Recently, they14 have proposed system of fourth order singular boundary value problem based on Equation (8). To the best of our knowledge, there is no other work related to the governing problem in the literature.

Furthermore, we have noticed few gaps related to the problem (8). The problem (8) is non self adjoint, singularity present at the origin, non linear and included a parameter λ . Again, it always occurred two solution for prescribed value of λ . Therefore, it is difficult to predict the both solutions by using discrete method based on collocation points.

Motivated by the above literature, we propose an iterative technique by using HPM and VIM15 and apply to the third order SBVP directly. We establish the convergence analysis of our propose method. Many authors have applied HPM method to find numerical or analytical solution on fourth order singular differential equation16, 17 as well as sixth order differential equation.18 Recently, Bota and Cruntu19 applied this technique to find the analytical solution of nonlinear differential equation. The convergence of the method was established by Ayati and Biazar in Reference 20. He et al.21 applied HPM to third order Duffing equation and time-fractional frequency-amplitude formulation for nonlinear oscillators. The basic introduction about variational principle can be found in References 22-24. To know more about this method and its convergence reader can read the reference and the references therein.25 The advantage of our proposed technique is to capture dual solutions with high accuracy.

This article is structured in seven sections. Sections 2 is dedicated to the description of the numerical methods. In Section 3, we sketch the details of the computations for the proposed technique. Convergence analysis is given in Section 4. Computed results are presented in Section 5. Finally, our conclusion is discussed in Section 6.

2 DESCRIPTION OF THE ITERATIVE METHODS

Here we describe about the methods. To know more about these two methods reader may read the corresponding references.

2.1 HPM

HPM proposed by He.17 He applied this technique to nonlinear singular boundary value problem.26, 27 Here, to demonstrate the methodology, we consider the following nonlinear problem
L ( y ) + N ( y ) = λ g ( r ) , r [ 0 , 1 ] , ()
where L is the linear differential operator, N is the nonlinear operator, and g ( r ) is the source term with λ as a parameter. We construct the homotopy15 v ( r , q ) : [ 0 , 1 ] × [ 0 , 1 ] , which satisfies
H ( y , r , q ) = ( 1 q ) [ L ( y ) L ( u 0 ) ] + q [ L ( y ) + N ( y ) λ g ( r ) ] = 0 , q [ 0 , 1 ] , r [ 0 , 1 ] , ()
where q [ 0 , 1 ] is the perturbation parameter and u 0 is an initial guess. We choose u 0 in such a way so that it satisfies both linear operator and initial condition. Therefore from (13), we have
q = 0 : H ( y , r , 0 ) = L ( y ) L ( u 0 ) = 0 , ()
q = 1 : H ( y , r , 1 ) = L ( y ) + N ( y ) λ g ( r ) = 0 . ()
Now, we decompose the solution in a power series expression, which is
y ( r , q ) = y 0 + q y 1 + q 2 y 2 + ()
Here y i , i = 0 , 1 , 2 , are unknown functions which are to be determined. We approximate the nonlinear term in terms of He's polynomial which is given by
N y ( r ) = N j = 0 y j ( r ) = i = 0 H i ( y 0 , y 1 , , y i ) , ()
where,
H i = 1 i ! d i d β i N j = 0 i β j y j β = 0 , i = 0 , 1 , 2 , ()
Substituting all the values of (17) and (16) in (13), we have
q 0 : L ( y 0 ) L ( u 0 ) = 0 , ()
q 1 : L ( y 1 ) + L ( u 0 ) + H 0 λ g ( r ) = 0 , ()
q n + 1 : L ( y n + 1 ) + H n = 0 , ()
,
and so on. The approximate solution of Equation (12) is y ( r ) = i = 0 y i .

2.2 VIM

He28 proposed the VIM method to approximate the solution of some well known nonlinear problems. In view of Reference 28, we can write the correctional functional of VIM corresponding to Equation (12) in the following form
y n + 1 ( r ) = y n ( r ) + 0 r η ( t ) L y n ( t ) + N y ˜ n ( t ) λ g ( t ) d t , ()
where η ( t ) is the Lagrange multiplier and y ˜ n is of restricted variation that is, δ y ˜ n = 0 .15 We can determine the optimal value of η ( t ) by using variational principle. The exact solution y ( r ) of Equation (12) is given by y ( r ) = lim n y n ( r ) .

3 DERIVATION OF THE PROPOSED METHOD

Here, we apply our proposed method which is based on HPM and VIM on third order SBVP. We may call this propose method as HPM coupled with VIM method. We can write the Equation (8) in the following form
r 3 ϕ ( i v ) + 2 r 2 ϕ r ϕ + ϕ = r 2 ϕ ϕ + λ r 3 . ()
Equivalently, we have
ϕ = y , ()
and r 3 y + 2 r 2 y r y + y = r 2 y y + λ r 3 . ()
Subject to the Dirichlet boundary condition is
ϕ ( 1 ) = 0 , y ( 0 ) = 0 , y ( 1 ) = 0 , lim r 0 r y ( r ) = 0 , ()
Navier boundary condition of type one is
ϕ ( 1 ) = 0 , y ( 0 ) = 0 , y ( 1 ) + y ( 1 ) = 0 , lim r 0 r y ( r ) = 0 , ()
and Navier boundary condition of type two is
ϕ ( 1 ) = 0 , y ( 0 ) = 0 , y ( 1 ) = 0 , lim r 0 r y ( r ) = 0 . ()
We can easily show that Equation (25) is non-self adjoint.8(p. 58) From (25), we have
L ( y ) = r 3 y + 2 r 2 y r y + y , N ( y ) = r 2 y y and g ( r ) = λ r 3 . ()
Now from (19)–(21), we get
q 0 : L ( y 0 ) L ( u 0 ) = 0 , ()
q 1 : L ( y 1 ) + L ( u 0 ) r 2 y 0 y 0 λ r 3 = 0 , ()
q 2 : L ( y 2 ) + H 1 = 0 , ()
q n + 1 : L ( y n + 1 ) + H n = 0 , ()
,
and so on. By using (29), we have
N j = 0 y j ( r ) = r 2 j = 0 y j ( r ) j = 0 y j ( r ) = i = 0 H i ( y 0 , y 1 , , y i ) , ()
where H i can be written as
H i ( y 0 , y 1 , , y i ) = r 2 j = 0 i y i j ( r ) y j ( r ) . ()
We consider y 0 ( r ) = a r and u 0 ( r ) = a r . To solve Equations (31)–(33), we use VIM. Set y 1 ( r ) = v ( r ) . Now, the variational correctional formula of (31) can be written as
v n + 1 ( r ) = v n ( r ) + 0 r η ( t ) t 3 v n ( t ) + 2 t 2 v n ( t ) t v n ( t ) + v n ( t ) + H 0 ( y 0 ( t ) ) λ t 3 d t , ()
where η ( t ) be the Lagrange multiplier. Now, we operate variation δ on (36) from both sides. Hence, we have,
δ v n + 1 ( r ) = δ v n ( r ) + δ 0 r η ( t ) t 3 v n ( t ) + 2 t 2 v n ( t ) t v n ( t ) + v n ( t ) + H 0 ( y 0 ( t ) ) λ t 3 d t . ()
After simplification as in Reference 15, we have the optimal value of η ( t ) , which is given by
η ( t ) = r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r . ()
Therefore from (36), we have
v n + 1 = v n + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r t 3 v n + 2 t 2 v n t v n + v n + H 0 ( y 0 ) λ t 3 d t . ()
We choose v 0 ( r ) = 0 and consider y 1 ( r ) = v ( r ) = v 1 ( r ) . Therefore, the Equation (31) becomes
y 1 ( r ) = 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H 0 ( y 0 ( t ) ) λ t 3 d t . ()
By similar analysis, we have
y 2 ( r ) = 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H 1 ( y 0 ( t ) , y 1 ( t ) ) d t , ()
y 3 ( r ) = 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H 2 ( y 0 ( t ) , y 1 ( t ) , y 2 ( t ) ) d t , ()
y n + 1 ( r ) = 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H n ( y 0 ( t ) , , y n ( t ) ) d t , ()
,
and so on. The approximate solution y ( r ) is y ( r ) = i = 0 y i ( r ) . Now we will show that the series i = 0 y i ( r ) is convergent and converge to the exact solution y ( r ) .

4 CONVERGENCE ANALYSIS

Let { S n } be the sequence of nth partial sum of the series solution i = 0 y i . Then the solution y ( r ) is given by y ( r ) = lim n S n = lim n i = 0 n y i . Now, we prove the series solution i = 0 y i ( r ) is convergent.

We construct the series of the form
S 0 + ( S 1 S 0 ) + ( S 2 S 1 ) + + ( S n S n 1 ) + = S 0 + i = 0 ( S i + 1 S i ) . ()
For every sequence S n = i = 0 n y i ( r ) , we approximate N i = 0 n y i ( r ) 29, 30 by
N i = 0 n y i ( r ) = r 2 i = 0 n y i ( r ) i = 0 n y i ( r ) = i = 0 n H i ( y 0 , y 1 , , y i ) . ()
Equivalently, we have
N S n = r 2 S n S n = i = 0 n H i ( y 0 , y 1 , , y i ) . ()

Lemma 1.Let y 0 ( r ) = a r , a be the initial approximation and y n C 3 ( 0 , 1 ] , n . Then y n ( 0 ) = 0 , y n ( r ) , y n ( r ) , y n ( r ) , y n ( i v ) ( r ) , H n r 3 are bounded on [ 0 , 1 ] and y n C 3 [ 0 , 1 ] for all n .

Proof.From (35), we have

lim r 0 H 0 r 3 = lim r 0 r 2 y 0 y 0 r 3 = lim r 0 y 0 y 0 y 0 y 0 1 = a 2 . ()
So, H 0 r 3 is bounded on [ 0 , 1 ] . From Equation (40), we get
y 1 ( r ) = 0 r t log ( t ) 2 t ( 2 log ( r ) + 1 ) 4 + t 3 4 r 2 H 0 ( y 0 ( t ) ) t 3 λ d t , ()
y 1 ( r ) = 0 r t 2 r t 3 2 r 3 H 0 ( y 0 ( t ) ) t 3 λ d t , ()
y 1 ( r ) = 0 r t 2 r 2 + 3 t 3 2 r 4 H 0 ( y 0 ( t ) ) t 3 λ d t , ()
y 1 ( i v ) ( r ) = 0 r t r 3 6 t 3 r 5 H 0 ( y 0 ( t ) ) t 3 λ d t . ()
Since 0 t r 1 , and y n C 3 ( 0 , 1 ] , then by second fundamental theorem of calculus,31(theorem.34.3, p. 294) we conclude that y 1 ( 0 ) = 0 , y 1 ( r ) , y 1 ( r ) , y 1 ( r ) , y 1 ( i v ) ( r ) are bounded on [ 0 , 1 ] and y 1 C 3 [ 0 , 1 ] . Again,
lim r 0 H 1 r 3 = lim r 0 r 2 y 0 y 1 r 2 y 1 y 0 r 3 = lim r 0 y 0 y 1 2 y 0 y 1 y 0 y 1 1 . ()
Therefore, H 1 r 3 is bounded on [ 0 , 1 ] . Hence, our assumptions are true for the induction parameter n = 1 . Let our assumptions be true upto n = m . Hence,
y n ( 0 ) = 0 , y n ( r ) , y n ( r ) , y n ( r ) , y n ( i v ) ( r ) and H n r 3 are bounded on [ 0 , 1 ] for all n = 1 , 2 , , m . ()
Let y m C 3 [ 0 , 1 ] for all n = 1 , 2 , , m . Now, for n = m + 1 , we have
y m + 1 ( r ) = 0 r t log ( t ) 2 t ( 2 log ( r ) + 1 ) 4 + t 3 4 r 2 H m ( y 0 ( t ) , , y m ) t 3 d t , ()
y m + 1 ( r ) = 0 r t 2 r t 3 2 r 3 H m ( y 0 ( t ) , , y m ( t ) ) t 3 d t , ()
y m + 1 ( r ) = 0 r t 2 r 2 + 3 t 3 2 r 4 H m ( y 0 ( t ) , , y m ( t ) ) t 3 d t , ()
y m + 1 ( i v ) ( r ) = 0 r t r 3 6 t 3 r 5 H m ( y 0 ( t ) , , y m ( t ) ) t 3 d t . ()
Similarly, since 0 t r 1 and y m C 3 [ 0 , 1 ] for all n = 1 , 2 , , m . , then we conclude that y m + 1 ( 0 ) = 0 , y m + 1 ( r ) , y m + 1 ( r ) , y m + 1 ( r ) , y m + 1 ( i v ) ( r ) are bounded on [ 0 , 1 ] and y m + 1 C 3 [ 0 , 1 ] . Again from (35), we have
lim r 0 H m + 1 r 3 = lim r 0 r 2 i = 0 m + 1 y ( m + 1 ) i y i r 3 = lim r 0 i = 0 m + 1 y ( m + 1 ) i y i + y ( m + 1 ) i y i 1 . ()
So, H m + 1 r 3 is also bounded on [ 0 , 1 ] . Hence by mathematical induction, we have
y n ( 0 ) = 0 , y n ( r ) , y n ( r ) , y n ( r ) , y n ( i v ) ( r ) , H n r 3 are bounded on [ 0 , 1 ] and y n C 3 [ 0 , 1 ] for all n = 1 , 2 , ()
This completes the proof.

Corollary 1.Let y n ( r ) C 3 [ 0 , 1 ] for all n { 0 } . Then

a) S n ( r ) is bounded on [ 0 , 1 ] for n 0 .

b) S n ( 0 ) S n 1 ( 0 ) = 0 for each n .

Proof.a) From definition of S n , we have

S 0 ( r ) = y 0 ( r ) , ()
S 1 ( r ) = y 0 ( r ) + y 1 ( r ) , ()
S n ( r ) = y 0 ( r ) + y 1 ( r ) + + y n ( r ) , ()
,
and so on. By using Lemma 1, we can easily conclude that S n ( r ) is bounded for all n { 0 } .

b) Again by using Lemma 1, we have S n ( 0 ) S n 1 ( 0 ) = y 0 ( 0 ) + y 1 ( 0 ) + + y n ( 0 ) y 0 ( 0 ) y 1 ( 0 ) y n 1 ( 0 ) = y n ( 0 ) = 0 for each n .

Definition 1.Let g ( r ) , h ( r ) : [ 0 , 1 ] be the functions. g ( r ) is said to be big ohh of h ( r ) if there exists a constant M > 0 such that,

g ( r ) M h ( r ) , r [ 0 , 1 ] , ()
and denoted by g ( r ) = O ( h ( r ) ) .32

Lemma 2.Let y n ( r ) C 3 [ 0 , 1 ] and p n = sup r [ 0 , 1 ] | H n | for all n { 0 } . If there exist k 0 such that p i + 1 p i , i k 0 , then there exists a real number K 1 > 0 such that S n ( r ) + S n 1 ( r ) r K 1 , r [ 0 , 1 ] , n .

Proof.From definition of S n and for n = 1 , we have there exist a real number k 1 > 0 that is,

S 1 + S 0 r = y 1 + 2 y 0 r k 1 , r [ 0 , 1 ] . ()
For n = 2 , we have
S 2 + S 1 r = 2 y 1 + 2 y 0 + y 2 r y 1 + 2 y 0 r + y 1 + y 2 r k 1 + y 1 + y 2 r , r [ 0 , 1 ] . ()
By using Lemma 1, we can show that y 1 + y 2 r is bounded on [ 0 , 1 ] . Take k 2 = k 1 + sup r [ 0 , 1 ] y 1 + y 2 r . For n = 3 , we have
S 3 + S 2 r = 2 y 1 + 2 y 0 + 2 y 2 + y 3 r , 2 y 1 + 2 y 0 + y 2 r + y 2 + y 3 r , k 2 + y 2 + y 3 r , r [ 0 , 1 ] . ()
Again, we take k 3 = k 2 + sup r [ 0 , 1 ] y 2 + y 3 r . In general, we have
S m + S m 1 r 2 y 1 + 2 y 0 + + y m 1 r + y m 1 + y m r k m 1 + y m 1 + y m r , r [ 0 , 1 ] . ()
Similarly, we have k m = k m 1 + sup r [ 0 , 1 ] y m 1 + y m r . For n = m + 1 , we have
S m + 1 + S m r 2 y 1 + 2 y 0 + + y m r + y m + y m + 1 r k m + y m + y m + 1 r , r [ 0 , 1 ] . ()
and take k m + 1 = k m + sup r [ 0 , 1 ] y m + y m + 1 r . Finally, we get
S n + S n 1 r k n , r [ 0 , 1 ] , where k n = k n 1 + sup r [ 0 , 1 ] y n 1 + y n r , n . ()
Hence, we have there exists a natural number m that is,
k n k n 1 = sup r [ 0 , 1 ] y n 1 + y n r , n m . ()
Now, we want to show that the sequence { k n } defined by (70) is eventually constant sequence. Now,
y 0 = a r , y 0 = a . ()
Therefore, from the definition of big ohh, we can write y 0 = O ( r ) and y 0 = O ( 1 ) . Now, we have
H n ( y 0 , , y n ) = r 2 i = 0 n y n i y i . ()
Therefore for n = 0 , from (72), we get H 0 ( y 0 ) = r 2 y 0 y 0 H 0 ( y 0 ) = O ( r 3 ) . Now from (40) and (48), we have
y 1 0 r r 2 t log ( t ) 2 r t ( 2 log ( r ) 1 ) 4 r t 3 4 r 3 H 0 ( y 0 ( t ) ) t 3 λ d t , ()
y 1 0 r r t log ( t ) 2 r t ( 2 log ( r ) + 1 ) 4 r + t 3 4 r 3 H 0 ( y 0 ( t ) t 3 ) λ d t . ()
Since 0 t r , by using Lemma 1, we can take l 0 = sup r [ 0 , 1 ] t log ( t ) 2 r t ( 2 log ( r ) 1 ) 4 r t 3 4 r 3 H 0 ( y 0 ( t ) ) t 3 λ and l 1 = sup r [ 0 , 1 ] t log ( t ) 2 r t ( 2 log ( r ) + 1 ) 4 r + t 3 4 r 3 H 0 ( y 0 ( t ) t 3 ) λ . So, we have y 1 = O ( r 3 ) and y 1 = O ( r 2 ) . Again from Equation (72), we get H 1 ( y 0 , y 1 ) = r 2 i = 0 1 y 1 i y i . Therefore, H 1 ( y 0 , y 1 ) = r 2 y 1 ( r ) y 0 ( r ) r 2 y 0 ( r ) y 1 ( r ) . Therefore by using the properties of big ohh, we have H 1 ( y 0 , y 1 ) = O ( r 5 ) . Let our assumptions be true upto n = m . Hence, we have
y 0 = O ( r ) , y 1 = O ( r 3 ) , , y m = O ( r 2 m + 1 ) , ()
y 0 = O ( 1 ) , y 1 = O ( r 2 ) , , y m = O ( r 2 m ) , ()
H 0 ( y 0 ) = O ( r 3 ) , H 1 ( y 0 , y 1 ) = O ( r 5 ) , , H m ( y 0 , , y m ) = O ( r 2 m + 3 ) . ()
Now, for n = m + 1 , we have
y m + 1 0 r r 2 t log ( t ) 2 r t ( 2 log ( r ) 1 ) 4 r t 3 4 r 3 H m ( y 0 ( t ) , , y m ( t ) ) t 3 d t , ()
0 r r 2 t log ( t ) 2 r t ( 2 log ( r ) 1 ) 4 r t 3 4 r 3 p m t 2 m d t , p m is a fixed constant. ()
Hence, we conclude that y m + 1 = O ( r 2 m + 3 ) . Now,
y m + 1 0 r r t log ( t ) 2 r t ( 2 log ( r ) + 1 ) 4 r + t 3 4 r 3 H m ( y 0 ( t ) , , y m ( t ) ) t 3 d t . ()
By similar analysis, we have y m + 1 = O ( r 2 m + 2 ) . Again, we have H m + 1 ( y 0 , , y m + 1 ) = r 2 i = 0 m + 1 y ( m + 1 ) i y i . Therefore, we get H m + 1 ( y 0 , , y m + 1 ) = y m + 1 y 0 + + y 0 y m + 1 H m + 1 ( y 0 , , y m + 1 ) = O ( r 2 m + 5 ) . Hence, by mathematical induction, we conclude that
y n + 1 = O ( r 2 n + 3 ) , y n + 1 = O ( r 2 n + 2 ) and H n + 1 ( y 0 , , y n + 1 ) = O ( r 2 n + 5 ) for all n { 0 } . ()
Now,
y n + 1 + y n r 0 r r t log ( t ) 2 r t ( 2 log ( r ) 1 ) 4 r t 3 4 r 3 H n t 3 + H n 1 t 3 d t , ()
0 r r l 0 p n t 2 n + 3 + p n 1 t 2 n + 1 d t , p n , p n 1 > 0 are fixed constants , ()
l 0 p n r 2 n + 5 ( 2 n + 4 ) + l 0 p n 1 r 2 n + 3 ( 2 n + 2 ) . ()
Therefore, we have
sup r [ 0 , 1 ] y n + 1 + y n r l 0 p n ( 2 n + 4 ) + l 0 p n 1 ( 2 n + 2 ) . ()
Taking limit from both sides, lim n sup r [ 0 , 1 ] y n + 1 + y n r lim n l 0 p n ( 2 n + 4 ) + l 0 p n 1 ( 2 n + 2 ) . ()
Since p n + 1 p n , hence by sandwich theorem, we have
lim n sup r [ 0 , 1 ] y n + 1 + y n r = 0 . ()
Therefore, from (70) and (87), we get there exist a natural number m such that
k n = k n 1 , n m , ()
where each k i , i = 0 , 1 , 2 , are fixed real constants. Hence, the sequence { k n } is an eventually constant sequence. Therefore, it is bounded. This completes the proof.

Lemma 3.Let { S n } be the sequence of nth partial sum of the series defined by (44). Then the sequence { S n } can be written as follows:

S n = C + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r { N S n 1 } d t , n 1 , ()
where C = a r + λ r 3 16 and N is the nonlinear operator defined by (45).

Proof.By using Equations (41)–(43), we get

S n ( r )
= y 0 + y 1 + + y n , ()
= a r + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H 1 ( y 0 ( t ) , y 1 ( t ) ) d t +
+ 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r H n 1 ( y 0 ( t ) , , y n ( t ) ) d t , ()
= a r + λ r 3 16 + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r i = 0 n 1 H n 1 ( y 0 ( t ) , , y n ( t ) ) d t , ()
= C + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r N i = 0 n 1 y i d t , (Using (45)). ()
This completes the proof.

Theorem 1.Let y 0 ( r ) = a r and y n C 3 [ 0 , 1 ] , n . Then i = 0 y i will converge uniformly to the exact solution y ( r ) of Equation (25) for r [ 0 , 1 ] .

Proof.By using Lemma 3 and Equation (89), for n = 1 we have

S 1 = C + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r { N S 0 } d t , ()
= S 0 + 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r t 2 S 0 S 0 λ t 3 d t , ()
= S 0 + 0 r t r log ( t ) 2 t r ( 2 log ( r ) 1 ) 4 t 3 4 r S 0 + S 0 t λ d t . ()
Therefore, we have
S 1 S 0 0 r t r log ( t ) 2 t r ( 2 log ( r ) 1 ) 4 t 3 4 r S 0 + S 0 t + λ d t . ()
Let K 2 = sup 0 t r 1 t r log ( t ) 2 t r ( 2 log ( r ) 1 ) 4 t 3 4 r S 0 + S 0 t + λ and K = max { K 1 , K 2 , 1 2 } , where K 1 is defined by Lemma 2.

Therefore from (97), we get

S 1 S 0 0 r K 2 d z 0 r K d t K r . ()

Again, for n = 2 we have

S 2 S 1
= 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r N S 1 N S 0 d t , ()
= 0 r r log ( t ) 2 r ( 2 log ( r ) 1 ) 4 t 2 4 r S 1 S 1 S 0 S 0 d t , ()
= r log ( t ) 2 r ( 2 log ( r ) 1 ) 4 t 2 4 r S 1 2 S 0 2 2 0 r 0 r r 2 t t 2 r S 1 2 S 0 2 2 d t , ()
= 0 r r 2 t t 2 r S 1 2 S 0 2 2 d t , ()
(using Lemma 4.1) = 0 r r 2 t 2 2 r S 1 + S 0 2 t S 1 S 0 d t . ()
Therefore,
S 2 S 1 0 r r 2 t 2 2 r S 1 + S 0 2 t S 1 S 0 d t . ()
Furthermore, we take
K 3 = sup 0 t r 1 r 2 t 2 2 r = 1 2 . ()
Therefore,
S 2 S 1 0 r K × K × K t d t , (using Lemma 4.2) ()
K 3 r 2 1 . 2 . ()
By similar analysis, we have
S 3 S 2 K 5 r 3 3 ! , ()
and
S 4 S 3 K 7 r 4 4 ! . ()
In general, we have
S n S n 1 K 2 n 1 r n n ! . ()
Now,
S n + 1 S n = 0 r r log ( t ) 2 t 2 r ( 2 log ( r ) 1 ) 4 t 2 1 4 r N S n N S n 1 d t , ()
= 0 r r log ( t ) 2 r ( 2 log ( r ) 1 ) 4 t 2 4 r S n S n S n 1 S n 1 d t , ()
= r log ( t ) 2 r ( 2 log ( r ) 1 ) 4 t 2 4 r S n 2 S n 1 2 2 0 r 0 r r 2 t t 2 r S n 2 S n 1 2 2 d t , ()
= 0 r r 2 t t 2 r S n 2 S n 1 2 2 d t , ()
(using Lemma 4.1) = 0 r r 2 t 2 2 r S n + S n 1 2 t S n S n 1 d t . ()
Therefore, we have
S n S n 1 K 2 n + 1 r n + 1 ( n + 1 ) ! . ()
Now, we consider
S 0 + n = 1 K 2 n 1 r n n ! . ()
By using D'Alembert ratio test, we can easily conclude that the series (117) is convergent for all r . Hence, by Weierstrass's M test, we have the series S 0 + i = 0 S i + 1 S i is uniformly convergent. Since i = 0 y i is uniformly convergent and each y n ( r ) C 3 [ 0 , 1 ] , then the limit function y ( r ) is also in C 3 [ 0 , 1 ] . This completes the proof.

5 NUMERICAL OBSERVATION

In this section, we have placed numerical data corresponding to Equation (8). We also have verified our numerical observations with theoretical results, which was proven by Escudero et al.9 and Verma et al.10 Numerical data computed by the proposed technique is well matched with the numerical data which was placed in References 9-12.

Here, we define the maximum absolute residue error by | | E | | = max i = 0 , 1 , , 9 R ( r i ) , where r i = r 0 + i h , r 0 = 0 and h = 0 . 1 . The residue function of Equation (8) is given by
R ( r ) = 1 r r 1 r ( r ϕ ) 1 r ϕ ϕ λ . ()

5.1 Dirichlet boundary condition

Here, we consider the fourth order SBVP (8) corresponding to Dirichlet boundary condition defined by (9). By using (40)–(43), we have
y 0 ( r ) = a r , ()
y 1 ( r ) = 1 16 r 3 a 2 + λ , ()
y 2 ( r ) = 1 384 a r 5 a 2 + λ , ()
y 3 ( r ) = r 7 a 2 + λ 7 a 2 + 3 λ 73728 , ()
y 4 ( r ) = a r 9 a 2 + λ 19 a 2 + 15 λ 5898240 , , ()
and so on. The approximate numerical solution are given by y ( r ) = i = 0 N y i ( r ) , where N is a natural number chosen to get suitable accuracy. We determine the constant value a by using the boundary condition y ( 1 ) = 0 . Again, by using ϕ = y and boundary condition ϕ ( 1 ) = 0 , we can have the numerical approximation ϕ ( r ) of (8). In the below we describe two cases:

Case (a): Here, we see that two numerical solutions exits for λ = 0 . One solution is trivial and other is non-trivial. Moreover, we also get non-trivial dual solutions for 0 < λ λ 0 . The value of λ 0 approximated to be 168.76. In Table 1 and Figure 1 we have placed maximum absolute residual error | | E | | and graphs corresponding to lower and upper solution for some positive λ .

TABLE 1. Approximate upper solution and lower solution maximum absolute residual error corresponding to some positive λ
λ | | E | | λ | | E | |
0 9 . 88 × 1 0 2 0 0
120 2 . 78 × 1 0 2 120 1 . 17 × 1 0 13
168.76 5 . 73 × 1 0 10 168.76 1 . 01 × 1 0 10
Details are in the caption following the image
Approximate solutions ϕ ( r ) corresponding to ( 1 ) λ = 0 , ( 2 ) λ = 120 , ( 3 ) λ = 168 . 76

Case (b): For λ < 0 , we always get non-trivial dual solutions. One is called positive solution and other is called negative solution. We could not find any negative critical value λ . We see that solutions are moved apart from each other for decreasing the negative value of the parameter. In Table 2 and Figure 2, we have presented the numerical data of approximate solutions.

TABLE 2. Approximate negative solution and positive solution maximum absolute residual error corresponding to some negative λ
λ | | E | | λ | | E | |
20 1 . 30 × 1 0 15 20 1 . 09 × 1 0 1
60 1 . 37 × 1 0 14 60 1 . 31 × 1 0 1
100 2 . 39 × 1 0 14 100 1 . 52 × 1 0 1
Details are in the caption following the image
Approximate solutions ϕ ( r ) corresponding to ( 1 ) λ = 20 , ( 2 ) λ = 60 and ( 3 ) λ = 100

5.2 Navier boundary condition of type one

In this case, we consider the boundary conditions (10). The approximate solutions are given by y ( r ) = i = 0 N y i , where the iterations y i ( r ) are same as in example 5.1 and N is the natural number can be chosen to get the better accuracy. Here, we also determine the value of the constant a by using the boundary conditions y ( 1 ) + y ( 1 ) = 0 . Same remarks can be made as in example 5.1, except the critical value of λ . The critical value of λ can be approximated to be 31.94. Corresponding to some λ , we have listed the numerical data of the approximate solutions in Tables 3 and 4, Figures 3 and  4.

TABLE 3. Approximate lower solution and upper solution maximum absolute residual error corresponding to some positive λ
λ | | E | | λ | | E | |
0 0 0 7 . 95 × 1 0 13
20 6 . 55 × 1 0 15 20 2 . 55 × 1 0 13
31.94 1 . 06 × 1 0 14 31.94 5 . 15 × 1 0 14
TABLE 4. Approximate positive solution and negative solution maximum absolute residual error corresponding to some negative λ
λ | | E | | λ | | E | |
100 4 . 94 × 1 0 4 100 5 . 32 × 1 0 15
300 2 . 15 × 1 0 3 300 7 . 10 × 1 0 14
500 3 . 43 × 1 0 3 500 3 . 19 × 1 0 14
Details are in the caption following the image
Approximate solutions ϕ ( r ) corresponding to ( 1 ) λ = 0 , ( 2 ) λ = 20 , ( 3 ) λ = 31 . 94
Details are in the caption following the image
Approximate solutions ϕ ( r ) corresponding to ( 1 ) λ = 100 , ( 2 ) λ = 300 , ( 3 ) λ = 500

5.3 Navier boundary condition of type two

Approximate solutions are given by y ( r ) = i = 0 N y i ( r ) , where N is natural number can be chosen to get the desired accuracy. We get the similar values of y i ( r ) as in example 5.1. The value of the constant a and the solutions ϕ ( r ) are computed by using the boundary conditions y ( 1 ) = 0 , ϕ ( r ) = y , and ϕ ( 1 ) = 0 respectively. Analogous remarks can be made as in example 5.1. Corresponding to this boundary condition The critical value of λ 0 can be approximated numerically to be 11.34. Maximum absolute residue error and approximate solutions are listed in Tables 5 and 6, Figures 5 and 6.

TABLE 5. Approximate lower solution and upper solution maximum absolute residual error corresponding to some positive λ
λ | | E | | λ | | E | |
0 0 0 1 . 24 × 1 0 14
7 5 . 27 × 1 0 16 7 9 . 32 × 1 0 15
11.34 1 . 11 × 1 0 15 11.34 1 . 77 × 1 0 15
TABLE 6. Approximate negative solution and positive solution maximum residual error of some negative λ
λ | | E | | λ | | E | |
100 1 . 95 × 1 0 14 100 2 . 97 × 1 0 12
300 1 . 42 × 1 0 14 300 8 . 34 × 1 0 4
500 1 . 98 × 1 0 13 500 1 . 68 × 1 0 3
Details are in the caption following the image
Approximate solutions ϕ ( r ) corresponding to ( 1 ) λ = 0 , ( 2 ) λ = 7 , ( 3 ) λ = 11 . 34
Details are in the caption following the image
Approximate solutions ϕ ( r ) for ( 1 ) λ = 100 , ( 2 ) λ = 300 , ( 3 ) λ = 500

6 CONCLUSION

We successfully applied this proposed technique on a third order non self adjoint 8(p. 58) SBVP. Many authors20, 33, 34 have studied the convergence criteria by using Cauchy sequence. But, we proposed a new idea to prove the convergence analysis. We noticed that, our numerical results are very interesting. We conclude that, for each < λ λ 0 , we always found two approximate solutions which are very close to their exact solutions. From residue table, we conclude that the approximate solutions converge very quickly to its exact solutions except positive solutions. The positive solutions converge to the exact positive solutions very slowly.

ACKNOWLEDGMENT

This work is supported by grant provided by DST project, file name: SB/S4/MS/805/12 and INSPIRE Program Division, file no. IF160984, Department of Science Technology, New Delhi, India-110016.

    CONFLICT OF INTEREST

    The authors declared no potential conflicts of interest with respect to the research, authorship, and publication of this article.

    Biographies

    • Biswajit Pandit received his M.Sc. degree in mathematics and computing from IIT Guwahati, India, in 2016. He is currently a DST Inspire senior research fellow in the department of mathematics at IIT Patna. His research area of interest includes numerical analysis, epitaxial growth, monotone iterative technique, wavelets, ordinary, and partial differential equations.

    • Amit Kumar Verma earned his Ph.D. degree in Mathematics from IIT Kharagpur, India. He is currently working as an assistant professor in the department of mathematics at IIT Patna. His research area of interest includes numerical analysis, epitaxial growth, non-standard finite difference methods, monotone iterative technique, wavelets, integral transforms, ordinary, and partial differential equations.

    • Ravi P. Agarwal earned his Ph.D. (Mathematics) at the Indian Institute of Technology in Madras, India, one of the highest-ranking institutes of India. Currently, he is affiliated with the Department of Mathematics, Texas A&M University-Kingsville. Dr. Agarwal has been actively involved in research as well as pedagogical activities for the last 49 years. His major research interests include numerical analysis, differential and difference equations, inequalities, and fixed point theorems. He is an excellent scholar, dedicated teacher, and prolific researcher. He has published 45 research monographs and more than 1700 publications in prestigious national and international mathematics journals.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.