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

01/23/2023

∙

by Misha Stepanov, et al.

∙

The University of Arizona

∙

Using simplifying assumptions that are related to the time reversal symmetry, a 1-dimensional family of 8-stage pseudo-symplectic Runge-Kutta methods of order (4, 8) is derived. An example of 7-stage method of order (4, 9) is given.

READ FULL TEXT

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

Two continuous (4, 5) pairs of explicit 9-stage Runge-Kutta methods

Generalized explicit pseudo two-step Runge-Kutta-Nyström methods for solving second-order initial value problems

Embedded (4, 5) pairs of explicit 7-stage Runge-Kutta methods with FSAL property

A Comprehensive Study of Pseudo-tested Methods

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

A Silicon Valley Love Triangle: Hiring Algorithms, Pseudo-Science, and the Quest for Auditability

Discrete Adjoint Implicit Peer Methods in Optimal Control

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

Related Research

Two continuous (4, 5) pairs of explicit 9-stage Runge-Kutta methods

Generalized explicit pseudo two-step Runge-Kutta-Nyström methods for solving second-order initial value problems

Embedded (4, 5) pairs of explicit 7-stage Runge-Kutta methods with FSAL property

A Comprehensive Study of Pseudo-tested Methods

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

A Silicon Valley Love Triangle: Hiring Algorithms, Pseudo-Science, and the Quest for Auditability

Discrete Adjoint Implicit Peer Methods in Optimal Control