Related Experiment Video
Updated: Mar 12, 2026

Excitonic Hamiltonians for Calculating Optical Absorption Spectra and Optoelectronic Properties of Molecular Aggregates and Solids
Published on: May 27, 2020
Explicit symplectic approximation of nonseparable Hamiltonians: Algorithm and long time performance
1Georgia Institute of Technology, Atlanta, Georgia 30332, USA.
Abstract:
Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. This article proposes for arbitrary Hamiltonians similar integrators, which are explicit, of any even order, symplectic in an extended phase space, and with pleasant long time properties. They are based on a mechanical restraint that binds two copies of phase space together. Using backward error analysis, Kolmogorov-Arnold-Moser theory, and additional multiscale analysis, an error bound of O(Tδ^{l}ω) is established for integrable systems, where T,δ,l, and ω are, respectively, the (long) simulation time, step size, integrator order, and some binding constant. For nonintegrable systems with positive Lyapunov exponents, such an error bound is generally impossible, but satisfactory statistical behaviors were observed in a numerical experiment with a nonlinear Schrödinger equation.
Related Concept Videos
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Application of Linearization and Approximation
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Linearization and Approximation
Separable Differential Equations
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
