7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
View/Download PDF

Translate this page into:

Original article
31 (
4
); 737-745
doi:
10.1016/j.jksus.2018.06.004

Approximations for higher order boundary value problems using non-polynomial quadratic spline based on off-step points

Department of Mathematics, Jamia Millia Islamia, New Delhi 110025, India

⁎Corresponding author. akhan2@jmi.ac.in (Arshad Khan)

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Peer review under responsibility of King Saud University.

Abstract

Non-polynomial quadratic spline method based on off-step points is used to develop a numerical algorithm for obtaining an approximate solution of higher even order boundary value problems. For the employment of the method, decomposition procedure is used. Higher order boundary value problems are reduced into the corresponding system of second order boundary value problems. Convergence analysis of the method is also discussed. Seven numerical examples are given to illustrate the applicability and efficiency of new method. It is also shown that the new method gives approximations, which are better than those produced by other existing fourth order methods except higher degree splines.

Keywords

Higher order
Singular
Non-linear
Second order
Non-polynomial quadratic spline
Off-step points
Convergence analysis
1

1 Introduction

The higher order boundary value problems have been studied as their mathematical applications are in diversified applied sciences. Conditions for the existence and uniqueness of solutions of the higher-order boundary-value problems was discussed in Agarwal (1986, pp. 89–93). Several numerical algorithms have been developed to determine the approximate solution of higher-order boundary-value problems. In this paper, we consider the higher order boundary value problems of the form

(1)
y ( 2 N ) = f ( x , y , y ( 1 ) , y ( 2 ) , y ( 3 ) , y ( 2 N - 1 ) ) , a x b , where N = 2 , 3 , 4 subject to the boundary conditions
(2)
y ( a ) = λ 1 , y ( 2 ) ( a ) = λ 2 , , y ( 2 N - 2 ) ( a ) = λ N , y ( b ) = δ 1 , y ( 2 ) ( b ) = δ 2 , , y ( 2 N - 2 ) ( b ) = δ N .
We rewrite the Eq. (1) and (2) as system of second order boundary value problems:
(3)
y i ( 2 ) ( x ) = F i ( x , y 1 , y 2 , , y i , , y N , y 1 ( 1 ) , y 2 ( 1 ) , , y i ( 1 ) , , y N ( 1 ) ) , i = 1 , 2 , , N
subject to the modified boundary conditions;
(4)
y i ( a ) = λ i , y i ( b ) = δ i , i = 1 , 2 , , N .
We assume that, for a < x < b , for m = 1 , 2 , , N , i = 1 , 2 , , N and - < y m < y m ( 1 ) < :
  1. F i is continous,

  2. F i y m and F i y m ( 1 ) exist and are continous,

  3. F i y m > 0 and | F i y m | C , for some constant C.

These conditions from Keller (1968, (pp. 6–8 and 15–16)) ensure the existence and uniqueness of the solution of the above boundary value problem (3) and (4).

Here, our aim is to solve the boundary value problems of fourth, sixth and eighth orders of the form (1) and (2) with N = 2 , 3 and 4. There are various methods available in literature for solving these boundary value problems. For example, non-polynomial spline technique was used by Siddiqi and Akram (2007) to determine the solution of eighth-order and Akram and Siddiqi (2006) to determine the solution of sixth order boundary value problems. Meŝtroviĉ (2007) used modified decomposition method for the solution of eighth-order boundary value problems. Islam et al. (2008) used non-polynomial splines approach to the solution of sixth-order non-linear boundary value problems of the form (1) and (2). Solution of special sixth order boundary-value problems was given by Boutayeb and Twizell (1992). Khan and Khandelwal (2012) used parametric septic splines and Jalilian and Rashidinia (2010) used nonic-spline for the solution of non-linear sixth-order two point boundary value problems.

The above system involves the second order boundary value problems. Polynomial and non-polynomial spline approach (Ramadan et al., 2007), quintic non-polynomial spline method (Srivastava et al., 2011), cubic spline method (Al-Said, 2001), non-polynomial spline (Jha and Mohanty, 2011; Mohanty et al., 2017), spline in tension (Mohanty et al., 2005), spline in compression (Mohanty et al., 2004) were used in previous papers to solve second order boundary value problems. Here, we use lower degree non-polynomial quadratic spline for solving system of second order boundary value problems. This non-polynomial quadratic spline is based on off-step points.

When linear BVPs are implemented over the method, we get a linear system of equations which are solved by using LU decomposition method and when non-linear BVPs are implemented we get a non-linear system which is solved by Block Newton Raphson method. The outline of this paper is organised into five sections. In Section 2, consistency relation and in Section 2.1 truncation error and end equations are discussed. In Section 3, application of the method to solve the sixth order BVPs is given. Section 4 gives the convergence analysis of the method. In Section 5, seven examples are considered to illustrate the accuracy and performance of the method presented in the paper.

2

2 Non-polynomial quadratic spline function

To develop the new method based on off-step points, we divide the interval [ a , b ] into n + 1 subintervals, s.t. a = x 0 < x 1 / 2 < x 3 / 2 < < x n - 1 / 2 < x n = b . We introduce a finite set of grid points x i as x i = a + ( i - 1 / 2 ) h , i = 0 , 1 , , n and h = ( b - a ) / n .

Let

(5)
P i ( x ) = a i cos k ( x - x i ) + b i e k ( x - x i ) + c i be a non-polynomial quadratic spline P i is defined on [a, b] which interpolates the uniform mesh points x i depends on a parameter k, reduces to an ordinary quadratic spline in [a,b] as k 0 and k > 0 .

To determine the coefficients a i , b i and c i , we define the following interpolatory conditions as

(6)
P i ( x i + 1 / 2 ) = y i + 1 / 2 , P i ( 1 ) ( x i ) = Q i , P i ( 2 ) ( x i + 1 / 2 ) = R i + 1 / 2 , i = 0 , 1 , , n By using the conditions (6) we calculated the coefficients as a i = - 1 k 2 R i + 1 / 2 sec θ 2 + 1 k Q i e θ 2 sec θ 2 b i = 1 k Q i c i = y i + 1 / 2 + 1 k 2 R i + 1 / 2 - 2 k Q i e θ 2 where, θ = kh .

