Some implementation aspects of the general linear methods withinherent Runge-Kutta stability
Authors
Abstract:
In this paper we try to put different practical aspects of the general linear methods discussed in the papers [1,6,7] under one algorithm to show more details of its implementation. With a proposed initial step size strategy this algorithm shows a better performance in some problems. To illustrate the efficiency of the method we consider some standard test problems and report more useful details of step size and order changes, and number of rejected and accepted steps along with relative global errors.
similar resources
General linear methods with inherent Runge-Kutta stability
General linear methods were derived approximately thirty years ago as a unifying approach for the study of consistency, stability and convergence of the Runge-Kutta and the linear multistep methods. Their discovery opened the possibility of obtaining essentially new methods which were neither Runge-Kutta nor linear multistep methods nor slight variations of these methods. It was hoped that gene...
full textLinear Stability of Partitioned Runge-Kutta Methods
We study the linear stability of partitioned Runge–Kutta (PRK) methods applied to linear separable Hamiltonian ODEs and to the semidiscretization of certain Hamiltonian PDEs. We extend the] by presenting simplified expressions of the trace of the stability matrix, tr Ms, for the Lobatto IIIA–IIIB family of symplectic PRK methods. By making the connection to Padé approximants and continued fract...
full textOn Error Estimation In General Linear Methods: Runge Kutta (Rk) And Almost Runge-Kutta (Ark) Methods
Abstract— General linear methods (GLM) apply to a large family of numerical methods for ordinary differential equations, with RungeKutta (RK) and Almost Runge-Kutta (ARK) methods as two out of a number of special cases. In this paper, we have investigated the efficacy of Richardson extrapolation (RE) technique as a means of obtaining viable and acceptable estimates of the local truncation error...
full textStability of Runge–Kutta–Nyström methods
In this paper, a general and detailed study of linear stability of Runge–Kutta–Nyström (RKN) methods is given. In the case that arbitrarily stiff problems are integrated, we establish a condition that RKN methods must satisfy so that a uniform bound for stability can be achieved. This condition is not satisfied by any method in the literature. Therefore, a stable method is constructed and some ...
full textSome Properties of Symplectic Runge-kutta Methods
We prove that to every rational function R(z) satisfying R(−z)R(z) = 1, there exists a symplectic Runge-Kutta method with R(z) as stability function. Moreover, we give a surprising relation between the poles of R(z) and the weights of the quadrature formula associated with a symplectic Runge-Kutta method.
full textGPU Implementation of Implicit Runge-Kutta Methods
Runge-Kutta methods are an important family of implicit and explicit iterative methods used for the approximation of solutions of ordinary differential equations. Explicit RungeKutta methods are unsuitable for the solution of stiff equations as their region of stability is small. Stiff equation is a differential equation for which certain numerical methods for solving the equation are numerical...
full textMy Resources
Journal title
volume 3 issue None
pages 63- 76
publication date 2008-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023