Research Article  Open Access
I. S. M. Zawawi, Z. B. Ibrahim, F. Ismail, Z. A. Majid, "Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations", International Journal of Mathematics and Mathematical Sciences, vol. 2012, Article ID 767328, 8 pages, 2012. https://doi.org/10.1155/2012/767328
Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations
Abstract
This paper focuses on the derivation of diagonally implicit twopoint block backward differentiation formulas (DI2BBDF) for solving firstorder initial value problem (IVP) with two fixed points. The method approximates the solution at two points simultaneously. The implementation and the stability of the proposed method are also discussed. A performance of the DI2BBDF is compared with the existing methods.
1. Introduction
Most real life problems that arise in various fields of study such as engineering or science are constructed as mathematical models before they are solved. These models often lead to differential equations. A differential equation can simply be defined as an equation that contains a derivative. In this paper, we are concerned with the numerical solution of IVP with two fixed points of the general form given initial values , where and is a bounded realvalued function with continuous derivatives. See; [1] how the problem may be simplified and we can assume that the fixed points are and . The aim of this paper is to introduce a new block method which is called diagonally implicit two point block backward differentiation formulas. Basically, block method is a method which is used to compute previous blocks and to calculate the current block where each block contain points. Ibrahim et al. [2] gave the general form for point block as where and are by matrices.
The rapid growth of the studies on the block methods for solving ODEs contribute to the competition in developing and deriving an accurate method for solving many types of ODEs. Among the earliest research on block methods was proposed by Shampine and Watts [3] with block implicit one step method, Cash [4] with modified extended backward differential formulas, Chu and Hamilton [5] with multiblock methods, Majid and Suleiman [6] with fully implicit block method for solving ODEs. The most recent study of block method is on computing block approximation known as block backward differentiation formulas (BBDF) presented by Ibrahim et al. [7]. Diagonally implicit for multistep method are discussed by a few researchers such as Majid and Suleiman [8] with 4point diagonally implicit block method and Alexander [9] with diagonally implicit RungeKutta method for solving stiff ODEs. In this paper, we interested to compare the accuracy of the proposed method with the onestep predictorcorrector method (1SPCM) and PC ADAMS method studied by Aguiar and Ramos [1].
2. Formulation of Diagonally Implicit BBDF
In Figure 1, diagonally implicit 2point BBDF (DI2BBDF) will create two new equally spaced solution values simultaneously. Majid and Suleiman [8] stated that the method is called diagonally implicit because the coefficients of the upper triangular matrix entries are zero.
We will derive the formula to compute the approximate values of and simultaneously with two previous back values and . The formula was derived by using Lagrange interpolation polynomial which compute the solutions at and separately. Consider the polynomial of degree which interpolates the values, ,, of a function at interpolating points , ,, in terms of Lagrange polynomial defined as follows: where for each .
For , we defined and replace by polynomial (2.1) which interpolates only the values , , and at the interpolating points . Thus, differentiating the resulting polynomial once with respect to at the point and evaluating at gives the following:
Then, we interpolate the values , , , and at the interpolating points , , and differentiating the resulting polynomial once with respect to at the point and substituting yield
Therefore, the corrector formulae at and are given by
3. Stability of Diagonally Implicit BBDF
Many numerical methods depend on speed of convergence, computational expense and accuracy for the solution of initial value problems (IVPs). In this section, our aim is to identify the properties of linear stability of DI2BBDF. According to Shampine and Watts [3], the most critical limitation of block method is due to the existence of stability problems. The basic definition of zero stable for block method described by Ibrahim et al. [10]. The block method is said to be zerostable if the roots , of the first characteristic polynomial satisfy . If one of the roots is , we call this root the principal root of .
The linear stability properties are determined through application of the standard linear test problem Hence, we will construct the formulas that have been derived in the previous section, which is (2.6). Application of the standard linear test problem (3.1) to (2.6) gives the following Setting , we write (3.2) in the matrix coefficient specified as The first characteristic polynomial of (3.2) is given by
By solving and , we can determine the zero stable and yield and . Thus the diagonally implicit BBDF is zero stable. Since one of the roots is , we call this root as principal root.
4. Implementation of the Method
In this section, we were obtained the calculation of and using the Newton iteration. The DI2BBDF can be written in general form as where and are the backvalues.
To specify the iteration, the following notation is introduced. will denote the iterative value of , and let and . Newton iteration takes the form as below:
Substituting, and take the form
Similarly for the second point, gives
Hence, equation (4.3) and (4.4) in matrix form
Therefore, the approximation values of and are
5. Numerical Example
In this section, an autonomous problem with two fixed points considered for the purpose of validating the numerical results: The solution is .
Exact solution for is See Aguiar and Ramos [1].
We have tested the problem for and consider the step size, where with interval . The accuracy for all methods in terms of maximum error is shown in Table 1.

