Research Article  Open Access
3Point Block Methods for Direct Integration of General SecondOrder Ordinary Differential Equations
Abstract
A Multistep collocation techniques is used in this paper to develop a 3point explicit and implicit block methods, which are suitable for generating solutions of the general secondorder ordinary differential equations of the form . The derivation of both explicit and implicit block schemes is given for the purpose of comparison of results. The Stability and Convergence of the individual methods of the block schemes are investigated, and the methods are found to be 0stable with good region of absolute stability. The 3point block schemes derived are tested on standard mechanical problems, and it is shown that the implicit block methods are superior to the explicit ones in terms of accuracy.
1. Introduction
In recent times, the integration of Ordinary Differential Equations (ODEs) are carried out using some kind of block methods. In particular, this paper discusses the general secondorder ODEs which arise frequently in the area of science, engineering and mechanical systems and are generally written in the form, This problem being second order is usually or sometimes solved by reducing the ordinary differential equation into systems of firstorder ordinary differential equations. Thereafter, known numerical methods, such as RungeKutta methods and Linear Multistep Methods (LMMs), are used to solve them.
Development of LMM for solving ODEs can be generated using methods such as Taylor's Series, numerical integration, and collocation method, which are restricted by an assumed order of convergence. In this paper, we will follow suite from the previous papers of Okunuga and Ehigie [1] by deriving our new method in a multistep collocation technique introduced by Onumanyi et al. [2]. Some researchers have attempted the solution of (1.1) directly using linear multistep methods without reduction to systems of firstorder ordinary differential equations, they include Brown [3], Onumanyi et al. [4], Ismail et al. [5], and Ehigie et al. [6].
Block methods for solving Ordinary Differential Equations have initially been proposed by Milne [7] who used them as starting values for predictorcorrector algorithm, Rosser [8] developed Milne's method in form of implicit methods, and Shampine and Watts [9] also contributed greatly to the development and application of block methods. Fatunla [10] gave a generalization to block methods using some definition in matrix form upon which the methods derived in this paper will follow.
Hybrid methods, using collocation technique, were discussed by Ehigie et al. [6] and the continuous linear multistep scheme (CLMS) generated was used to obtain block schemes that serve as predictorcorrector schemes which were of StormerCowell type. This collocation method is preferred because it is selfstarting and it is convenient for easy generation of block or parallel schemes. Also the paper will consider various properties and conditions for a convergent method.
2. Theoretical Procedure
The procedure for the derivation of our methods in a multistep collocation technique is discussed by the methods in previous papers by Okunuga and Ehigie [1] and Ehigie et al. [6].
Consider the secondorder equation
The numerical solution to (2.1) can be obtained using a step explicit Linear Multistep Method (LMM) of the form where , , and is a discrete point at node point . Where, and are parameters to be determined and usually for an explicit scheme.
Most of the problems encountered in solving the general secondorder equation (2.1) is in the evaluation of the derivative term present in the equation. This often makes different authors to either reduce the secondorder equation to system of firstorder ordinary differential equations or are restricted to solve the equation of the form , while is set to zero. However, by the introduction a of continuous scheme, this is easily taken care of. Thus if is a basis polynomial of the form
To derive an point block method, where is a positive integer, we set for an explicit scheme or for an implicit scheme, interpolating (2.3) at points , , and collocating at points , , will result to a system of equation for arbitrary , Okunuga and Ehigie [1],
The coefficients are obtained and substituted in (2.3) to obtain the Continuous Linear Multistep Scheme (CLMS) of the form
This is evaluated for at , to obtain an point block method generally represented by Fatunla [10]. With the vector and specified as,
The block, point EBM will be generally represented as where and , , are square matrix with elements , for . The block scheme (2.7) is explicit if the coefficient Matrix is a null matrix.
3. Derivation of Explicit Block Methods
To derive a 1 block 3point Explicit Block Method (EBM) that is, , we set . Let be a basis function so that while we interpolate (3.1) at point and and collocate at , , and to obtain a system of equations Solving the matrix equation above, we obtain
Substituting the values , and in (3.1), we obtain the CLMS
On evaluating (3.4) at points , we obtained the convergent explicit 3point EBM as
Differentiating (3.4) and evaluating again at the same 3 discrete points of , we obtain a block of firstorder derivatives which can be used to determine the derivative term in the initial value problem (2.1).
Expressing the schemes (3.5) as block using previous definition (2.7), we obtain
Equation (3.7) is therefore said to be of the form (2.7). Thus (3.7) is represented notationally as .
4. Derivation of Implicit Block Methods
To derive a 1 block 3point Implicit Block Method (IBM), we also define the following terms:
The 3 point IBM will be generally represented as where , , and are square matrix. Let be a basis function so that Setting for an implicit 3point block scheme, we will interpolate (4.3) at points and and collocate at 6 points , , to obtain a system of equations represented by the matrix Solving the matrix equation, we obtain
Substituting the in (4.3), we obtain the CLMS,
On evaluating (4.6) at points and , we obtain the 3point implicit block Linear Multistep methods
On differentiating (4.6) and evaluating again at the same 3 discrete points of , we obtain
The derivative formulae will be used to obtain the first derivative term in (2.1). Expressing the schemes (4.7) as block using our previous definition according to Fatunla [10], (4.7) becomes
This scheme is also of the form (4.2).
5. Order, Consistency, Stability, and Convergence of the Methods
5.1. Order of the Methods
The methods (3.5) and (4.7) so derived are methods belonging to the class of LMM (2.2). So, if LMM (2.2) is a method associated with a linear difference operator, where is an arbitrary function continuously differentiable on the interval . The Taylors series expansion about the point , where
Definition 5.1. The method (2.2) is said to be of order if
is the error constant and is the truncation error at point .
Applying this definition to the individual methods (3.5) and (4.7) which make up the block explicit and implicit methods which is of the form (2.2), it is easily verified that each of the explicit methods (3.5) is of order with error constants . Also applying this definitions on the implicit methods (4.7), the implicit method was of order with error constants .
Definition 5.2. A Linear Multistep Method of the form (2.2) is said to be consistent if the LMM is of order .
Since the methods derived in (3.5) and (4.7) are of order , therefore, the methods are consistent according to Definition 5.2.
5.2. 0Stability of the Method
From literature, it is known that stability of a linear multistep method determines the manner in which the error is propagated as the numerical computation proceeds. Hence, it would be necessary to investigate the stability properties of the newly developed methods. In this paper, the 0stability and the Region of Absolute Stability (RAS) of the methods are discussed.
Definition 5.3. The first characteristic polynomial, , associated with the linear multistep method (2.2), where it is the polynomial of degree whose coefficients are and the second characteristic polynomial whose coefficients are , is defined by where , is a set of complex numbers and a free variable. Stability is determined by the location of the roots of the characteristic polynomial.
Definition 5.4. The block method of form (2.7) and (4.2) is said to be 0stable if the roots , , of the first characteristic polynomial , , satisfy . If one of the roots is +1, we call the roots the principal roots of .
Definition 5.5. The Region of Absolute Stability (RAS) of methods of (2.7) and (4.2) is the set However, in this paper, the boundary locus method will be used to plot and view the RAS. This is obtained using the first and second characteristic polynomials as Resolving this to real and imaginary parts and evaluating for values of give the region of stability on a graph.
The stability property of the 3point EBM is determined by applying the scheme (3.7) to the test problem, . By setting , the block scheme (3.7) becomes This is of the form . The stability polynomial of this is given as Hence the stability polynomial of the 3point EBM (3.7) is Substituting in (5.9), we obtain all the roots of the derived equation to be less than or equal to 1; hence it shows that the 3point EBM generated is 0stable.
Similarly, this is extended to the 3point implicit block method (IBM) given in (4.9) and the stability polynomial obtained is which gives Substituting in (5.11), we obtain all the roots of the derived equation to be less than or equal to 1; hence it shows that the 3point IBM generated is 0stable.
Theorem 5.6. The LMM (2.2) is convergent iff it is consistent and 0Stable.
The proof is given in Fatunla [11] and Lambert [12].
Since the consistency and 0stability of the methods have been established, then the explicit block method (3.5) and the implicit block method (4.7) are convergent.
The Region of Absolute Stability (RAS) of the block methods in this paper are drawn based on the third scheme of the block. The RAS of the linear multistep methods in the EBM (3.5) is drawn with the Maple software and displayed in Figure 1 below while the RAS for the implicit block method (4.7) is displayed in Figure 2.
It is observed that the RAS of the IBM is wider in range than the RAS of the EBM. This means that the implicit schemes will cope with Initial Value Problems better than the EBM in implementation with a higher step length.
6. Implementation of Schemes Generated
A Matlab code was developed for the implementation of the schemes in Sections 3 and 4 above. The code was designed so that it determines the initial points of the starting block methods with the analytical solution if it exists.
Thereafter it generated the values for , , and , using the block schemes directly for the explicit schemes and predictorcorrector technique for the implicit schemes using a fixed step size . So for corrections, the sequence of computation follows the , where , , and denote Predicting, Evaluating and Correcting as it is generally used in PredictorCorrector modes for numerical computations with a desired accuracy Lambert [12].
7. Numerical Experiment
7.1. Experimental Problems
In this paper three standard problems are considered and our newly developed methods are used to solve these problems. The problems are presented below.
Problem 1. Consider the test problem for secondorder ODE given by
This problem is known to have an analytical solution of , and the results are presented in Table 1.