Using the continuity of first derivative, P i - 1 ( m ) ( x i ) = P i ( m ) ( x i ) , m = 0 , 1 the following consistency relation is derived

(7)
α 1 y i - 3 / 2 + β 1 y i - 1 / 2 + γ 1 y i + 1 / 2 = h 2 ( α 2 R i - 3 / 2 + β 2 R i - 1 / 2 + γ 2 R i + 1 / 2 ) , i = 2 , 3 , , n - 1 where, α 2 = 1 θ 2 e 2 θ + ( e θ 2 - e θ ) sin θ sec θ 2 + e 3 θ 2 ( 1 + cos θ csc θ ) - e θ cos θ sec θ 2 e θ 2 sin θ sec θ 2 β 2 = 1 θ 2 - 1 + e θ + e 2 θ + e θ sec θ 2 - e 3 θ 2 csc θ - e θ 2 sin θ sec θ 2 + cos θ sec θ 2 + sin θ sec θ 2 - e θ 2 - e θ 2 cos θ csc θ e θ 2 sin θ sec θ 2 γ 2 = 1 θ 2 - e θ - e θ 2 sin θ sec 2 θ 2 + e θ 2 sin θ sec θ 2 + e θ sec θ 2 γ 1 = - e θ + e θ 2 sin θ sec θ 2 α 1 = [ γ 1 ] 2 β 1 = γ 1 - [ γ 1 ] 2 .
Remark 1

Our method reduces to Ramadan et al. (2007) based on quadratic spline when

(8)
( α 1 , β 1 , γ 1 , α 2 , β 2 , γ 2 , ) = ( 1 , - 2 , 1 , 1 8 , 6 8 , 1 8 ) .

2.1

2.1 Truncation error

Expanding the scheme (7) by using Taylor series, we obtained the following truncation error

(9)
t i = [ α 1 + β 1 + γ 1 ] y i + - 3 α 1 - β 1 + γ 1 2 hy i ( 1 ) + h 2 9 α 1 + β 1 + γ 1 2 2 2 ! - ( α 2 + β 2 + γ 2 ) y i ( 2 ) + h 3 - 27 α 1 - β 1 + γ 1 2 3 3 ! - - 3 α 2 - β 2 + γ 2 2 y i ( 3 ) + h 4 81 α 1 + β 1 + γ 1 2 4 4 ! - 9 α 2 + β 2 + γ 2 2 2 2 ! y i ( 4 ) + h 5 - 243 α 1 - β 1 + γ 1 2 5 5 ! - - 27 α 2 - β 2 + γ 2 2 3 3 ! y i ( 5 ) + h 6 729 α 1 + β 1 + γ 1 2 6 6 ! - 81 α 2 + β 2 + γ 2 2 4 4 ! y i ( 6 ) + O ( h 7 ) , i = 2 , 3 , , n - 1 .

For different values of parameters, we get the second as well as fourth order method. For α 2 + β 2 + γ 2 = 1 and α 2 = γ 2 we get the second order method. For the choice of parameters ( α 1 , β 1 , γ 1 , α 2 , β 2 , γ 2 ) = ( 1 , - 2 , 1 , 1 / 12 , 10 / 12 , 1 / 12 ) we get the fourth order method.

Eq. (7) forms a system of ( n - 2 ) linear equations in n unknowns y i - 1 / 2 , i = 1 , 2 , , n . Thus, we need two more equations, one at each end of range of integration. These boundary conditions are obtained by using method of undetermined coefficients.

The equations for second order method are given by Islam et al. (2006) as

(10)
2 y 0 - 3 y 1 / 2 + y 3 / 2 = h 2 24 [ 15 R 1 / 2 + 3 R 3 / 2 ] + O ( h 4 ) , i = 1
(11)
2 y n - 3 y n - 1 / 2 + y n - 3 / 2 = h 2 24 [ 15 R n - 1 / 2 + 3 R n - 3 / 2 ] + O ( h 4 ) , i = n

The truncation error for second order method for ( α 1 , β 1 , γ 1 , α 2 , β 2 , γ 2 ) = ( 1 , - 2 , 1 , 1 / 8 , 6 / 8 , 1 / 8 ) is given as follows: t i = - 1 64 h 4 y 0 ( 4 ) + O ( h 5 ) , i = 1 - 1 24 h 4 y i ( 4 ) + O ( h 5 ) , i = 2 , 3 , , n - 1 - 1 64 h 4 y n ( 4 ) + O ( h 5 ) , i = n and for fourth order method are obtained as

(12)
2 y 0 - 3 y 1 / 2 + y 3 / 2 = h 2 384 [ 233 R 1 / 2 + 63 R 3 / 2 - 9 R 5 / 2 + R 7 / 2 ] + O ( h 6 ) , i = 1
(13)
2 y n - 3 y n - 1 / 2 + y n - 3 / 2 = h 2 384 [ 233 R n - 1 / 2 + 63 R n - 3 / 2 - 9 R n - 5 / 2 + R n - 7 / 2 ] + O ( h 6 ) , i = n .

The truncation error for the fourth order method is given as follows: t i = 11 7680 h 6 y 0 ( 6 ) + O ( h 7 ) , i = 1 - 1 240 h 6 y i ( 6 ) + O ( h 7 ) , i = 2 , 3 , , n - 1 11 7680 h 6 y n ( 6 ) + O ( h 7 ) , i = n .

3

3 Application of the algorithm to the higher order boundary value problems for N = 3

We consider a sixth order boundary value problem i.e N = 3 in (1–2) of the form

