#### Abstract

In the present work a nonpolynomial spline function is used to approximate the solution of the second order two point boundary value problems. The classes of numerical methods of second order, for a specific choice of parameters involved in nonpolynomial spline, have been developed. Numerical examples are presented to illustrate the applications of this method. The solutions of these examples are found at the nodal points with various step sizes and with various parameters (*α*, *β*). The absolute errors in each example are estimated, and the comparison of approximate values, exact values, and absolute errors of at the nodal points are shown graphically. Further, shown that nonpolynomial spline produces accurate results in comparison with the results obtained by the B-spline method and finite difference method.

#### 1. Introduction

There are many linear and nonlinear problems in science and engineering, namely, second order differential equations with various types of boundary conditions, which are solved either analytically or numerically. Numerical simulation in engineering science and in applied mathematics has become a powerful tool to model the physical phenomena, particularly when analytical solutions are not available, then very difficult to obtain. The numerical solution of two-point boundary value problems (BVPs) is of great importance due to its wide application in scientific research. Several authors like Bickley [1] and Khan [2] have considered the applications of cubic spline functions for the solution of two point boundary value problems. Detailed explanation of theory of splines is given in [3, 4]. Some of already established methods to solve the boundary value problems are shooting method, finite difference method, finite volume method, variational iteration method, and Adomian decomposition method. Chawla and Katti [5] employed finite difference method for a class of singular two-point BVPs; a class of BVPs was solved by using numerical integration [6]; Ravi kanth and Reddy dealt with cubic spline [7]; the variational iteration method was proposed originally by He [8] in 1999; Adomian et al. solved a generalization of Airy’s equation by decomposition method [9]. In the present communication we apply nonpolynomial spline functions to develop numerical method for obtaining the approximations to the solution of second order two point boundary value problem of the form

This type of problem (by missing the term containing ) is proposed by the authors in [10, 11]. Numerical solution of (1) based on finite difference, finite element, and finite volume methods has been proposed by Fang et al. [10]; Hikmet Caglar et al. [11] applied B-spline interpolation in two-point BVPs and compared results with finite difference, finite element, and finite volume methods.

Briefly, outline is as follows. In Section 2, we develop a numerical technique based on nonpolynomial spline function for solving second order linear and nonlinear two point boundary value problems (1). To demonstrate the efficiency of the method some numerical examples have been solved and compared with exact solution and also with other known methods [12] in Section 3 and conclusions have been presented in Section 4.

#### 2. Description of the Method

We consider a uniform mesh with nodal points on such that A nonpolynomial function of class which interpolates at the mesh points , for , depends on a parameter and reduces to ordinary cubic spline in as . The spline function we propose has the following form: , where is the frequency of the trigonometric part of the spline function which can be real or pure imaginary and which will be used to raise the accuracy of the method.

When correlation between polynomial and nonpolynomial spline basis functions are investigated in the following manner: It follows that . Thus in each subinterval , we have

For each segment , the non-polynomial has the following form: where , , , and are constants and is a free parameter. Let be an approximation to , obtained by the segment of mixed spline function passing through the points and . To obtain the necessary conditions for the coefficients introduced in (5), we not only require to satisfie interpolate conditions at and , but also the continuity of first derivative at the common nodes to be fulfilled.

To derive an expression for the coefficients of (5) in terms of , , , , we first denote From algebraic simplification we get the following expression: where and using the continuity of the first derivative at ; that is, , we obtain the following relations for and whenever ; then and . Therefore (8) reduces to the consistency relation of cubic splines: Equation (1) can be rewritten as The proposed differential equation (10) can be discretized at the nodal point by By using moment of the spline in (11) we obtain Taking approximations for the first derivative of we have Substituting (12), (13) in (8) and simplifying, we get the following tridiagonal system which gives the approximations of the solution at : with , .

The tridiagonal linear system (14) can be written in the following matrix form: is a tridiagonally dominant matrix of order .

is a tridiagonal matrix defined by , are tridiagonal matrices defined as The tridiagonal matrix is defined by

#### 3. Numerical Illustrations

In the present work four linear boundary value problems with and one nonlinear boundary value problem with for different values of and have been solved, whose exact solutions are known. The approximate solution, exact solutions, and absolute errors at the nodal points are tabulated in Tables 1–7, and comparisons are shown in Figures 1–5. The results of the present work are compared with the exact solution of all the problems and with finite difference method, B-spline method of Example 4.

**(a)**

**(b)**

**(a)**

**(b)**

