Interval Runge-Kutta Methods with Variable Step Sizes
نویسندگان
چکیده
منابع مشابه
Runge - Kutta Methods page RK 1 Runge - Kutta Methods
Literature For a great deal of information on Runge-Kutta methods consult J.C. Butcher, Numerical Methods for Ordinary Differential Equations, second edition, Wiley and Sons, 2008, ISBN 9780470723357. That book also has a good introduction to linear multistep methods. In these notes we refer to this books simply as Butcher. The notes were written independently of the book which accounts for som...
متن کاملAccelerated Runge-Kutta Methods
Standard Runge-Kutta methods are explicit, one-step, and generally constant step-size numerical integrators for the solution of initial value problems. Such integration schemes of orders 3, 4, and 5 require 3, 4, and 6 function evaluations per time step of integration, respectively. In this paper, we propose a set of simple, explicit, and constant step-size Accerelated-Runge-Kutta methods that ...
متن کاملOptimum Runge-Kutta Methods
The optimum Runge-Kutta method of a particular order is the one whose truncation error is a minimum. Various measures of the size of the truncation error are considered. The optimum method is practically independent of the measure being used. Moreover, among methods of the same order which one might consider using the difference in size of the estimated error is not more than a factor of 2 or 3...
متن کاملVariable Step Runge-Kutta-Nyström Methods for the Numerical Solution of Reversible Systems
Fixed step, symmetric Runge-Kutta-Nyström formulae have proved to be very efficient for the numerical integration of a large class of reversible second order systems of ordinary differential equations of the special form d 2y dt2 = f(t, y). However for some important classes of problems it is necessary, for the sake of efficiency, to allow a variable steplength of integration to be used and in ...
متن کاملStrong Stability Preserving Two-step Runge-Kutta Methods
We investigate the strong stability preserving (SSP) property of two-step Runge– Kutta (TSRK) methods. We prove that all SSP TSRK methods belong to a particularly simple subclass of TSRK methods, in which stages from the previous step are not used. We derive simple order conditions for this subclass. Whereas explicit SSP Runge–Kutta methods have order at most four, we prove that explicit SSP TS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Science and Technology
سال: 2019
ISSN: 1505-0602,2353-9453
DOI: 10.12921/cmst.2019.0000006