Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4642475 | Journal of Computational and Applied Mathematics | 2007 | 13 Pages |
Abstract
We describe a construction of continuous extensions to a new representation of two-step Runge–Kutta methods for ordinary differential equations. This representation makes possible the accurate and reliable estimation of local discretization error, facilitates the efficient implementation of these methods in variable stepsize environment, and adapts readily to the numerical solution of a class of delay differential equations. A number of numerical tests carried out on the obtained methods of order 3 with quadratic interpolants show their efficiency and robust performance which allow them to compete with the state-of-the-art dde23 code from Matlab.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Z. Bartoszewski, Z. Jackiewicz,