International Journal of Differential Equations

Volume 2017, Article ID 2464759, 12 pages

https://doi.org/10.1155/2017/2464759

## A Family of Boundary Value Methods for Systems of Second-Order Boundary Value Problems

^{1}Department of Mathematics and Computer Science, Sule Lamido University, PMB 048, Kafin Hausa, Nigeria^{2}Department of Mathematics and Statistics, Austin Peay State University, Clarksville, TN 37044, USA

Correspondence should be addressed to T. A. Biala; moc.oohay@beehotalaib

Received 10 July 2016; Accepted 13 November 2016; Published 15 January 2017

Academic Editor: Elena Braverman

Copyright © 2017 T. A. Biala and S. N. Jator. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A family of boundary value methods (BVMs) with continuous coefficients is derived and used to obtain methods which are applied via the block unification approach. The methods obtained from these continuous BVMs are weighted the same and are used to simultaneously generate approximations to the exact solution of systems of second-order boundary value problems (BVPs) on the entire interval of integration. The convergence of the methods is analyzed. Numerical experiments were performed to show efficiency and accuracy advantages.

#### 1. Introduction

In what follows, we consider the general system of second-order boundary value problems:where are continuous functions, , , and , and is the dimension of the system. These second-order boundary value problems are encountered in several areas of engineering and applied sciences such as celestial mechanics, circuit theory, astrophysics, chemical kinetics, and biology. Most of these problems cannot be solved analytically, thus the need for a numerical approach. In practice, (1) is solved by the multiple shooting technique and the finite difference methods. The construction and implementation of higher order methods for the latter approach are difficult while the former approach suffers from numerical instability if the BVP is stiff [1–3] and singularly perturbed.

In the past few decades, the boundary value methods (BVMs) have been used to solve first-order initial and boundary value problems [4–8]. Their stability and convergence properties have been fully discussed in [5]. These BVMs are also used to solve higher order initial and boundary value problems by first reducing the higher order differential equations into an equivalent first-order system. This approach increases the computational costs and time and also does not utilize additional information associated with specific differential equations such as the oscillatory nature of some solutions [9, 10].

Lambert and Watson [11] have derived symmetric schemes for periodic initial value problems of the special second-order . Brugnano and Trigiante [4–6] have also derived BVMs for the first-order initial and boundary value problems. Amodio and Iavernaro [12] used BVMs to solve the special second-order problem . Biala, Biala and Jator, Jator and Li [13–15] applied the BVMs to solve the general second-order problem and Aceto et al. [16] constructed symmetric linear multistep methods (LMMs) which were used as BVMs for the special second-order problem . In this paper, we have derived a class of BVMs and given a general framework via the block unification approach on how to use the BVMs on systems of BVPs for the general second-order differential equations (ODEs).

The boundary value technique simultaneously generates approximate solution to the exact solution of (1) on the entire interval of integration. The BVMs can only be successfully implemented if used together with appropriate additional methods [5]. In this regard, we have proposed methods which are obtained from the same continuous scheme and are derived via the interpolation and collocation approach [15, 17–19].

The paper is organised as follows. In Section 2, we derive a continuous approximation of the exact solution . Section 3 gives the specification of the methods. The convergence of the methods is discussed in Section 4. The use and implementation of the methods on ODEs and partial differential equations (PDEs) are detailed in Section 5. Numerical tests and concluding remarks are given in Sections 6 and 7, respectively.

#### 2. Derivation of Methods

In this section, we shall use the interpolation and collocation approach [17] to construct a -step continuous LMM (CLMM) which will be used to produce the main and additional formulas for solving (1).

Our starting point is to construct the CLMM which has the form where , , and are continuous coefficients and is chosen to be half the step number so that each formula, derived from (2), satisfies the root condition. The main and additional methods are then obtained by evaluating (2) at () to obtain the formulas of the form obtained from the first derivative of (2).

Next, we discuss the construction of (2) in the theorem that follows.

Theorem 1. *Let (2) satisfy the following equations: Then, the continuous representation (2) is equivalent to where one defines the matrix V as is obtained by replacing the jth column of V by and are basis functions.*

*Proof. *We require that method (2) be defined by the assumed polynomial basis functions where and are coefficients to be determined.

Substituting (9) into (2), we have which is simplified to and expressed in the form where Imposing conditions (5) on (12), we obtain a system of equations which can be expressed as , where is a vector of undetermined coefficients.

Using Crammer’s rule, the elements of are determined and given as where is obtained by replacing the th column of by . We rewrite (12) using the newly found elements of as in (6); that is,

#### 3. Specification of Methods

In this section, we specify the family of methods by evaluating the CLMM (2) at , which is also used to obtain the derivative formula given by which is effectively applied by imposing that to produce derivative formulas of the form (4).

