Journal of Applied Mathematics

Journal of Applied Mathematics / 2017 / Article

Research Article | Open Access

Volume 2017 |Article ID 8510948 | https://doi.org/10.1155/2017/8510948

Mohammad Alkasassbeh, Zurni Omar, "Implicit One-Step Block Hybrid Third-Derivative Method for the Direct Solution of Initial Value Problems of Second-Order Ordinary Differential Equations", Journal of Applied Mathematics, vol. 2017, Article ID 8510948, 8 pages, 2017. https://doi.org/10.1155/2017/8510948

Implicit One-Step Block Hybrid Third-Derivative Method for the Direct Solution of Initial Value Problems of Second-Order Ordinary Differential Equations

Academic Editor: Mehmet Sezer
Received25 Aug 2016
Revised20 Oct 2016
Accepted23 Oct 2016
Published18 Jan 2017

Abstract

A new one-step block method with generalized three hybrid points for solving initial value problems of second-order ordinary differential equations directly is proposed. In deriving this method, a power series approximate function is interpolated at while its second and third derivatives are collocated at all points in the given interval. The proposed method is then tested on initial value problems of second-order ordinary differential equations solved by other methods previously. The numerical results confirm the superiority of the new method to the existing methods in terms of accuracy.

1. Introduction

Numerous problems such as chemical kinetics, orbital dynamics, circuit and control theory, and Newton’s second law applications involve second-order ordinary differential equations (ODEs). Normally, those equations have no analytical solutions. To approximate the solution of such problems several numerical methods were developed on the hands of many scholars such as [13].

Block methods for solving ODEs were first proposed by Milne ([4]). Later [5] adopted Milne’s methods to provide starting values for predictor-corrector scheme. However, the block methods have some drawbacks and this led to the introduction of hybrid methods. According to [6], hybrid methods were initially introduced to overcome zero-stability barrier that occurred in block methods in Dahlquists ([7]). Besides the ability to change step size, the other benefit of these methods is utilizing data off-step points which contribute to the accuracy of the methods.

To increase the accuracy of the numerical methods further, researchers such as [8, 9] proposed high method derivative to overcome stiffness in ODEs. The former presented another type of hybrid methods called second-derivative methods, while the later proposed a Simpson’s type second-derivative method for the solution of a stiff system of first-order IVPs. These scholars motivated us to develop a new generalized three-hybrid one-step third-derivative implicit method for solving second-order ODEs directly using the approach of interpolation and collocation for the general use to improve the efficiency of the approximate solution.

This article is organized as follows: in the coming section we demonstrate the derivation of the method, where we consider three off-step points through the approach of interpolation and collocation. The details of the analysis of the method are discussed in Section 3 which include zero stability, order, consistency, and convergence. In Section 4 some numerical problems are solved and the performance of the developed method is compared with other methods mentioned in literature. Finally, the conclusion is discussed in Section 5.

2. Development of the Method

An approximate power series basis function taking the formwhere and are the number of interpolation and collocation points, respectively, is considered to be a solution to the following ODE:On derivation of (1) twice and thrice we obtainInterpolating (1) at , and collocating (3) at all points , , where , a system of equations in matrix form is produced as below:whereUsing matrix manipulation to solve (4) for the unknown coefficients s and then substituting them back into (1) yieldwhere , is the constant step size for the partition of the interval which is given by , , , and are undetermined constants listed in Appendix  I in Supplementary Material available online at https://doi.org/10.1155/2017/8510948, , and whose first partial derivative isEvaluating (6) at the noninterpolating points and (7) at all points , , produces the following general equations in block form:where is an identity matrix andTheir entries are listed in Appendix  II in Supplementary Material, while the vectors are defined as follows:

3. Analysis of the Method

3.1. Zero Stability

Definition 1. The hybrid block method formula (8) is said to be zero stable if no root of the first characteristic equation has modulus greater than one; that is, and if then the multiplicity of must not exceed two.

To illustrate that the root of the first characteristic equation satisfies the prior definition we assume that and hence which imply that As a result, the developed method is zero stable.

3.2. Order of the Method

The linear operator associated with the hybrid block methods formula (8) is defined as Expanding the above equation in Taylor series and combining like terms we wind up withAccording to [6, 10] method (8) is said to be of order ifThe term is called the error constant and the local truncation error is given by Comparing like terms of and in (14) produces the coefficients with vector of error constants wherewhich conclude that the order of the developed method is .

3.3. Consistency

Definition 2. A block method is said to be consistent if its order is greater than one.

Consistency property is achieved for the hybrid block method from the above analysis since the order .

3.4. Convergence

Theorem 3 (see [16]). Consistency and zero stability are sufficient conditions for a linear multistep method to be convergent

The hybrid block method equation (8) is convergent since it fulfills both the consistency and zero-stability conditions.

4. Numerical Examples

In this section, the efficiency and the performance of the general three-hybrid one-step implicit hybrid block method (8) with order is investigated on five test problems. The first example is highly stiff linear IVP problem with step size , the second is nonlinear IVP with , the third is linear with , the fourth is a nonlinear system with , and finally the fifth is a nonlinear undamped Duffing equation with . It is worth mentioning that this method works even for large interval and different values of step size. The values mentioned in this article are chosen just for the sake of comparison with the existing methods only.

Problem 4. , , , .

Exact Solution. with

Source (see [11]). See Table 1.


value Exact solution Computed solution for ;  ;   Error in new method Error for [11]

0.1000.9048374180359595200.904837418035948970
0.2000.8187307530779818200.818730753077964060
0.3000.7408182206817177700.740818220681694340
0.4000.6703200460356393300.670320046035611350
0.5000.6065306597126334200.606530659712602120
0.6000.5488116360940265000.548811636093992530
0.700 0.4965853037914095300.496585303791373890
0.8000.4493289641172216200.449328964117184870
0.9000.4065696597405991700.406569659740561860
1.0000.3678794411714423300.367879441171404920

Problem 5. , , , .

Exact Solution. with

Source (see [12]). See Table 2.


value Exact solution Computed solution for ;  ;   Error in new method Error for [12]

0.100 1.050041729278491400 1.050041729278491200
0.200 1.100335347731075600 1.100335347731075300
0.300 1.151140435936466800 1.151140435936466100
0.400 1.202732554054082100 1.202732554054081000
0.500 1.255412811882995200 1.255412811882994800
0.600 1.309519604203111900 1.309519604203112800
0.700 1.365443754271396400 1.365443754271398000
0.800 1.423648930193601900 1.423648930193606400
0.900 1.484700278594052000 1.484700278594060600
1.000 1.549306144334055000 1.549306144334067700

Problem 6. , , , .

Exact Solution. with

Source (see [13]). See Table 3.


value Exact solution Computed solution for ;  ;   Error in new method Error for [13]

0.100 −0.105170918075647710 −0.105170918075647660
0.200 −0.221402758160169850 −0.221402758160169990
0.300 −0.349858807576003180 −0.349858807576003520
0.400 −0.491824697641270570 −0.491824697641271070
0.500 −0.648721270700128640 −0.648721270700129420
0.600 −0.822118800390509550 −0.822118800390510880