1994University of North Texas Digital Library (University of North Texas)Open access

A brief introduction to symplectic integrators and recent results

Paul J. Channell

Open full text 0 citations

Abstract

The author begins with a brief synopsis about Hamiltonian systems and symplectic maps. A symplectic integrator is a symplectic map {phi}(q,p;t) that systematically approximates the time t flow of a Hamiltonian system. Systematic means: (1) in time step, t, i.e. the error should vanish as some power of the time step, and (2) in order of approximation, i.e. one would like a hierarchy of such {phi} that have errors that vanish as successively higher powers of the time step. At present the authors known two general types of symplectic integrators: (1) implicit integrators that are derived from a generating function or from algebraic conditions on Runge-Kutta schemes, and (2) explicit integrators that are derived from integrable Hamiltonians or from algebraic conditions on Runge-Kutta schemes.

Open-access reader

About this research paper

What this paper is about

The author begins with a brief synopsis about Hamiltonian systems and symplectic maps. A symplectic integrator is a symplectic map {phi}(q,p;t) that systematically approximates the time t flow of a Hamiltonian system. Systematic means: (1) in time step, t, i.e. the error should vanish as some power of the time step, and (2) in order of approximation, i.e. one would like a hierarchy of such {phi} that have errors that vanish as successively higher powers of the time step. At present the authors known two general types of symplectic integrators: (1) implicit integrators that are derived from a generating function or from algebraic conditions on Runge-Kutta schemes, and (2) explicit integrators that are derived from integrable Hamiltonians or from algebraic conditions on Runge-Kutta schemes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The author begins with a brief synopsis about Hamiltonian systems and symplectic maps. A symplectic integrator is a symplectic map {phi}(q,p;t) that systematically approximates the time t flow of a Hamiltonian system. Systematic means: (1) in time step, t, i.e. the error should vanish as some power of the time step, and (2) in order of approximation, i.e. one would like a hierarchy of such {phi} that have errors that vanish as successively higher powers of the time step. At present the authors known two general types of symplectic integrators: (1) implicit integrators that are derived from a generating function or from algebraic conditions on Runge-Kutta schemes, and (2) explicit integrators that are derived from integrable Hamiltonians or from algebraic conditions on Runge-Kutta schemes.

Key concepts: Integrator, Symplectic geometry, Computer science, Symplectic integrator, Mathematics, Telecommunications, Pure mathematics, Bandwidth (computing)

Related papers

Back to paper searchBrowse research topicsOriginal source
A brief introduction to symplectic integrators and recent results — Research Paper | ScholarLens