The cohesiveness of G-symplectic methods

DOI10.1007/S11075-015-9964-YMaRDI QIDQ891785zbMATH OpenOpenAlexFDO

Authors J. C. Butcher

Publication date 17 November 2015

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-015-9964-y

zbMATH Keywords

Cauchy problemcohesivenessG-symplectic methodHénon-Heiles probleminternal startinginvarianceone step methodparasitic growthsymplectic methodsystem of ODE

Mathematics Subject Classification ID

Nonlinear ordinary differential equations and systems (34A34) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for Hamiltonian systems including symplectic integrators (65P10)

Review text

The author shortly reviews the G-symplectic methods, previously introduced by himself, provides an example of such method, the so-called 4123A method and illustrates the deleterious effect of parasitism. Then he is concerned with the G-symplectic methods with zero parasitic growth and introduces the concept of cohesiveness. This concept has been revealed in order ``to describe the holding together of the multiple values generated as output from one step. For a G-symplectic method in partitioned diagonal form, the main result shows the slow growth of the deviation from cohesiveness. Eventually, it is numerically confirmed for the above mentioned method.

Recommendations

• The symplecticity of multi-step methods
• G-symplectic integration of many body problems
• Order conditions for G-symplectic methods
• On the G-symplecticity of two-step Runge-Kutta methods
• The existence of symplectic general linear methods
• Construction of \(G\)- or \(G (\epsilon)\)-symplectic general linear methods
• G-symplecticity implies conjugate-symplecticity of the underlying one-step method
• Some notes on the stability of symplectic methods
• A new class of \(G ( \epsilon )\)-symplectic general linear methods
• Numerical integration of Hamiltonian problems by G-symplectic methods

Cites work

• An Algebraic Theory of Integration Methods
• Dealing with Parasitic Behaviour in G-Symplectic Integrators
• General linear methods
• General linear methods: Connection to one step methods and invariant curves
• scientific article; zbMATH DE number 88931 (Why is no real title available?)
• scientific article; zbMATH DE number 702482 (Why is no real title available?)
• Multi-step methods are essentially one-step methods
• Numerical Methods for Ordinary Differential Equations
• On the Butcher group and general multi-value methods
• Order conditions for G-symplectic methods
• Runge-Kutta schemes for Hamiltonian systems
• The control of parasitism in \(G\)-symplectic methods

Cited in

(6)

• Composite symmetric second derivative general linear methods for Hamiltonian systems
• Projection of second derivative methods for ordinary differential equations with invariants
• Partitioned general linear methods for separable Hamiltonian problems
• G-symplectic second derivative general linear methods for Hamiltonian problems
• Runge-Kutta methods for ordinary differential equations
• Dealing with Parasitic Behaviour in G-Symplectic Integrators

This page was built for publication: The cohesiveness of G-symplectic methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891785)