*Example 1. *Consider the boundary value problem:
The analytical solution of (20) is
By comparing the given equation with (10) we have
Here
and the function values at the nodal points are given by ; that is,
Substituting the values of , , at in (16), (17), and (18) we get the values of , , , and taking these values in (15) we get the tridiagonal matrix . From (23), (24) we have and so we obtain a system of linear equations. This system in the matrix form is ; that is,

Solving this we get the solution matrix . The approximate values , exact values ( of (21)), and the absolute errors are summarized in Table 1, and the comparison is given in Figure 1.

*Example 2. *Consider the boundary value problem:
Comparing the given equation with (10) we have
Here , so the nodal points are

*Case 1* (choosing , ). From (19) we have

and the function values at the nodal points are given by ; that is, Substituting the values of , , and at in (16), (17), and (18) we get the values of , , , and substituting these values in (15) we get the tridiagonal matrix . From (28), (29) we have and . So we obtain a system of linear equations. This system in the matrix form is ; solving this we get the solution matrix .

The analytical solution of the given equation is The approximate values , exact values ( from (30)), and the absolute errors at the nodal points are summarized in Table 2 and the comparison is given in Figure 2.

*Case 2* ((a) choosing , (b) choosing , )*. *For the values of , the procedure followed in Case 1 is used to determine the approximate solution of (24). The approximate values , exact values ( from (30)), and the absolute errors at the nodal points of Case 2 are summarized in Tables 3(a) and 3(b), respectively. The comparison of errors in the two cases at the nodal points is given in Figure 2(b).

*Example 3. *Consider the boundary value problem:
Comparing the given equation with (10) we have
Here , so the nodal points are Solution of (31) is given by (15). Here
and the function values at the nodal points is given by ; that is,
Substituting the values of , , and at in (16), (17), and (18) we get the values of , , and , and substituting these values in (15) we get the tridiagonal matrix . From (33), (34) we have and . So we obtain a system of linear equations. This system in the matrix form is , solving this we get the solution matrix .

The analytical solution of the given differential equation is
Approximate values, exact values (35), and the absolute errors at the nodal points of are given in Table 4, and the comparison is given in Figure 3.

*Example 4. *Consider the boundary value problem:
Comparing the given equation with (10) we have , ,

Here , so the nodal points are . Solution of (36) is given by (15). Here , where , , and the function values at the nodal points is −2. That is,
Substituting the values of , , and at in (16), (17), and (18) we get the values of , , and , and substituting these values in (15) we get the tridiagonal matrix . From (37) we have and . So we obtain a system of linear equations. This system in the matrix form is ; solving this we get the solution matrix .

The analytical solution of (36) is commutation
Approximate solution, the exact solution, and the absolute errors at the nodal points of are given in Table 5, and the comparison is given in Figure 4. Comparative results obtained by our method of Example 4 with the values obtained by other methods are given in Table 6 and shown in Figure 4(b).

*Example 5. *Consider the non linear boundary value problem:
Comparing the given equation with (10) by taking in (1) we have
and the nodal points with are for .

Now by choosing and and substituting these values in (16) and (19) we get the tridiagonal matrices , and
From (18) we have
Substituting , , (41), and (42) in (15), we obtain a system of nonlinear equations:
Solving these equations by Newton method we get the solution matrix .

The analytical solution of (39) is
The approximate solution , exact solution ( of (44)) and the absolute errors are summarized in Table 7, and the comparison is given in Figure 5.

#### 4. Conclusions

In the present work it has been described and demonstrated the applicability and efficiency of the nonpolynomial spline method for solving second order linear and nonlinear two point boundary value problems. The nonpolynomial spline method is tested on different problems. Numerical results for Examples 1, 2, 3, 4, and 5 are presented in Tables 1, 2, 3, 4, 5, 6, and 7, and graphs between the exact solution and approximate solution have been plotted for all the 5 examples. In Example 2 the solution is obtained by choosing different values for and , and a comparison of errors is given in Figure 2(b) from which we can say that the error is reduced more rapidly with the choice of and than the other choices of and , and for Example 4 the graph (Figure 4(b)) is plotted by comparing with the results obtained by other known methods. This shows that the accuracy of our method is better than the accuracy of finite difference method and of B-spline method. All the tables and figures clearly indicate that our numerical solution converges to the exact solution. We conclude that the present method is an applicable technique and approximates the solution very well, and the numerical solutions are in very good agreement with the exact solution. Moreover non-polynomial spline method has less computational cost over other polynomial spline methods. The implementation of the present method is very easy, acceptable, and valid scheme.