(14)
y ( 6 ) ( x ) = a ( x ) y ( 5 ) ( x ) + b ( x ) y ( 4 ) ( x ) + c ( x ) y ( 3 ) ( x ) + d ( x ) y ( 2 ) ( x ) + e ( x ) y ( 1 ) ( x ) + f ( x ) y ( x ) + g ( x ) subject to boundary conditions y ( a ) = λ 1 , y ( 2 ) ( a ) = λ 2 , y ( 4 ) ( a ) = λ 3 y ( b ) = δ 1 , y ( 2 ) ( b ) = δ 2 , y ( 4 ) ( b ) = δ 3 where λ i and δ i ( i = 1 , 2 , 3 ) are finite real constants and the functions a ( x ) , b ( x ) , c ( x ) , d ( x ) , e ( x ) , f ( x ) and g ( x ) are continuous on [ a , b ] . We decompose the above problem into the system of second order boundary value problems as follows:
(15)
y ( 2 ) ( x ) = u ( x ) ,
(16)
u ( 2 ) ( x ) = v ( x ) ,
(17)
v ( 2 ) ( x ) = a ( x ) v ( 1 ) ( x ) + b ( x ) v ( x ) + c ( x ) u ( 1 ) ( x ) + d ( x ) u ( x ) + e ( x ) y ( 1 ) ( x ) + f ( x ) y ( x ) + g ( x ) . F ( x , y , u , v , y ( 1 ) , u ( 1 ) , v ( 1 ) )
subject to modified boundary conditions
(18)
y ( a ) = λ 1 , y ( b ) = δ 1 ,
(19)
u ( a ) = λ 2 , u ( b ) = δ 2 ,
(20)
v ( a ) = λ 3 , v ( b ) = δ 3 .

Therefore by implementing the scheme (7) on the boundary value problems (15)–(17), we get the following system of equations

(21)
α 1 y i - 3 / 2 + β 1 y i - 1 / 2 + γ 1 y i + 1 / 2 = h 2 ( α 2 u i - 3 / 2 + β 2 u i - 1 / 2 + γ 2 u i + 1 / 2 ) , i = 2 , 3 , , n - 1
(22)
α 1 u i - 3 / 2 + β 1 u i - 1 / 2 + γ 1 u i + 1 / 2 = h 2 ( α 2 v i - 3 / 2 + β 2 v i - 1 / 2 + γ 2 v i + 1 / 2 ) , i = 2 , 3 , , n - 1
(23)
α 1 v i - 3 / 2 + β 1 v i - 1 / 2 + γ 1 v i + 1 / 2 = h 2 ( α 2 F i - 3 / 2 + β 2 F i - 1 / 2 + γ 2 F i + 1 / 2 ) , i = 2 , 3 , , n - 1

The fourth order method is obtained by using the parameters ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 in the scheme (21)–(23) and replacing (23) by the following as: α 1 v i - 3 / 2 + β 1 v i - 1 / 2 + γ 1 v i + 1 / 2 = h 2 1 12 F i - 3 / 2 + 10 12 F i - 1 / 2 + 1 12 F i + 1 / 2 , i = 2 , 3 , , n - 1 where, F i - 3 / 2 = F x , y i - 3 / 2 , u i - 3 / 2 , v i - 3 / 2 , y i - 3 / 2 , u i - 3 / 2 , v i - 3 / 2 , F i - 1 / 2 = F x , y i - 1 / 2 , u i - 1 / 2 , v i - 1 / 2 , y i - 1 / 2 , u i - 1 / 2 , v i - 1 / 2 , F i + 1 / 2 = F x , y i + 1 / 2 , u i + 1 / 2 , v i + 1 / 2 , y i + 1 / 2 , u i + 1 / 2 , v i + 1 / 2 , F i - 1 / 2 = F x , y i - 1 / 2 , u i - 1 / 2 , v i - 1 / 2 , y ̃ i - 1 / 2 , u ̃ i - 1 / 2 , v ̃ i - 1 / 2 , and the finite difference approximations to derivatives are y i - 1 / 2 = y i + 1 / 2 - y i - 3 / 2 2 h , y i - 3 / 2 = - 3 y i - 3 / 2 + 4 y i - 1 / 2 - y i + 1 / 2 2 h , y i + 1 / 2 = y i - 3 / 2 - 4 y i - 1 / 2 + 3 y i + 1 / 2 2 h , y ̃ i - 1 / 2 = y i + 1 / 2 - y i - 3 / 2 2 h - h 20 ( R i + 1 / 2 - R i - 3 / 2 ) . The fourth order approximations of derivatives involved in the end Eqs. (12) and (13) are as follows: hy 1 / 2 ( 1 ) = - 32 35 y 0 + 1 6 y 1 / 2 + y 3 / 2 - 3 10 y 5 / 2 + 1 21 y 7 / 2 hy 3 / 2 ( 1 ) = 32 105 y 0 - y 1 / 2 + 1 6 y 3 / 2 + 3 5 y 5 / 2 - 1 14 y 7 / 2 hy 5 / 2 ( 1 ) = - 32 105 y 0 + 5 6 y 1 / 2 - 5 3 y 3 / 2 + 9 10 y 5 / 2 + 5 21 y 7 / 2 hy 7 / 2 ( 1 ) = 32 35 y 0 - 7 3 y 1 / 2 + 7 2 y 3 / 2 - 21 5 y 5 / 2 + 89 42 y 7 / 2 . Here, we derive only the second order method. On combining (21)–(23), we obtain the vector difference equation for the boundary value problem (15)–(17) as

