Relaxation Runge–Kutta Methods for Hamiltonian Problems
نویسندگان
چکیده
منابع مشابه
Effective order strong stability preserving RungeKutta methods
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...
متن کاملHamiltonian relaxation
Due to the complexity of the required numerical codes, many of the new formulations for the evolution of gravitational fields in numerical relativity are not tested on binary evolutions. We introduce in this paper a new testing ground for numerical methods based on the simulation of binary neutron stars. This numerical set-up is used to develop a new technique, the Hamiltonian relaxation (HR), ...
متن کاملRelaxation times for Hamiltonian systems
Usually, the relaxation times of a gas are estimated in the frame of the Boltzmann equation. In this paper, instead, we deal with the relaxation problem in the frame of the dynamical theory of Hamiltonian systems, in which the definition itself of a relaxation time is an open question. We introduce a lower bound for the relaxation time, and give a general theorem for estimating it. Then we give...
متن کاملPartitioned Runge-kutta Methods for Separable Hamiltonian Problems
Separable Hamiltonian systems of differential equations have the form dp/dt = -dH/dq, dq/dt = dH/dp, with a Hamiltonian function H that satisfies H = T(p) + K(q) (T and V are respectively the kinetic and potential energies). We study the integration of these systems by means of partitioned Runge-Kutta methods, i.e., by means of methods where different Runge-Kutta tableaux are used for the p and...
متن کاملConstruction of nearly conservative multivalue numerical methods for Hamiltonian problems
The purpose of this paper is the derivation of multivalue numerical methods for Hamiltonian problems. It is known from the literature that such methods cannot be symplectic; however, they can satisfy an alternative property, known as G-symplecticity, which still allows a long time conservation of the Hamiltonian of the dynamical system under investigation. New G-symplectic methods are derived a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2020
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-020-01277-y