The necessary condition for a Runge-Kutta scheme to be symplectic for Hamiltonian systems (Q2367576)

From MaRDI portal
Revision as of 17:29, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
The necessary condition for a Runge-Kutta scheme to be symplectic for Hamiltonian systems
scientific article

    Statements

    The necessary condition for a Runge-Kutta scheme to be symplectic for Hamiltonian systems (English)
    0 references
    0 references
    15 December 1993
    0 references
    Beginning with the expansion of a Runge-Kutta scheme, the author introduces the so-called \((Y-T)\)-type array for each irreducible one. The author solves the hard problem on the necessary condition for a Runge- Kutta scheme to be symplectic for Hamiltonian systems. Hence, a sufficient and necessary condition is given.
    0 references
    0 references
    Runge-Kutta scheme
    0 references
    \((Y-T)\)-type array
    0 references
    irreducible
    0 references
    symplectic
    0 references
    Hamiltonian systems
    0 references

    Identifiers