Relaxation Runge–Kutta Methods for Hamiltonian Problems

Hendrik Ranocha; David I. Ketcheson

doi:10.1007/s10915-020-01277-y

Relaxation Runge–Kutta Methods for Hamiltonian Problems

Hendrik Ranocha, David I. Ketcheson

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

Abstract

The recently-introduced relaxation approach for Runge–Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge–Kutta methods in this context. We find that, in addition to their useful conservation property, the relaxation methods yield other improvements. Experiments show that their solutions bear stronger qualitative similarity to the true solution and that the error grows more slowly in time. We also prove that these methods are superconvergent for a certain class of Hamiltonian systems.

Original language	English (US)
Journal	Journal of Scientific Computing
Volume	84
Issue number	1
DOIs	https://doi.org/10.1007/s10915-020-01277-y
State	Published - Jul 9 2020

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authours would like to thank Ernst Hairer for a discussion of symplecticity and the preservation of phase space volume.

Access to Document

10.1007/s10915-020-01277-y

https://repository.kaust.edu.sa/bitstream/10754/661682/1/Ranocha_Ketcheson__2020__RRK_methods_for_Hamiltonian_problems__arXiv.pdf

Cite this

@article{bb841b85b52b403f9989e082f08fa9c6,

title = "Relaxation Runge–Kutta Methods for Hamiltonian Problems",

abstract = "The recently-introduced relaxation approach for Runge–Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge–Kutta methods in this context. We find that, in addition to their useful conservation property, the relaxation methods yield other improvements. Experiments show that their solutions bear stronger qualitative similarity to the true solution and that the error grows more slowly in time. We also prove that these methods are superconvergent for a certain class of Hamiltonian systems.",

author = "Hendrik Ranocha and Ketcheson, {David I.}",

note = "KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authours would like to thank Ernst Hairer for a discussion of symplecticity and the preservation of phase space volume.",

year = "2020",

month = jul,

day = "9",

doi = "10.1007/s10915-020-01277-y",

language = "English (US)",

volume = "84",

journal = "Journal of Scientific Computing",

issn = "0885-7474",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Relaxation Runge–Kutta Methods for Hamiltonian Problems

AU - Ranocha, Hendrik

AU - Ketcheson, David I.

N1 - KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authours would like to thank Ernst Hairer for a discussion of symplecticity and the preservation of phase space volume.

PY - 2020/7/9

Y1 - 2020/7/9

N2 - The recently-introduced relaxation approach for Runge–Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge–Kutta methods in this context. We find that, in addition to their useful conservation property, the relaxation methods yield other improvements. Experiments show that their solutions bear stronger qualitative similarity to the true solution and that the error grows more slowly in time. We also prove that these methods are superconvergent for a certain class of Hamiltonian systems.

AB - The recently-introduced relaxation approach for Runge–Kutta methods can be used to enforce conservation of energy in the integration of Hamiltonian systems. We study the behavior of implicit and explicit relaxation Runge–Kutta methods in this context. We find that, in addition to their useful conservation property, the relaxation methods yield other improvements. Experiments show that their solutions bear stronger qualitative similarity to the true solution and that the error grows more slowly in time. We also prove that these methods are superconvergent for a certain class of Hamiltonian systems.

UR - http://hdl.handle.net/10754/661682

UR - http://link.springer.com/10.1007/s10915-020-01277-y

U2 - 10.1007/s10915-020-01277-y

DO - 10.1007/s10915-020-01277-y

M3 - Article

SN - 0885-7474

VL - 84

JO - Journal of Scientific Computing

JF - Journal of Scientific Computing

IS - 1

ER -

Relaxation Runge–Kutta Methods for Hamiltonian Problems

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this