(24)
A i W i - 3 / 2 + B i W i - 1 / 2 + C i W i + 1 / 2 = H i which are as follows: ai 11 ai 12 ai 13 ai 21 ai 22 ai 23 ai 31 ai 32 ai 33 y i - 3 / 2 u i - 3 / 2 v i - 3 / 2 + bi 11 bi 12 bi 13 bi 21 bi 22 bi 23 bi 31 bi 32 bi 33 y i - 1 / 2 u i - 1 / 2 v i - 1 / 2 + ci 11 ci 12 ci 13 ci 21 ci 22 ci 23 ci 31 ci 32 ci 33 y i + 1 / 2 u i + 1 / 2 v i + 1 / 2 = h i 1 h i 2 h i 3 , i = 2 , 3 , , n - 1 where, ai 11 = - α 1 , ai 12 = h 2 α 2 , ai 13 = 0 , ai 21 = 0 , ai 22 = - α 1 , ai 23 = h 2 α 2 , ai 31 = - 3 h 2 α 2 e i - 3 / 2 + h 2 α 2 f i - 3 / 2 - h 2 β 2 e i - 1 / 2 + h 2 γ 2 e i + 1 / 2 , ai 32 = - 3 h 2 α 2 c i - 3 / 2 + h 2 α 2 d i - 3 / 2 - h 2 β 2 c i - 1 / 2 + h 2 γ 2 c i + 1 / 2 , ai 33 = - α 1 - 3 h 2 α 2 a i - 3 / 2 + h 2 α 2 b i - 3 / 2 - h 2 β 2 a i - 1 / 2 + h 2 γ 2 a i + 1 / 2 , bi 11 = - β 1 , bi 12 = h 2 β 2 , bi 13 = 0 , bi 21 = 0 , bi 22 = - β 1 , bi 23 = h 2 β 2 , bi 31 = 2 h α 2 e i - 3 / 2 + h 2 β 2 f i - 1 / 2 - 2 h γ 2 e i + 1 / 2 , bi 32 = 2 h α 2 c i - 3 / 2 + h 2 β 2 d i - 1 / 2 - 2 h γ 2 c i + 1 / 2 , bi 33 = - β 1 + 2 h α 2 a i - 3 / 2 + h 2 β 2 b i - 1 / 2 - 2 h γ 2 a i + 1 / 2 , ci 11 = - γ 1 , ci 12 = h 2 γ 2 , ci 13 = 0 , ci 21 = 0 , ci 22 = - γ 1 , ci 23 = h 2 γ 2 , ci 31 = - 1 2 h α 2 e i - 3 / 2 + 1 2 h β 2 e i - 1 / 2 + 3 2 h γ 2 e i + 1 / 2 + h 2 γ 2 f i + 1 / 2 , ci 32 = - 1 2 h α 2 c i - 3 / 2 + 1 2 h β 2 c i - 1 / 2 + 3 2 h γ 2 c i + 1 / 2 + h 2 γ 2 d i + 1 / 2 , ci 33 = - γ 1 - 1 2 h α 2 a i - 3 / 2 + 1 2 h β 2 a i - 1 / 2 + 3 2 h γ 2 a i + 1 / 2 + h 2 γ 2 b i + 1 / 2 , h i 1 = 0 , h i 2 = 0 , h i 3 = - h 2 ( α 2 g i - 3 / 2 + β 2 g i - 1 / 2 + γ 2 g i + 1 / 2 ) , i = 2 , 3 , , n - 1 . Now for i = 1, we have
(25)
B 1 W 1 / 2 + C 1 W 3 / 2 = H 1
which can be written as b 1 11 b 1 12 b 1 13 b 1 21 b 1 22 b 1 23 b 1 31 b 1 32 b 1 33 y 1 / 2 u 1 / 2 v 1 / 2 + c 1 11 c 1 12 c 1 13 c 1 21 c 1 22 c 1 23 c 1 31 c 1 32 c 1 33 y 3 / 2 u 3 / 2 v 3 / 2 = h 11 h 12 h 13 where, b 1 11 = 3 , b 1 12 = 15 h 2 24 , b 1 13 = 0 , b 1 21 = 0 , b 1 22 = 3 , b 1 23 = 15 h 2 24 , b 1 31 = - 15 24 he 1 / 2 + 15 24 h 2 f 1 / 2 - 3 24 he 3 / 2 , b 1 32 = - 15 24 hc 1 / 2 + 15 24 h 2 d 1 / 2 - 3 24 hc 3 / 2 , b 1 33 = 3 - 15 24 ha 1 / 2 + 15 24 h 2 b 1 / 2 - 3 24 ha 3 / 2 , c 1 11 = - 1 , c 1 12 = 3 h 2 24 , c 1 13 = 0 , c 1 21 = 0 , c 1 22 = - 1 , c 1 23 = 3 h 2 24 , c 1 31 = 15 24 he 1 / 2 + 3 24 he 3 / 2 + 3 24 h 2 f 3 / 2 , c 1 32 = 15 24 hc 1 / 2 + 3 24 hc 3 / 2 + 3 24 h 2 d 3 / 2 , c 1 33 = - 1 + 15 24 ha 1 / 2 + 3 24 ha 3 / 2 + 3 24 h 2 b 3 / 2 , h 11 = 2 y 0 , h 12 = 2 u 0 , h 13 = 2 v 0 - h 2 24 ( 15 g 1 / 2 + 3 g 3 / 2 ) . Now for i = n, we have
(26)
A n W n - 3 / 2 + B n W n - 1 / 2 = H n
which can be written as an 11 an 12 an 13 an 21 an 22 an 23 an 31 an 32 an 33 y n - 3 / 2 u n - 3 / 2 v n - 3 / 2 + bn 11 bn 12 bn 13 bn 21 bn 22 bn 23 bn 31 bn 32 bn 33 y n - 1 / 2 u n - 1 / 2 v n - 1 / 2 = h n 1 h n 2 h n 3 where, an 11 = 3 , an 12 = 15 h 2 24 , an 13 = 0 , an 21 = 0 , an 22 = 3 , an 23 = 15 h 2 24 , an 31 = - 15 24 he n - 1 / 2 + 15 24 h 2 f n - 1 / 2 - 3 24 he n - 3 / 2 , an 32 = - 15 24 hc n - 1 / 2 + 15 24 h 2 d n - 1 / 2 - 3 24 hc n - 3 / 2 , an 33 = 3 - 15 24 ha n - 1 / 2 + 15 24 h 2 b n - 1 / 2 - 3 24 ha n - 3 / 2 bn 11 = - 1 , bn 12 = 3 h 2 24 , bn 13 = 0 , bn 21 = 0 , bn 22 = - 1 , bn 23 = 3 h 2 24 , bn 31 = 15 24 he n - 1 / 2 + 3 24 he n - 3 / 2 + 3 24 h 2 f n - 3 / 2 , bn 32 = 15 24 hc n - 1 / 2 + 3 24 hc n - 3 / 2 + 3 24 h 2 d n - 3 / 2 , bn 33 = - 1 + 15 24 ha n - 1 / 2 + 3 24 ha n - 3 / 2 + 3 24 h 2 b n - 3 / 2 , h n 1 = 2 y n , h n 2 = 2 u n , h n 3 = 2 v n - h 2 24 ( 15 g n - 1 / 2 + 3 g n - 3 / 2 ) .

