Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control and more

J. M. Sanz-Serna

Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control and more

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1503.04021 v2 pith:F4BPZ2BZ submitted 2015-03-13 math.NA cs.NAmath.OC

J. M. Sanz-Serna This is my paper · ORCID

classification math.NAcs.NAmath.OC

keywords runge-kuttacontroloptimalsymplecticcomputationfirstintegralspartitioned

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

It is well known that symplectic Runge-Kutta and Partitioned Runge-Kutta methods exactly preserve {\em quadratic} first integrals (invariants of motion) of the system being integrated. While this property is often seen as a mere curiosity (it does not hold for arbitrary first integrals), it plays an important role in the computation of numerical sensitivities, optimal control theory and Lagrangian mechanics, as described in this paper, which, together with some new material, presents in a unified way a number of results now scattered or implicit in the literature. Some widely used procedures, such as the direct method in optimal control theory and the computation of sensitivities via reverse accumulation imply "hidden" integrations with symplectic Partitioned Runge-Kutta schemes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Backward error analysis for matrix discretizations of 2-D Euler equations
math.NA 2026-07 accept novelty 8.0 of 10

ISOSYRK methods on Zeitlin’s Euler–Zeitlin system admit n-independent exponentially small modified-Hamiltonian errors for times exp(c/ε) when h = ε ℏ_n.

Pith tools