International Journal of Computational Mathematics

International Journal of Computational Mathematics / 2014 / Article

Research Article | Open Access

Volume 2014 |Article ID 527924 |

Navnit Jha, R. K. Mohanty, Vinod Chauhan, "The Convergence of Geometric Mesh Cubic Spline Finite Difference Scheme for Nonlinear Higher Order Two-Point Boundary Value Problems", International Journal of Computational Mathematics, vol. 2014, Article ID 527924, 12 pages, 2014.

The Convergence of Geometric Mesh Cubic Spline Finite Difference Scheme for Nonlinear Higher Order Two-Point Boundary Value Problems

Academic Editor: Riccardo Dondi
Received31 Mar 2014
Accepted10 Jul 2014
Published23 Jul 2014


An efficient algorithm for the numerical solution of higher (even) orders two-point nonlinear boundary value problems has been developed. The method is third order accurate and applicable to both singular and nonsingular cases. We have used cubic spline polynomial basis and geometric mesh finite difference technique for the generation of this new scheme. The irreducibility and monotone property of the iteration matrix have been established and the convergence analysis of the proposed method has been discussed. Some numerical experiments have been carried out to demonstrate the computational efficiency in terms of convergence order, maximum absolute errors, and root mean square errors. The numerical results justify the reliability and efficiency of the method in terms of both order and accuracy.

1. Introduction

Consider the following nonlinear two-point boundary value problems of order : where , , and , are finite real constants and .

The higher order two-point boundary value problems play an important role in various areas of mathematical physics and engineering. The mathematical modeling of geological folding of rock layers [1], theory of plates and shell [2], waves on a suspension bridge [3], reaction diffusion equation [4], astrophysical narrow convection layers bounded by stable layers [5], viscoelastic and inelastic flows, deformation of beam and plate deflection theory [68], and so forth are some of the modeling problems in mathematical physics.

The analytical solution of (1) for the arbitrary choice of is difficult and thus we attempt to develop an economical computational method. The existence and uniqueness of the solutions of higher order boundary value problems have been discussed by Agarwal and Krishnamoorthy [9], O’Regan [10], Aftabizadeh [11], and Wei [12]. In the past, the approximate solution for the second, fourth, and/or sixth order two-point boundary value problems has been discussed using homotopy analysis by Liang and Jeffrey [13], reproducing kernel space by Yao and Lin [14], spline solution by Siddiqi and Twizell [15], and the Sinc-Galerkin and Sinc-Collocation methods by Rashidinia and Nabati [16]. The monotone iterative technique and quasilinearization method for the higher order ordinary differential equations have been analysed by Koleva and Vulkov [17]. The geometric mesh technique gains its importance from the theory of electrochemical reaction-convection-diffusion problems in one-dimensional space geometry [18]. The formulation of the geometric mesh finite difference approximations for the two-point singular perturbation problems was developed by Jain et al. [19] and Iyengar et al. [20]. Later, the applications of geometric mesh in the context of second order two-point boundary value problems were studied extensively by Mohanty et al. [21] and Kadalbajoo and Kumar [22].

There are some higher order approximation methods available for the numerical solution of differential equations. The most important issues associated with higher order schemes are more computing time and more memory spaces. Therefore, the lower order numerical method with very low computing time is worthwhile. This paper aims to develop a third order accurate numerical method based on cubic polynomial spline basis and geometric mesh finite difference approximations for the numerical solution of second order two-point boundary value problems. The method can be easily extended to fourth, sixth, and even higher order problems. The simplicity of the proposed method lies in its three-point discretizations with evaluations at two neighbouring nodes and one central node. The scheme is inherently compact and minor modifications are required for the singular problems. The resulting systems of algebraic equations are solved using block gauss elimination method obtained from the discretizations of linear differential equations. Classical Newton’s method has been applied to the nonlinear coupled difference equations.

Section 2 discussed how the third order accurate method based on geometric mesh polynomial spline basis and finite difference discretizations for second order differential equations was derived. The convergence analysis has been discussed briefly in Section 3. Further in Section 4, the proposed method has been extended to higher (even) order two-point boundary value problems; however, we restrict our computations up to the sixth order problems. In Section 5, some examples are presented which show singular and nonsingular nature both in linear and nonlinear cases of second, fourth, and sixth order problems.

2. Geometric Mesh Cubic Spline Methods

We introduce a finite set of geometric grids for the solution region . Let , be the nonuniform step size and let be the geometric mesh ratio. Let be the exact solution values and let be the approximate solution of at the mesh , respectively. Let be the cubic interpolating polynomial which interpolates the solution of the second order differential equation at defined as follows: where the coefficients , , , and are obtained using the following relations: We obtain via algebraic calculations the following expressions: Using the continuity of the first order derivatives , , we obtain Now, we define the following finite difference geometric mesh approximations so as to obtain the third order of accuracy for the second order differential equations with significant first order derivative: With the help of series expansion, we obtain Define With the help of (7)–(10), we obtain where .