4

4 Convergence analysis

In this section, we study the convergence analysis of the second order method developed in Section 2 where ( α 1 , β 1 , γ 1 , α 2 , β 2 , γ 2 ) = ( 1 , - 2 , 1 , 1 / 8 , 6 / 8 , 1 / 8 ) . The method has the following form

(27)
AW = M where,
(28)
A = B 1 C 1 A 2 B 2 C 2 A n - 1 B n - 1 C n - 1 A n B n
where, A is a triblockdiagonal matrix in which A i ( i = 2 , 3 , , n ) , B i ( i = 1 , 2 , , n ) and C i ( i = 2 , 3 , , n - 1 ) are matrices of order 2 × 2 , W = [ w 1 / 2 , w 3 / 2 , , w n - 1 / 2 ] T where, w i - 1 / 2 = [ y i - 1 / 2 , u i - 1 / 2 , v i - 1 / 2 ] T , i = 1 , 2 , , n and the right hand side vector M = [ m 1 , m 2 , , m n ] T , where m i = [ m i 1 , m i 2 ] T , i = 1 , 2 , , n .

We also have,

(29)
A W ̃ = M + T where W = [ w ̃ 1 / 2 , w ̃ 3 / 2 , , w ̃ n - 1 / 2 ] T where, w ̃ i - 1 / 2 = [ y ̃ i - 1 / 2 , u ̃ i - 1 / 2 , v ̃ i - 1 / 2 ] T , i = 1 , 2 , , n be the exact solution and T = [ t 1 , t 2 , , t n ] T where, t i = [ y ̃ i - 1 / 2 - y i - 1 / 2 , u ̃ i - 1 / 2 - u i - 1 / 2 , v ̃ i - 1 / 2 - v i - 1 / 2 ] T , i = 1 , 2 , , n be the local truncation error.  From (27) and (29) we have, A ( W - W ) = T , AE = T , E = W - W = [ e ̃ 1 , e ̃ 2 , , e ̃ n - 1 ] T Let 0 < R Z + is the minimum of | a i | , | b i | , | c i | , | d i | , | e i | and | f i | .

Then C i max 1 i n - 1 1 + γ 1 + h 2 γ 2 + 3 24 , j = 1 1 + γ 1 + h 2 γ 2 + 3 24 , j = 2 1 + γ 1 + 1 2 h α 2 + β 2 + 3 γ 2 R + h 2 γ 2 R + 18 24 hR + 3 24 h 2 R , j = 3 A i max 2 i n 3 + α 1 + h 2 α 2 + 15 24 , j = 1 3 + α 1 + h 2 α 2 + 15 24 , j = 2 3 + α 1 + 1 2 h 3 α 2 + β 2 + γ 2 R + h 2 α 2 R + 18 24 hR + 15 24 h 2 R , j = 3 Further, C i max 1 i n - 1 2 + 1 4 h 2 , j = 1 2 + 1 4 h 2 , j = 2 2 + 11 8 hR + 1 4 h 2 R , j = 3 A i max 2 i n 4 + 1 2 h 2 , j = 1 4 + 1 2 h 2 , j = 2 4 + 11 8 hR + 1 2 h 2 R , j = 3 This shows that C i 2 and A i 4 for sufficiently small h. Hence, A is irreducible. Now we have to show that A is monotone.

To show matrix A is monotone first we calculate the sum of each row of the matrix A. S 1 j = k = 1 3 a 1 1 k + b 1 1 k , j = 1 k = 1 3 a 1 2 k + b 1 2 k , j = 2 k = 1 3 a 1 3 k + b 1 3 k , j = 3 S ij = k = 1 3 ai 1 k + bi 1 k + ci 1 k , j = 1 , i = 1 , 4 , 7 , , n - 3 k = 1 3 ai 2 k + bi 2 k + ci 2 k , j = 2 , i = 2 , 5 , 8 , , n - 2 k = 1 3 ai 3 k + bi 3 k + ci 3 k , j = 3 , i = 3 , 6 , 9 , , n - 1 S n j = k = 1 3 an 1 k + bn 1 k , j = 1 k = 1 3 an 2 k + bn 2 k , j = 2 k = 1 3 an 3 k + bn 3 k , j = 3 We have S 1 j = 2 + 18 24 h 2 , j = 1 2 + 18 24 h 2 , j = 2 2 + 15 24 h 2 ( f 1 / 2 + d 1 / 2 + b 1 / 2 ) - 3 24 h 2 ( f 3 / 2 + d 3 / 2 + b 3 / 2 ) , j = 3 S ij = - ( α 1 + β 1 + γ 1 ) + 2 h 2 ( α 2 + β 2 + γ 2 ) , i = 1 , 4 , 7 , , n - 3 , j = 1 - ( α 1 + β 1 + γ 1 ) + 2 h 2 ( α 2 + β 2 + γ 2 ) , i = 2 , 5 , 8 , , n - 2 , j = 2 - ( α 1 + β 1 + γ 1 ) + h 2 α 2 ( f i - 3 / 2 + d i - 3 / 2 + b i - 3 / 2 ) + h 2 β 2 ( f i - 1 / 2 + d i - 1 / 2 + b i - 1 / 2 ) + h 2 γ 2 ( f i + 1 / 2 + d i + 1 / 2 + b i + 1 / 2 ) , i = 3 , 6 , 9 , , n - 1 , j = 3 = 2 h 2 , i = 1 , 4 , 7 , , n - 3 , j = 1 2 h 2 , i = 2 , 5 , 8 , , n - 2 , j = 2 1 8 h 2 ( f i - 3 / 2 + d i - 3 / 2 + b i - 3 / 2 ) + 6 8 h 2 ( f i - 1 / 2 + d i - 1 / 2 + b i - 1 / 2 ) + 1 8 h 2 ( f i + 1 / 2 + d i + 1 / 2 + b i + 1 / 2 ) , i = 3 , 6 , 9 , , n - 1 , j = 3 S n j = 2 + 18 24 h 2 , j = 1 2 + 18 24 h 2 , j = 2 2 + 15 24 h 2 ( f n - 1 / 2 + d n - 1 / 2 + b n - 1 / 2 ) - 3 24 h 2 ( f n - 3 / 2 + d n - 3 / 2 + b n - 3 / 2 ) , j = 3 For sufficiently small h, we can easily show that the matrix A is irreducible and monotone. Therefore, A - 1 exist and A - 1 0 .

