𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Runge-kutta schemes for Hamiltonian systems

✍ Scribed by J. M. Sanz-Serna

Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
380 KB
Volume
28
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The necessary condition for a Runge-Kutt
The necessary condition for a Runge-Kutta scheme to be symplectic for Hamiltonian systems
✍ Y.-F. Tang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 411 KB

## In this paper, beginning with the expansion of a Runge-Kutta scheme (Lemma l), the author introduces the so-called Y-T-type array for each irreducible one (Lemmss 2-3). As a study of the properties of Y-T-type arrays, the author establishes Lemmas 4-5, and then the key Theorem 1. The interestin

Multirate Runge–Kutta schemes for advect
Multirate Runge–Kutta schemes for advection equations
✍ Martin Schlegel; Oswald Knoth; Martin Arnold; Ralf Wolke 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 905 KB

a b s t r a c t Explicit time integration methods can be employed to simulate a broad spectrum of physical phenomena. The wide range of scales encountered lead to the problem that the fastest cell of the simulation dictates the global time step. Multirate time integration methods can be employed to

Numerical smoothing of Runge–Kutta schem
Numerical smoothing of Runge–Kutta schemes
✍ Tong Sun 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 552 KB

First we give an intuitive explanation of the general idea of [1]: consistency and numerical smoothing implies convergence and, in addition, enables error estimates. Then, we briefly discuss some of the advantages of numerical smoothing over numerical stability in error analysis. The main aim of th

IMEX Runge–Kutta schemes for reaction–di
IMEX Runge–Kutta schemes for reaction–diffusion equations
✍ Toshiyuki Koto 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 703 KB

A fundamental research is carried out into convergence and stability properties of IMEX (implicit-explicit) Runge-Kutta schemes applied to reaction-diffusion equations. It is shown that a fully discrete scheme converges if it satisfies certain conditions using a technique of the B-convergence analys