Commutator-free Lie group methods with minimum storage requirements and reuse of exponentials

07/08/2020
by   Alexei Bazavov, et al.
0

A new format for commutator-free Lie group methods is proposed based on explicit classical Runge-Kutta schemes. In this format exponentials are reused at every stage and the storage is required only for two quantities: the right hand side of the differential equation evaluated at a given Runge-Kutta stage and the function value updated at the same stage. The next stage of the scheme is able to overwrite these values. The result is proven for a 3-stage third order method and a conjecture for higher order methods is formulated. Five numerical examples are provided in support of the conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2021

Lie Group integrators for mechanical systems

Since they were introduced in the 1990s, Lie group integrators have beco...
research
10/23/2018

Fixing Match-Fixing

In the soccer World Cup, at the group stage, before the knock-out stage,...
research
02/08/2021

Higher Strong Order Methods for Itô SDEs on Matrix Lie Groups

In this paper we present a general procedure for designing higher strong...
research
01/23/2023

Eight-stage pseudo-symplectic Runge-Kutta methods of order (4, 8)

Using simplifying assumptions that are related to the time reversal symm...
research
11/25/2021

Casimir preserving stochastic Lie-Poisson integrators

Casimir preserving integrators for stochastic Lie-Poisson equations with...
research
11/29/2022

Minimising the risk of tanking in tournaments with a preliminary round-robin group stage

Multi-stage tournaments consisting of a round-robin group stage followed...
research
07/26/2022

Recent insights on the Uniqueness Problem of Diffeomorphisms determined by Prescribed Jacobian Determinant and Curl

Variational Principle (VP) forms diffeomorphisms with prescribed Jacobia...

Please sign up or login with your details

Forgot password? Click here to reset