Symplectic integrator
Builds on Hamiltonian systemEuler method
Definition
Let and let , where is the identity matrix. For a smooth function , consider the Hamiltonian system with , that is, and . A one-step method assigns to each such and each small step size a map , and computes . The method is a symplectic integrator if is a symplectic map whenever is smooth and is defined and smooth. This means
Remarks
For , a map of the plane is symplectic exactly when its Jacobian determinant is , that is, when it preserves area. Example: for , the symplectic Euler method , gives , with Jacobian determinant . In general the symplectic Euler method is , , and it is symplectic for every . Non-example: the explicit Euler method for the same is , , with Jacobian determinant , so it is not symplectic. A Runge–Kutta method with coefficients , is symplectic when for all ; the implicit midpoint rule is an example.
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Differential equation concept
- Function concept
- Hamiltonian system concept
- Interval concept
- Ordinary differential equation definition
- Lipschitz condition definition
- Grönwall's inequality statement
- Solution of an ordinary differential equation definition
- Discrete Grönwall inequality statement
- Initial value problem definition
- Euler method concept
- Symplectic integrator definition
Further reading
About this page
| Tag | NZTCZQA8KW |
|---|---|
| URI | m2://NZTCZQA8KW |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65P10, 37J11 |
| Defines | Symplectic integrator |
| Uses | Hamiltonian system, Euler method |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.