Pseudo-symplectic Runge-Kutta methods (Q1272872)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1228548
Language Label Description Also known as
default for all languages
No label defined
    English
    Pseudo-symplectic Runge-Kutta methods
    scientific article; zbMATH DE number 1228548

      Statements

      Pseudo-symplectic Runge-Kutta methods (English)
      0 references
      0 references
      0 references
      7 March 1999
      0 references
      The aim of the paper is the construction of explicit \(s\)-stage Runge-Kutta methods of order \((p,2p)\), that is of linear order \(p\) and pseudo-symplecticness order \(2p\), \(p= 2,3,4\) for Hamiltonian systems. (A Runge-Kutta method is said to be of linear order \(p\), if it is of order \(p\) for linear problems.) The concept of pseudo-symplecticness is introduced and using the theory of trees and \(B\)-series, pseudo-symplecticness conditions up to order 6 are given. A simplification of assumptions is also found. Numerical experiments show that pseudo-symplectic methods seem to offer a good accuracy and efficiency.
      0 references
      symplectic Runge-Kutta methods
      0 references
      pseudosymplectic Runge Kutta methods
      0 references
      Hamiltonian systems
      0 references
      pseudo-symplecticness conditions
      0 references
      numerical experiments
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references