Numerical tests with gauss-type nested implicit runge-kutta formulas

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we conduct a detailed numerical analysis of the Gauss-type Nested Implicit Runge-Kutta formulas of order 4, introduced by Kulikov and Shindin in [4]. These methods possess many important practical properties such as high order, good stability, symmetry and so on. They are also conjugate to a symplectic method of order 6 at least. AU of these make them efficient for solving many nonstiff and stiff ordinary differential equations (including Hamiltonian and reversible systems). On the other hand, Nested Implicit Runge-Kutta formulas have only explicit internal stages, in the sense that they are easily reduced to a single equation of the same dimension as the source problem. This means that such Runge-Kutta schemes admit a cheap implementation in practice. Here, we check the above-mentioned properties numerically. Different strategies of error estimation are also examined with the purpose of finding an effective one. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kulikov, G. Y., & Shindin, S. K. (2007). Numerical tests with gauss-type nested implicit runge-kutta formulas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4487 LNCS, pp. 136–143). Springer Verlag. https://doi.org/10.1007/978-3-540-72584-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free