Hence, E = A - 1 T . Now for sufficiently small h, we have S 1 j 18 24 h 2 , j = 1 18 24 h 2 , j = 2 18 24 h 2 R , j = 3 S ij h 2 , i = 1 , 4 , , n - 3 , j = 1 h 2 , i = 2 , 5 , , n - 2 , j = 2 h 2 R , i = 3 , 6 , , n - 1 , j = 3 S n j 18 24 h 2 , j = 1 18 24 h 2 , j = 2 18 24 h 2 R , j = 3 S 1 max [ 18 24 h 2 , 18 24 h 2 , 18 24 Rh 2 ] = 18 24 Rh 2 , i = 1 S i max [ h 2 , h 2 , Rh 2 ] = Rh 2 , i = 2 , , n - 1 S n max [ 18 24 h 2 , 18 24 h 2 , 18 24 Rh 2 ] = 18 24 Rh 2 , i = n Therefore, we get 1 S 1 24 18 Rh 2 , i = 1 1 S i 1 Rh 2 , i = 2 , 3 , , n - 1 1 S n 24 18 Rh 2 , i = n Further, 1 S i 24 18 h 2 R , i = 1 1 h 2 R , i = 2 , 3 , , n - 1 24 18 h 2 R , i = n Let A - 1 = ( a i , j ) , then by theory of matrices (Varga, 1962), we get

i = 1 n a i , j S i = 1 , j = 1 , , n .

Therefore, a i , j 1 S i A - 1 = max 1 i n j = 1 n | a i , j | i = 1 n 1 S i = 1 h 2 R 24 9 + 1 , i = 1 , , n and T i = max 1 i n i = 1 n | T i | The error is given by E = A - 1 T 1 h 2 R 33 9 T . Therefore, using (9) we get T = O ( h 4 ) for second order method. E 1 h 2 R 33 9 O ( h 4 ) = O ( h 2 ) . Hence, our method is second order convergent. By repeating the same procedure we can find the bound for error of fourth order method which is as follows: E = A - 1 T 1 h 2 R 33 9 T . Therefore, using (9) we get T = O ( h 6 ) for fourth order method. E 1 h 2 R 33 9 O ( h 6 ) = O ( h 4 ) . Hence, our method is also fourth order convergent.

Theorem

The method given by Eq. (7) for solving the boundary value problem (1), (2) for sufficiently small h has a second as well as fourth order convergence depending upon the parameters.

5

5 Numerical Illustrations

We now consider seven numerical examples involving higher order non-linear and linear boundary value problems along with two singular problems involving first and third derivatives illustrating the efficiency of the presented method. We compared the results with the existing methods of fourth order. We have also provided the numerical rate of convergence ( ρ n ) for the non-linear singular fourth order BVPs. The numerical rate of convergence is computed using ρ n = ln 2 ( E n / E 2 n ) The maximum absolute errors for h = 1/8, 1/16 and 1/32 are tabulated in the Tables 1–7.

Example 5.1

Consider the following fourth order non-linear boundary value problem for 0 x 4 - e as

(30)
y ( 4 ) ( x ) = - 6 exp ( - 4 y ( x ) ) , where, y ( 0 ) = 1 , y ( 4 - e ) = ln ( 4 ) , y ( 2 ) ( 0 ) = - 1 e 2 , y ( 2 ) ( 4 - e ) = - 1 16 . The exact solution of the problem is y ( x ) = ln ( e + x ) . The maximum absolute errors of the problem (30) are given in Table 1 and results are compared with (Wazwaz, 2002). Graph between the exact and the approximate solutions of Example 5.1 for N = 16 is shown in Fig. 1.

Example 5.2

Consider the following sixth order non-linear boundary value problem as

(31)
y ( 6 ) ( x ) = 20 exp [ - 36 y ( x ) ] - 40 ( 1 + x ) - 6 , x [ 0 , 1 ] where, y ( 0 ) = 0 , y ( 1 ) = 1 6 log 2 , y ( 2 ) ( 0 ) = - 1 6 , y ( 2 ) ( 1 ) = - 1 24 , y ( 4 ) ( 0 ) = - 1 , y ( 4 ) ( 1 ) = - 1 16 . The exact solution of the problem is y ( x ) = 1 6 log ( 1 + x ) . The maximum absolute errors of the problem (31) are given in Table 2 and results are compared with (Khan and Khandelwal, 2012; Islam et al., 2008). Graph between the exact and the approximate solutions of Example 5.2 for N = 32 is shown in Fig. 2.

Example 5.3

