Papers
Topics
Authors
Recent
Search
2000 character limit reached

Explicit symplectic approximation of nonseparable Hamiltonians: algorithm and long time performance

Published 7 Sep 2016 in math.NA, math.DS, physics.class-ph, and physics.comp-ph | (1609.02212v1)

Abstract: Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the 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, KAM theory, and additional multiscale analysis, an error bound of $\mathcal{O}(T\deltal \omega)$ is established for integrable systems, where $T$, $\delta$, $l$ and $\omega$ are respectively the (long) simulation time, step size, integrator order, and some binding constant. For non-integrable 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\"{o}dinger equation.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.