##### 3.1. BVM of Orders 4, 6, and 8

For , the BVM of order 4 is given as follows (where we have denoted a BVM with step number as BVM):

*BVM2* with the derivative formulas For , we obtain the BVM of order 6 given as follows:

*BVM4 * with the derivative formulas For , we obtain the BVM of order 8 given as follows:

*BVM6* with the derivatives

#### 4. Convergence of the Methods

In this section, we shall establish the convergence of the BVMs derived in the previous section. We emphasize that we evaluate (2) at to obtain and also evaluate at ,, to obtain We note that the formulas in (24) and (25) are .

We introduce the matrices and such that systems (24) and (25) are given by and the exact form of the system iswhere and are matrices, is the zero matrix, , is a vector of constants, and is the truncation error vector of the formulas in (24) and (25).

Lemma 2. *Let P be a block lower triangular matrix given by where each submatrix is of order N and is the zero matrix. Then, P is invertible if and only if and are invertible. Moreover,*

is an identity matrix so that . Thus, to obtain an estimate for , it suffices to show the existence of the inverse of .

Now, we define where so that and consequently is nonsingular provided ([21]).

Thus, exists provided .

Lemma 3. *If , then the matrix is monotone, that is , where is also a block matrix of first partial derivatives and .*

*Proof. * The two series converge provided the spectral radius : The infinite series is nonnegative. Thus, to show that is monotone, it suffices to show that for .

Theorem 4. *Let be an approximation of the solution vector for the system obtained on a partition from systems (24) and (25). If and , where the exact solution is assumed to be several times differentiable on , and if , then, for sufficiently small , .*

*Proof. *Subtracting (27) from (26), we obtain Under the conditions of Lemma 3, exists and is nonnegative. Therefore, provided . Hence,

#### 5. Use of Methods

In this section, we discuss the use of methods in (16) and (17) for , where is a multiple of . We emphasize that the methods in (16) and (17) are all main methods since they are weighted the same and their use leads to a single matrix equation which can be solved for the unknowns. For example, for BVM6, we make use of each of the methods above in steps of 6; that is, . This results in a system of equations in unknowns which can be easily solved for the unknowns. Below is an algorithm for the use of the methods.

The methods are implemented as BVMs by efficiently using the following steps.

*Step 1. *Use the methods in (16) and (17) for to obtain in the interval and for is obtained in the interval . Similarly, for , we obtain , where in the intervals, , respectively.

*Step 2. *The unified block given by the system obtained in Step 1 results in a system of equations in unknowns which can be easily solved.

*Step 3. *The values of the solution and the first derivatives of (1) are generated by the sequence , , , obtained as the solution in Step 2.

We note that all computations were carried out in Mathematica 10.0 enhanced by the feature FindRoot.

#### 6. Numerical Examples

In this section, we consider seven numerical examples. Examples 1 to 5 were solved using the BVMs , , and (derived in this paper) of orders 6, 8, and 10, respectively. Also, these examples were solved using the Extended Trapezoidal Methods of the second kind (ETRs) and the Top Order Methods (TOMs) given in [5] of orders 6 and 10, respectively. Comparisons are made between the BVM and the ETRs [5] as well as between the BVM and the TOMs [5] by obtaining the maximum errors in the interval of integration. We also compared our methods with the Sinc-Collocation method [20]. Examples 6 and 7 were solved using the BVMs of order 6. We note that the number of function evaluations (NFEs) involved in implementing the BVMs is in the entire range of integration. The code was based on Newton’s method which uses the feature FindRoot or NSolve for linear problems in Mathematica. The efficiency curves show the plot of the logarithm of against the number of function evaluations for each method.

*Example 1. *We consider the linear system of second-order boundary value problems given in [20] where

This problem was solved using the ETRs and BVM of order 6 as well as the TOMs and BVM of order 10. The maximum Euclidean norm of the absolute errors in and was obtained in the entire interval of integration. In Table 1, we compared the Sinc-Collocation method [20] with the BVM of order 8. Table 2 shows the comparison between the ETRs, BVM4, TOMs, and BVM8. While the results of these methods are of approximate accuracy, we emphasize that the TOMs and ETRs use 20 function evaluations per step while the BVM4 and BVM8 use and function evaluations for this system. Hence, the BVMs are quite accurate and efficient. We also calculated the Rate of Convergence (ROC) using the formula , where is the error obtained using step size . The ROC of the BVM4 and ETRs shows that these methods are consistent with the theoretical order (order 6) behavior of the methods. We omit the ROC of the TOMs and BVM8 because their errors are mainly due to round-off errors rather than to truncation errors. Figure 1 also shows the efficiency curves of these methods.