For 0 x 1 , the sixth order non-linear boundary value problem is considered as,

(32)
y ( 6 ) ( x ) = exp [ - x ] y 2 ( x ) , where, y ( 0 ) = 1 , y ( 1 ) = exp ( 1 ) , y ( 2 ) ( 0 ) = 1 , y ( 2 ) ( 1 ) = exp ( 1 ) , y ( 4 ) ( 0 ) = 1 , y ( 4 ) ( 1 ) = exp ( 1 ) . The analytical solution of the above problem is y ( x ) = exp ( x ) . The maximum absolute errors of the problem (32) are given in Table 3 and results are compared with (Khan and Khandelwal, 2012). Graph between the exact and the approximate solutions of Example 5.3 for N = 16 is shown in Fig. 3.

Example 5.4

For 0 x 1 , the eighth order non-linear boundary value problem is considered as,

(33)
y ( 8 ) ( x ) = exp [ - x ] y 2 ( x ) , where, y ( 0 ) = 1 , y ( 1 ) = exp ( 1 ) , y ( 2 ) ( 0 ) = 1 , y ( 2 ) ( 1 ) = exp ( 1 ) , y ( 4 ) ( 0 ) = 1 , y ( 4 ) ( 1 ) = exp ( 1 ) , y ( 6 ) ( 0 ) = 1 , y ( 6 ) ( 1 ) = exp ( 1 ) . The analytical solution of the above problem is y ( x ) = exp ( x ) . The maximum absolute errors of the problem (33) are given in Table 4 and results are compared with (Meŝtroviĉ, 2007). Graph between the exact and the approximate solutions of Example 5.4 for N = 32 is shown in Fig. 4.

Example 5.5

Consider the following sixth order linear boundary value problem as

(34)
y ( 6 ) ( x ) + y ( x ) = 6 [ 2 x cos ( x ) + 5 sin ( x ) ] , x [ - 1 , 1 ] where, y ( - 1 ) = 0 , y ( 1 ) = 0 , y ( 2 ) ( - 1 ) = - 4 cos ( - 1 ) + 2 sin ( - 1 ) , y ( 2 ) ( 1 ) = 4 cos ( 1 ) + 2 sin ( 1 ) , y ( 4 ) ( - 1 ) = 8 cos ( - 1 ) - 12 sin ( - 1 ) , y ( 4 ) ( 1 ) = - 8 cos ( 1 ) - 12 sin ( 1 ) . The exact solution of the problem is y ( x ) = ( x 2 - 1 ) sin ( x ) . The maximum absolute errors of the problem (34) are given in Table 5 and results are compared with (Islam et al., 2008). Graph between the exact and the approximate solutions of Example 5.5 for N = 32 is shown in Fig. 5.

Example 5.6

Consider the following non-linear singular fourth order boundary value problem as

(35)
y ( 4 ) ( x ) + 4 x y ( 3 ) ( x ) = y 3 + cos ( x ) x x sin ( 2 x ) 2 - 4 , x [ 0 , 1 ] where, y ( 0 ) = 0 , y ( 1 ) = sin ( 1 ) , y ( 2 ) ( 0 ) = 0 , y ( 2 ) ( 1 ) = - sin ( 1 ) . The exact solution of the problem is y ( x ) = sin ( x ) . The results of the problem (35) are given in Table 6 and compared with (Mohanty et al., 2017). Graph between the exact and the approximate solutions of Example 5.6 for N = 32 is shown in Fig. 6.

Example 5.7

Consider the following non-linear singular fourth order boundary value problem as

(36)
y ( 4 ) ( x ) + 4 x y ( 3 ) ( x ) + 5 x y ( 1 ) ( x ) = y 3 + cos ( x ) x + sin x cos 2 ( x ) , x [ 0 , 1 ] where, y ( 0 ) = 0 , y ( 1 ) = sin ( 1 ) , y ( 2 ) ( 0 ) = 0 , y ( 2 ) ( 1 ) = - sin ( 1 ) . The exact solution of the problem is y ( x ) = sin ( x ) . The results of the problem (36) are given in Table 7. Graph between the exact and approximate solutions of Example 5.7 for N = 32 is shown in Fig. 7.