Problem 2. The Van der Pol equation which describes the Van der Pol oscillator is the secondorder ODE
and it assumes some real positive numbers and . The problem was named after B. Van der Pol in 1926. This equation has attracted a lot of research attention both in nonlinear mechanics and control theory. This equation has no solution in terms of known tabulated transcendental function Fatunla [11]. To solve this directly using the schemes generated, we solve for , , and with . However, as , (7.2) has the analytical solution
The results are presented using Maximum Error which is given in Table 2.

Problem 3. The third problem is the second order ODE
with exact solution
The results obtained by using the 3point EBM and IBM are presented in Table 3.

7.2. Numerical Results
The Numerical results for the solution of the problems illustrated in the previous subsection will be presented in form of the Maximum Error.
It would be observed that in Problems 2, the explicit methods compare favourably with the implicit scheme but the accuracy of the methods increases as decreases. Whereas in Problems 1 and 3 the explicit block methods produce a poorer result compared to the implicit method. However, in Problem 3 the explicit method failed for a step length , 0.005, and 0.0025, while the implicit method shows its superiority by producing results.
8. Conclusion
We have been able to derive some 3point Implicit and Explicit Block Methods via collocation multistep technique. This block schemes derived in this paper have been represented in form of (2.7), which is a representation given by Fatunla [10]. This representation of the schemes generated as a single block methods will yield 3 points on implementation. The Order, Stability, Consistency, and Convergence of these schemes were established as stated. These derived methods were implemented on standard mechanical problems and their results were found to be sufficiently accurate for various values of step length.
References
 S. A. Okunuga and J. Ehigie, “A new derivation of continuous collocation multistep methods using power series as basis function,” Journal of Modern Mathematics and Statistics, vol. 3, no. 2, pp. 43–50, 2009. View at: Google Scholar
 P. Onumanyi, D. O. Awoyemi, S. N. Jator, and U. W. Sirisena, “New linear multistep methods with continuous coefficients for first order IVPs,” Journal of the Nigerian Mathematical Society, vol. 13, pp. 37–51, 1994. View at: Google Scholar
 R. L. Brown, “Some characteristics of implicit multistep multiderivative integration formulas,” SIAM Journal on Numerical Analysis, vol. 14, no. 6, pp. 982–993, 1977. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 P. Onumanyi, J. Fatokun, and B. O. Adejo, “Accurate numerical differentiation by continuous integrators for ordinary differential equations,” Journal of the Nigerian Mathematical Society, vol. 27, pp. 69–90, 2008. View at: Google Scholar  Zentralblatt MATH
 F. Ismail, L. K. Yap, and O. Mohamad, “Explicit and implicit 3point block methods for solving special second order ordinary differential equations directly,” International Journal of Mathematical Analysis, vol. 3, no. 5, pp. 239–254, 2009. View at: Google Scholar  Zentralblatt MATH
 J. O. Ehigie, S. A. Okunuga, and A. B. Sofoluwe, “On generalized 2step continuous linear multistep method of hybrid type for the integration of second order ordinary differential equations,” Archives of Applied Science Research, vol. 2, no. 6, pp. 362–372, 2010. View at: Google Scholar
 W. E. Milne, Numerical Solution of Differential Equations, John Wiley & Sons, New York, NY, USA, 1953.
 J. B. Rosser, “A RungeKutta for all seasons,” SIAM Review, vol. 9, pp. 417–452, 1967. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 L. F. Shampine and H. A. Watts, “Block implicit onestep methods,” Mathematics of Computation, vol. 23, pp. 731–740, 1969. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 S. O. Fatunla, “Parallel methods for second order ODEs,” in Monogragh Computational Ordinary Differential Equations, S. O. Fatunla, Ed., pp. 87–99, University Press Plc, Ibadan, Nigeria, 1992. View at: Google Scholar
 S. O. Fatunla, Numerical Methods for Fatunla Initial Value Problems in Ordinary Differential Equations, Academic Press, New York, NY, USA, 1988.
 J. D. Lambert, Computational Methods in Ordinary Differential Equations, John Wiley & Sons, New York, NY, USA, 1973.
Copyright
Copyright © 2011 J. O. Ehigie et al. 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.