Let , where is a free parameter to be determined. With the help of (7) and (12), we find Therefore, if we choose , we achieve .

Now consider the spline relation (2), for ; we can easily obtain the following approximations: It is easy to verify that We define Thus, we obtain Analogous to spline relation (5), with the help of (17), consider the following relationship: If the coefficients of , in the relation (18) vanish, then the right hand side of (18) has local truncation error of and hence we obtain Finally, we conclude the derivation for the approximate solution of second order differential equation with significant first order derivative and the corresponding geometric mesh spline approximation is given by The difference equation (21) has local truncation error of for . However, for the uniform mesh ( ), the local truncation errors become . If contains any singularity in the given domain , then we use finite Taylor’s expansion for the terms containing and then neglecting terms from (21) and incorporating the boundary values , , we obtain a system of recurrence relations with tridiagonal nature. If is linear, then the resulting matrix system can be solved by gauss elimination method; otherwise we use Newton’s solver for computing the numerical solutions. For the convergence of the difference equations (21), must be positive [23].

3. Convergence Analysis

In this section, we discuss the convergence theory for the geometric mesh cubic spline method (21) discussed for the numerical solution of second order two-point boundary value problems (20). At , (20) is written as Then, the geometric mesh cubic spline scheme (21) is given by where Scheme (23) in the matrix vector notation is written as where , .

Our aim is to find an approximation for by solving system From (26) and (27), we obtain Let and   be the discretization error vector.

Let us define where With the help of mean value theorem, (30) can be expressed as where , .

Now, from (24), we find that Equivalently, in the matrix notation, we have where is the tridiagonal matrix with the following entries: From (28) and (35), we obtain It is easy to see that for sufficiently small , that is, and .

Hence the graph of matrix is strongly connected and thus is irreducible [24].

Now let Let and .

Then, we obtain Thus, for sufficiently small values of , we find that Hence is monotone [25]; consequently we find that exists and [26]. If denotes the th element of and we define the matrix-vector norm as Also, from the theory of matrix, we know that With the help of Taylor’s expansion, we obtain Therefore, from (37) and (41), we obtain This proves the third order convergence of the geometric mesh spline method. The convergence theory may be now formally stated.

Theorem 1. The geometric mesh cubic spline finite difference method given by (21) for the numerical solution of second order two-point boundary value problems (20) with sufficiently small and gives a third order convergent solution.

4. Geometric Mesh Spline Algorithms for Higher Order Boundary Value Problem

The geometric mesh spline method, developed in Section 2, can be easily extended to higher order (even) boundary value problem (1) and it can be written as a system of second order boundary value problem: Then, the third order accurate algorithm based on the geometric mesh cubic spline method for the numerical solution of (45) may be written as follows: The boundary values are used to obtain values at for and , respectively. The numerical scheme may be implemented by neglecting terms from the system of (47). The resulting difference equations in case of linear boundary value problems give a block tridiagonal system of equations for the unknowns , , and can be easily solved using block gauss elimination method.

5. Numerical Results

To illustrate the efficiency of the cubic spline geometric mesh finite difference method, we have computed both nonsingular and singular equations for linear and nonlinear two-point boundary value problems of second, fourth, and sixth order. The boundary conditions are obtained using the analytical solution as a test procedure. The numerical accuracy of results is presented using maximum absolute errors ( ), root mean square errors ( ), and computational order of convergence ( ) for interpolating th order derivative of with the error tolerance being : For the simplicity in computation, we have chosen , for , and computed the geometric mesh as follows: The subsequent mesh spacing is determined by , . If the boundary value problems exhibit layer behaviour near the left boundary, the solution value can be captured by choosing . If the layer occurs at the right boundary, we choose . If the layer occurs in the interior region, then mesh in the first half of the interval may be arranged by choosing and second half of the interval by choosing [27]. All the numerical computations are performed using long double length arithmetic in C under Linux operating system with 2 GB operational memory.

Example 1 (see [28]). Consider the linear nonsingular convection diffusion problem The analytical solution is . The numerical results are computed for = 10, 100 and 500 in Tables 1, 2, and 3 for various values of .

40 4.0 3.9
80 3.0 3.9

40 6.0 2.6
80 6.0 3.5

40 5.5 0.7
80 0.1 1.3

Example 2 (see [29]). Consider the linear nonsingular fourth order stiff two-point boundary value problem: The theoretical solution is given by . We know that and are the eigenvalues of this equation and hence the problem is stiff for large values of . We have solved the problem for small as well as large values of and the behavior of solution is sufficiently smooth for in case of both uniform mesh and geometric mesh. We have computed the approximate solution with . Tables 4-5 present the accuracy of solution and computational order of convergence in case of uniform mesh and geometric mesh.