Table 1 Maximum absolute errors for Example 5.1.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 1.8041 × 10 - 8 1.2112 × 10 - 9 7.7281 × 10 - 11
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 7.4684 × 10 - 6 1.9008 × 10 - 6 4.7705 × 10 - 7
Wazwaz (2002) 9.14 × 10 - 5
Table 2 Maximum absolute errors for Example 5.2.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 2.6956 × 10 - 6 2.3833 × 10 - 7 1.6610 × 10 - 8
Khan and Khandelwal (2012) 3.06 × 10 - 6 4.34 × 10 - 7 3.53 × 10 - 8
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 5.8363 × 10 - 5 1.5815 × 10 - 5 4.0262 × 10 - 6
Islam et al. (2008) 2.3 × 10 - 3 3.4 × 10 - 4 1.54 × 10 - 4
Table 3 Maximum absolute errors for Example 5.3.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 1.8014 × 10 - 7 1.1957 × 10 - 8 7.5853 × 10 - 10
Khan and Khandelwal (2012) 7.02 × 10 - 6 4.35 × 10 - 6 7.87 × 10 - 7
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 1.1216 × 10 - 4 3.1010 × 10 - 5 7.7930 × 10 - 6
Khan and Khandelwal (2012) 2.19 × 10 - 4 3.88 × 10 - 5
Table 4 Maximum absolute errors for Example 5.4.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 1.8034 × 10 - 7 1.1971 × 10 - 8 7.5941 × 10 - 10
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 1.2179 × 10 - 4 3.1046 × 10 - 5 7.8021 × 10 - 6
Meŝtroviĉ (2007) 1.43 × 10 - 4
Table 5 Maximum absolute errors for Example 5.5.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 3.0468 × 10 - 5 2.7373 × 10 - 6 1.8321 × 10 - 7
Islam et al. (2008) 6.97 × 10 - 4 3.60 × 10 - 5 7.44 × 10 - 7
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 3.30 × 10 - 3 9.2908 × 10 - 4 2.3651 × 10 - 4
Islam et al. (2008) 1.23 × 10 - 2 2.80 × 10 - 3 1.60 × 10 - 3
Table 6 Maximum absolute errors for Example 5.6.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 8.7479 × 10 - 6 5.2045 × 10 - 7 3.0265 × 10 - 8
ρ n 4.0711 4.1040 -
Mohanty et al. (2017) 3.0756 × 10 - 5 1.8795 × 10 - 6 1.1320 × 10 - 7
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 4.1197 × 10 - 3 9.1777 × 10 - 4 2.1645 × 10 - 4
Table 7 Maximum absolute errors for Example 5.7.
Our Method h = 1 / 8 h = 1 / 16 h = 1 / 32
Fourth order method for ( α 2 , β 2 , γ 2 ) = 1 12 , 10 12 , 1 12 2.3953 × 10 - 6 1.4326 × 10 - 7 8.4006 × 10 - 9
ρ n 4.0635 4.0920 -
Second order method for ( α 2 , β 2 , γ 2 ) = 1 8 , 6 8 , 1 8 1.005 × 10 - 3 2.2503 × 10 - 4 5.3021 × 10 - 5
Graph of the exact solution versus the approximate solution for N = 16 for Example 5.1.
Fig. 1
Graph of the exact solution versus the approximate solution for N = 16 for Example 5.1.
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.2.
Fig. 2
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.2.
Graph of the exact solution versus the approximate solution for N = 16 for Example 5.3.
Fig. 3
Graph of the exact solution versus the approximate solution for N = 16 for Example 5.3.
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.4.
Fig. 4
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.4.
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.5.
Fig. 5
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.5.
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.6.
Fig. 6
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.6.
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.7.
Fig. 7
Graph of the exact solution versus the approximate solution for N = 32 for Example 5.7.

6

6 Conclusion

In this paper, we developed a non-polynomial quadratic spline method based on off-step points for solving higher even order boundary value problems. Advantage of the off-step points is to solve the higher order singular boundary value problems. We reduced the given problem into system of second order boundary value problems. The developed scheme (7) is second as well as fourth order accurate depending upon the parameters. Comparison of our method with the existing methods are shown in Tables 1–6 and graphs between exact and approximate solutions of the Examples 5.1–5.7 are shown in Figs. 1–7 respectively. These results shows that our fourth order method is far better than the existing fourth order methods except higher degree splines.

Acknowledgements

First author is thankful to UGC for providing MANJRF. The authors are also thankful to the referees for their useful suggestions which greatly improved the quality of the paper.

References

  1. , . Boundary Value Problems for Higher-Order Differential Equations. Singapore: World Scientific; .
  2. , , . Solution of sixth-order boundary value problems using non-polynomial spline technique. Appl. Math. Comput.. 2006;181:708-720.
    [Google Scholar]
  3. , . The use of cubic splines in the numerical solution of a system of second-order boundary value problems. Comput. Math. Appl.. 2001;42:861-869.
    [Google Scholar]
  4. , , . Numerical methods for the solution of special sixth order boundary-value problems. Int. J. Comput. Math.. 1992;45:207-223.
    [Google Scholar]
  5. , , , , . Quadratic non-polynomial spline approach to the solution of a system of second-order boundary-value problems. Appl. Math. Comput.. 2006;179:153-160.
    [Google Scholar]
  6. , , , , . Non-polynomial splines approach to the solution of sixth-order boundary value problems. Appl. Math. Comput.. 2008;195:270-284.
    [Google Scholar]
  7. , , . Convergence analysis of nonic-spline solutions for special nonlinear sixth-order boundary value problems. Commun. Nonlinear Sci. Numer. Simul.. 2010;15:3805-3813.
    [Google Scholar]
  8. , , . TAGE iterative algorithm and non-polynomial spline basis for the solution of non-linear singular second order ordinary differential equations. Appl. Math. Comput.. 2011;218:3289-3296.
    [Google Scholar]
  9. , . Numerical Methods for Two Point Boundary Value Problems. New York: Blaisdell Publications Co; .
  10. , , . Solution of non-linear sixth-order two point boundary-value problems using parametric septic splines. Int. J. Nonlin. Sci.. 2012;2:184-195.
    [Google Scholar]
  11. , . The modified decomposition method for eighth-order boundary value problems. Appl. Math. Comput.. 2007;188:1437-1444.
    [Google Scholar]
  12. , , , . Spline in compression method for the numerical solution of singularly perturbed two point singular boundary value problems. Int. J. Comput. Math.. 2004;81:615-627.
    [Google Scholar]
  13. , , , . Convergent spline in tension methods for singularly perturbed two point singular boundary value problems. Int. J. Compu. Math.. 2005;82:55-66.
    [Google Scholar]
  14. , , , . Non-polynomial cubic spline discretization for system of non-linear singular boundary value problems using variable mesh. Adv. Diff. Eqs.. 2017;327
    [Google Scholar]
  15. , , , . Polynomial and non-polynomial spline approaches to the numerical solution of second order boundary value problems. Appl. Math. Comput.. 2007;184:476-484.
    [Google Scholar]
  16. , , . Solution of eighth-order boundary value problems using the non-polynomial spline technique. Int. J. Comput. Math.. 2007;84:347-368.
    [Google Scholar]
  17. , , , . Quintic non-polynomial spline method for the solution of a second-order boundary-value problem with engineering applications. Comput. Math. Appl.. 2011;62:1707-1714.
    [Google Scholar]
  18. , . Matrix Iterative Analysis. Englewood Cliffs, NJ: Prentice-Hall; .
  19. , . The numerical solution of special fourth order boundary value problems by modified decomposition method. Int. J. Comput. Math.. 2002;79:345-356.
    [Google Scholar]
Show Sections