全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

An Accurate Block Solver for Stiff Initial Value Problems

DOI: 10.1155/2013/567451

Full-Text   Cite this paper   Add to My Lib

Abstract:

New implicit block formulae that compute solution of stiff initial value problems at two points simultaneously are derived and implemented in a variable step size mode. The strategy for changing the step size for optimum performance involves halving, increasing by a multiple of 1.7, or maintaining the current step size. The stability analysis of the methods indicates their suitability for solving stiff problems. Numerical results are given and compared with some existing backward differentiation formula algorithms. The results indicate an improvement in terms of accuracy. 1. Introduction Stiff problems occur in many fields of engineering science and they represent coupled physical systems having components varying with very different time scales [1]. Some physical examples include chemical kinetics where reactions go at very different speeds and in circuit simulation where components respond at widely different time scales. A considerable research has been done on numerical methods for solving stiff initial value problems (IVPs) of the following form: The most successful ones are implicit in nature. Examples include single step methods like the diagonally implicit Runge Kutta (DIRK) methods, single diagonally implicit Runge-Kutta (SDIRK), and singly implicit Runge-Kutta methods [2–4]. Also well known are methods based on Richardson extrapolation and deferred correction schemes [5–8]. Others are multistep methods like the backward differentiation formula (BDF) (see, e.g., [4]). Initially, the BDF methods are known to be -stable only up to order 2 [9]. However, Cash in [10] proved that the barrier in [9] can be circumvented by adding extra future point to produce higher order -stable methods. Methods of this type are known as extended backward differentiation formula [10–12]. Some block methods for stiff problems are also known to be A-stable and have order greater than two (see, e.g., [13–18]). One of the motivation of this paper is to develop a new block method based on the block backward differentiation formula [13, 14, 17]. The method is similar in fashion with that in [15] but differs greatly by the choice of the constant . Furthermore, our choice of gives rise to different formulae with better stability regions than in [15], even with the choice of the same step ratio . In the following sections of the paper, we will present the derivation of the method, its stability analysis, and implementation. Standard test problems will also be presented and a comparison of their numerical results with some known stiff solvers will be given. 2. Formulation of

References

[1]  L. Brugnano, F. Mazzia, and D. Trigiante, “Fifty years of stiffness,” in Recent Advances in Computational and Applied Mathematics, pp. 1–21, 2011.
[2]  J. álvarez and J. Rojo, “An improved class of generalized Runge-Kutta methods for stiff problems. I. The scalar case,” Applied Mathematics and Computation, vol. 130, no. 2-3, pp. 537–560, 2002.
[3]  K. Dekker and J. G. Verwer, Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations, vol. 984, North-Holland, Amsterdam, The Netherlands, 1984.
[4]  E. Hairer and G. Wanner, Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems, vol. 2, Springer, New York, NY, USA, 2004.
[5]  K. Bohmer and H. J. Stetter, Defect Correction Methods: Theory and Applications, vol. 5, Springer, New York, NY, USA, 1984.
[6]  R. Frank and C. W. Ueberhuber, “Iterated defect correction for the efficient solution of stiff systems of ordinary differential equations,” BIT Numerical Mathematics, vol. 17, no. 2, pp. 146–159, 1977.
[7]  B. Gustafsson and W. Kress, “Deferred correction methods for initial value problems,” BIT Numerical Mathematics, vol. 41, no. 5, pp. 986–995, 2001.
[8]  A. T. Layton and M. L. Minion, “Implications of the choice of quadrature nodes for Picard integral deferred corrections methods for ordinary differential equations,” BIT Numerical Mathematics, vol. 45, no. 2, pp. 341–373, 2005.
[9]  G. G. Dahlquist, “A special stability problem for linear multistep methods,” BIT Numerical Mathematics, vol. 3, pp. 27–43, 1963.
[10]  J. R. Cash, “On the integration of stiff systems of O.D.E.s using extended backward differentiation formulae,” Numerische Mathematik, vol. 34, no. 3, pp. 235–246, 1980.
[11]  J. R. Cash, “Modified extended backward differentiation formulae for the numerical solution of stiff initial value problems in ODEs and DAEs,” Journal of Computational and Applied Mathematics, vol. 125, no. 1-2, pp. 117–130, 2000.
[12]  H. Musa, M. B. Suleiman, and F. Ismail, “A-stable 2-point block extended backward differentiation formula for solving stiff ordinary differential equations,” AIP Conference Proceedings, vol. 1450, pp. 254–258, 2012.
[13]  Z. B. Ibrahim, K. I. Othman, and M. Suleiman, “Implicit -point block backward differentiation formula for solving first-order stiff ODEs,” Applied Mathematics and Computation, vol. 186, no. 1, pp. 558–565, 2007.
[14]  Z. B. Ibrahim, M. Suleiman, and K. I. Othman, “Fixed coefficients block backward differentiation formulas for the numerical solution of stiff ordinary differential equations,” European Journal of Scientific Research, vol. 21, no. 3, pp. 508–520, 2008.
[15]  M. B. Suleiman, H. Musa, F. Ismail, and N. Senu, “A new variable step size block backward differentiation formula for solving stiff IVPs,” International Journal of Computer Mathematics, 2013.
[16]  J. Williams and F. de Hoog, “A class of -stable advanced multistep methods,” Mathematics of Computation, vol. 28, pp. 163–177, 1974.
[17]  S. A. M. Yatim, Z. B. Ibrahim, K. I. Othman, and M. B. Suleiman, “A quantitative comparison of numerical method for solving stiff ordinary differential equations,” Mathematical Problems in Engineering, vol. 2011, Article ID 193691, 12 pages, 2011.
[18]  S. A. M. Yatim, Z. B. Ibrahim, K. I. Othman, and M. B. Suleiman, “A numerical algorithm for solving stiff ordinary differential equations,” Mathematical Problems in Engineering, vol. 2013, Article ID 989381, 11 pages, 2013.
[19]  D. Kushnir and V. Rokhlin, “A highly accurate solver for stiff ordinary differential equations,” SIAM Journal on Scientific Computing, vol. 34, no. 3, pp. A1296–A1315, 2012.
[20]  H. Aminikhah and M. Hemmatnezhad, “An effective modification of the homotopy perturbation method for stiff systems of ordinary differential equations,” Applied Mathematics Letters, vol. 24, no. 9, pp. 1502–1508, 2011.
[21]  J. D. Lambert, Computational Methods in Ordinary Differential Equations, John Wiley & Sons, New York, NY, USA, 1973.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133