The existence of symplectic general linear methods
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)
The paper obtains a criterion that any general linear integration method must satisfy if it is symplectic. After deriving a criterion for symplectic behavior based on a standard conservative problem of the form, \[ \begin{cases} z_1'(t)= -\alpha(z_3,z_4,\dots,z_N)z_2(t), \\ z_2'(t)= \alpha(z_3,z_4,\dots,z_N)z_1(t), \\ z_i'(t)=f_i(z_3,z_4,\dots,z_N)z_1(t), \quad i=3,4\dots,N, \end{cases} \] where the linear factor \(\alpha\) can take on different values at the stages of the numerical method, the authors give a linear algebraic condition satisfied by all symplectic general methods. As a result of this discussion, the authors address the reducibility problem of a general linear method with \(s\) stages and \(r\) inputs. Although the question of full reducibility is not considered in general, the main contribution of the paper is to prove that if a method with \(r>1\) exhibits symplectic behavior, then it is reducible to a method with \(r=1\). In other words, the main theorem states that a stable, irreducible, general linear method with \(r>1\) cannot be symplectic, and so linking the criterion of the paper to that for Runge-Kutta methods.
- Quadratic invariants and symplectic structure of general linear methods
- Order conditions for G-symplectic methods
- Construction of \(G\)- or \(G (\epsilon)\)-symplectic general linear methods
- Symplectic properties of multistep Runge-Kutta methods.
- Reducibility and characterization of symplectic Runge-Kutta methods
- G-symplectic integration of many body problems
- Partitioned second derivative methods for separable Hamiltonian problems
- General linear methods with projection
- Projection of second derivative methods for ordinary differential equations with invariants
- Nearly conservative multivalue methods with extended bounded parasitism
- Partitioned general linear methods for separable Hamiltonian problems
- G-symplecticity implies conjugate-symplecticity of the underlying one-step method
- A symmetric nearly preserving general linear method for Hamiltonian problems
- Quadratic invariants and symplectic structure of general linear methods
- G-symplectic second derivative general linear methods for Hamiltonian problems
- Numerical integration of Hamiltonian problems by G-symplectic methods
- Dealing with Parasitic Behaviour in G-Symplectic Integrators
- Multi-value numerical methods for Hamiltonian systems
- On properties of adjoint systems for evolutionary PDEs
- Symmetric general linear methods
- The cohesiveness of G-symplectic methods
- Order conditions for G-symplectic methods
This page was built for publication: The existence of symplectic general linear methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027771)