The notation used in the table takes the following meaning: : step size, MAX : maximum error, DI2BBDF: diagonally implicit 2point block backward differentiation formulas method, 1SPCM: onestep predictorcorrector method, PC ADAMS: explicit Euler as a predictor and trapezoidal rule as a corrector.
The maximum error is defined as follows: Maximum error = where NS is the number of steps.
In Figure 2, the numerical results obtained with the proposed method and existing methods are plotted. The exact and approximate solutions using are also plotted in Figure 3.
6. Conclusion
In this work, we have applied DI2BBDF as a numerical method for solving ordinary initial value problem with two fixed points. By reducing the step size , we observe that the value of maximum errors for DI2BBDF gets smaller. Furthermore, by comparing our results with the solutions obtained by the existing methods, we can conclude that DI2BBDF yields less accurate approximations. However, for the case of high dimension problem, DI2BBDF still performs well although as known that block backward differentiation formula is more effective for solving stiff initial value problems. In Figure 3, we can observe that both exact and approximate solutions of DI2BBDF are still increase towards the stable fixed point . For future research, we map out the strategy to improve the performance of this method by extending the order of the formula and modify the formula in a variablestep size for solving differential initial value problems with two fixed points.
References
 J. V. Aguiar and H. Ramos, “A numerical ODE solver that preserves the fixed points and their stability,” Journal of Computational and Applied Mathematics, vol. 235, no. 7, pp. 1856–1867, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Z. B. Ibrahim, M. B. Suleiman, and K. I. Othman, “Fixed coefficient block backward differentiation formula for the numerical solution of stiff odes,” Applied Mathematics and Computation, vol. 21, no. 3, pp. 508–520, 2008. View at: Google Scholar
 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
 J. R. Cash, “The integration of stiff initial value problems in ODEs using modified extended backward differentiation formulae,” Computers & Mathematics with Applications, vol. 9, no. 5, pp. 645–657, 1983. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 M. T. Chu and H. Hamilton, “Parallel solution of ODEs by multiblock methods,” SIAM Journal on Scientific and Statistical Computing, vol. 8, no. 3, pp. 342–353, 1987. View at: Publisher Site  Google Scholar
 Z. A. Majid and M. B. Suleiman, “Implementation of fourpoint fully implicit block method for solving ordinary differential equations,” Applied Mathematics and Computation, vol. 184, no. 2, pp. 514–522, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Z. B. Ibrahim, K. I. Othman, and M. Suleiman, “Implicit $r$point block backward differentiation formula for solving firstorder stiff ODEs,” Applied Mathematics and Computation, vol. 186, no. 1, pp. 558–565, 2007. View at: Publisher Site  Google Scholar
 Z. A. Majid and M. B. Suleiman, “Performance of four point diagonally implicit block method for solving first order stiff odes,” Department of Mathematics UTM, vol. 222, pp. 137–146, 2006. View at: Google Scholar
 R. Alexander, “Diagonally implicit RungeKutta methods for stiff o.d.e.'s,” SIAM Journal on Numerical Analysis, vol. 14, no. 6, pp. 1006–1021, 1977. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Z. B. Ibrahim, J. Rozita, and F. Ismail, “On the stability of fully implicit block backward differentiation formulae,” Department of Mathematics UTM, vol. 19, no. 2, pp. 83–89, 2003. View at: Google Scholar
Copyright
Copyright © 2012 I. S. M. Zawawi 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.