Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated 45 min ago
PreprintCC BY 4.0arXiv

Rough variational principles and applications to adjoint systems

Abstract

We consider a Type-II variational principle driven by geometric rough path with split boundary conditions naturally suited to adjoint systems. From this rough variational principle we derive rough Hamilton's equations, establish their pathwise conservation laws and associated Hamilton--Jacobi equation. We then specialise the framework to rough adjoint systems, obtaining pathwise conservation and quasi-conservation laws that underpin adjoint sensitivity analysis with respect to initial conditions and parameters. On the discrete side, we construct a rough Galerkin discretisation of the rough Type-II variational principle and show that it generates a symplectic flow with discrete analogues of the continuous conservation laws. We establish it's equivalence to a class of Rough Symplectic Partitioned Runge--Kutta (RSPRK) methods and analyse its convergence and naturality properties. Lastly, we perform numerical experiments to validate the predicted convergence rates and demonstrate that RSPRK methods preserve the adjoint conservation laws to machine precision, yielding more accurate and stable gradients in optimisation problems than non-symplectic alternatives.

Related

  1. A unified variational framework for augmented Lagrangian preconditioning of saddle point systems: applications to mixed-dimensional and fictitious domain methods
    Michele Benzi, Marco Feder, Luca Heltai +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Weighted Endpoint Variational and Jump Inequalites for Rough Singular Integrals
    Ting Chen, Feng Liu, Zhou Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Metric gradient flows and variational principles
    Alberto Domínguez Corella
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Generic variational principles for supinf problems with constraints
    D. Gaumont, D. Kamburova, J. P. Revalski
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsOptimisation & controlarXiv
  5. A new perspective in linear Cauchy Elasticity: variational minimum principles for statics, dynamics, and heterogeneous materials
    Amit Acharya
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsOptimisation & controlarXiv
BibTeX
@misc{hu2026rough,
  title = {{Rough variational principles and applications to adjoint systems}},
  author = {Ruiao Hu and Melvin Leok},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.06337},
  eprint = {2609.06337},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.06337},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Rough variational principles and applications to adjoint systems
AU  - Ruiao Hu
AU  - Melvin Leok
PY  - 2026
DA  - 2026/09/06
PB  - arXiv
DO  - 10.48550/arxiv.2609.06337
UR  - https://arxiv.org/abs/2609.06337
AB  - We consider a Type-II variational principle driven by geometric rough path with split boundary conditions naturally suited to adjoint systems. From this rough variational principle we derive rough Hamilton's equations, establish their pathwise conservation laws and associated Hamilton--Jacobi equation. We then specialise the framework to rough adjoint systems, obtaining pathwise conservation and quasi-conservation laws that underpin adjoint sensitivity analysis with respect to initial conditions and parameters. On the discrete side, we construct a rough Galerkin discretisation of the rough Type-II variational principle and show that it generates a symplectic flow with discrete analogues of the continuous conservation laws. We establish it's equivalence to a class of Rough Symplectic Partitioned Runge--Kutta (RSPRK) methods and analyse its convergence and naturality properties. Lastly, we perform numerical experiments to validate the predicted convergence rates and demonstrate that RSPRK methods preserve the adjoint conservation laws to machine precision, yielding more accurate and stable gradients in optimisation problems than non-symplectic alternatives.
ER  -