Skip to content
DraconiticResearch
Search Sources API
190,839 studies31 sourcesUpdated 16 min ago
PreprintarXiv licencearXiv

Symplectic filtering of Hamiltonian dynamics with moving sensors

Abstract

While structure-preserving methods for the forward simulation of Hamiltonian systems are well established, the mathematical foundations of their data assimilation and filtering counterparts remain comparatively less developed, particularly regarding rigorous accuracy guarantees. To address this gap, we propose an online filtering algorithm to reconstruct an unknown function u† from finitely many measurements, assuming that u† solves a parametric Hamiltonian PDE with unknown inputs. The method uses low-dimensional symplectic approximation spaces that evolve in time according to the PDE model and informed by the measurement data. The method can also be coupled with a dynamical sensor-placement strategy designed to optimize reconstruction stability. We derive error bounds in terms of stability and best approximation, and show that the reconstruction remains in a symplectic space and preserves energy up to the approximation error. Numerical experiments demonstrate the effectiveness of the method and the benefits of dynamic over static sensor placement.

Related

  1. Holomorphic approximation for Hamiltonian diffeomorphism groups via the Symplectic Density Property
    Gaofeng Huang, Frank Kutzschebauch
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  2. Butcher series for Hamiltonian Poisson integrators through symplectic groupoids
    Adrien Busnot Laurent, Oscar Cosserat
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyHAL
  3. Hamiltonian and Symplectic Tensors in the T-product Algebra
    Susana Lopez-Moreno, Taehyeong Kim
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  4. Symplectic Hamiltonian Direct Discontinuous Galerkin Method for Wave Propagation
    Haomiao Li, Yumiao Li, Jiaxin Wang +2
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Randomized Symplectic Model Reduction: One-Pass Basis Construction and Sketched Hamiltonian Assembly
    Robin Herkert, Bernard Haasdonk, Jörg Fehr
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@misc{mula2026symplectic,
  title = {{Symplectic filtering of Hamiltonian dynamics with moving sensors}},
  author = {Olga Mula and Cecilia Pagliantini and Federico Vismara},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.35647},
  eprint = {2609.35647},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.35647},
}
RIS
TY  - UNPB
TI  - Symplectic filtering of Hamiltonian dynamics with moving sensors
AU  - Olga Mula
AU  - Cecilia Pagliantini
AU  - Federico Vismara
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.35647
UR  - https://arxiv.org/abs/2609.35647
AB  - While structure-preserving methods for the forward simulation of Hamiltonian systems are well established, the mathematical foundations of their data assimilation and filtering counterparts remain comparatively less developed, particularly regarding rigorous accuracy guarantees. To address this gap, we propose an online filtering algorithm to reconstruct an unknown function u^† from finitely many measurements, assuming that u^† solves a parametric Hamiltonian PDE with unknown inputs. The method uses low-dimensional symplectic approximation spaces that evolve in time according to the PDE model and informed by the measurement data. The method can also be coupled with a dynamical sensor-placement strategy designed to optimize reconstruction stability. We derive error bounds in terms of stability and best approximation, and show that the reconstruction remains in a symplectic space and preserves energy up to the approximation error. Numerical experiments demonstrate the effectiveness of the method and the benefits of dynamic over static sensor placement.
ER  -