Email this article CONSTRUCTING THE IMPLIMENTATION TO THE CONTINUOUS BLOCK BDF METHODS
About this article
Received: 19/05/20 Revised: 27/05/20 Published: 29/05/20Authors
1. Dinh Van Tiep, TNU - University of Technology2. Pham Thu Hang
, TNU - University of Technology
Abstract
The k-step methods of continuous block backward difference formula (or BDF) have great benefit to approximate the differential equation with the initial condition. These methods possessing very large absolute stability regions are especially useful for the stiff equations. This article presents a method of implementation to these k-step scheme by using the Newton’s iteration for the root finding problem of the non-linear multivariable case. Also, a program written in Matlab with a particular k is presented. The numerical experiments introduced to illustrate the efficiency and exactness of these scheme comparing with some conventional BDF methods.
Keywords
Full Text:
PDF (Tiếng Việt)References
[1]. O. A. Akinfenwa, S. N. Jator, and N. M. Yao, “Continuous block backward differentiation formula for solving stiff ordinary differential equations,” Computers & Mathematics with Applications, vol. 65, no. 7, pp. 996-1005, 2013.
[2]. O. A. Akinfenwa, S. N. Jator, and N. M. Yao, “On The Stability of Continuous Block Backward Differentiation Formula For
Solving Stiff Ordinary Differential Equations,” J. of Mod. Meth. in Numer. Math., vol. 3, no. 2, pp. 50-58, 2012.
[3]. J. R. Cash, “Review paper. Efficient numerical methods for the solution of stiff initial-value problems and differential algebraic equations,” Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci., vol. 459, no. 2032, pp. 797-815, 2003.
[4]. R. L. Burden, and J. D.Faires, Numerical Analysis, 9th Edition, Brooks/Cole, 2010.
Refbacks
- There are currently no refbacks.