Search arXivSearch

arXiv · 2609.04884

Energy-Consistent Splitting and Decomposition Approaches for Coupled port-Hamiltonian ODEs

Abstract

Operator splitting provides an attractive approach for the numerical integration of (coupled) port-Hamiltonian systems, as it allows the underlying system structure to be exploited at the level of the individual subproblems. However, the choice of the decomposition is not unique and may strongly affect both the computational efficiency and the preservation of the energy behavior of the original system. In this work, we investigate this interplay systematically and introduce energy consistency as a criterion for assessing splitting methods for port-Hamiltonian ordinary differential equations. We derive sufficient conditions under which a splitting based on a given decomposition inherits the energy behavior of the continuous system and use these conditions to analyze several decomposition strategies for coupled port-Hamiltonian systems. In particular, we compare decompositions that preserve the structure with approaches that exploit lower-dimensional subsystem dynamics or separated time scales. The analysis is complemented by numerical experiments using Strang splitting and its multiple-time-stepping extension. A scalable electro-thermal benchmark with fast electrical and slow thermal dynamics is employed to assess accuracy, energy behavior, and computational efficiency. The results demonstrate that preserving the port-Hamiltonian structure of the subflows is essential for energy-consistent splitting, whereas decompositions that exploit subsystem structure or time-scale separation can provide substantial computational advantages. In particular, the time-scale decomposition yields significant efficiency gains for systems with pronounced multirate characteristics, while structure-destroying decompositions may lead to undesirable energy behavior.

Explore related subjects

Keep this discovery

BibTeXRIS

Marius Mönch, Nicole Marheineke, Andreas Bartel, Kevin Schäfers, Michael Günther. 2026-09-04. Energy-Consistent Splitting and Decomposition Approaches for Coupled port-Hamiltonian ODEs. https://arxiv.org/abs/2609.04884

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Data-efficient Kernel Methods for Learning Hamiltonian Systems

Hamiltonian dynamics describe a wide range of physical systems. As such, data-driven simulations of Hamiltonian systems are important for many scientific and engineering problems. In this work, we propose kernel-based methods for identifying and forecasting Hamiltonian systems directly from trajectory data. We present two approaches: a 2-step method that reconstructs trajectories before learning the Hamiltonian, and a 1-step method that jointly infers both. Across several benchmark systems, including mass-spring dynamics, a nonlinear pendulum, and the Henon-Heiles system, we demonstrate that our framework achieves accurate, data-efficient predictions and outperforms 2-step kernel-based baselines, particularly in scarce-data regimes, while preserving the Hamiltonian structure. Moreover, we prove a priori error estimates, ensuring reliability of the learned models. We also provide a more general, problem-agnostic numerical framework that goes beyond Hamiltonian systems and can be used for data-driven learning of arbitrary dynamical systems.

math.NA

Machine learning of continuous and discrete variational ODEs with convergence guarantee and uncertainty quantification

The article introduces a method to learn dynamical systems that are governed by Euler--Lagrange equations from data. The method is based on Gaussian process regression and identifies continuous or discrete Lagrangians and is, therefore, structure preserving by design. A rigorous proof of convergence as the distance between observation data points converges to zero and lower bounds for convergence rates are provided. Next to convergence guarantees, the method allows for quantification of model uncertainty, which can provide a basis of adaptive sampling techniques. We provide efficient uncertainty quantification of any observable that is linear in the Lagrangian, including of Hamiltonian functions (energy) and symplectic structures, which is of interest in the context of system identification. The article overcomes major practical and theoretical difficulties related to the ill-posedness of the identification task of (discrete) Lagrangians through a careful design of geometric regularisation strategies and through an exploit of a relation to convex minimisation problems in reproducing kernel Hilbert spaces.

math.NA

Random attractors and almost-sure stability under discretization of a stochastic autoparametric system

For a stochastic autoparametric block-and-pendulum system, the long-time dynamics exhibit two fundamental features: the almost-sure stability of the single mode solution, characterized by its Lyapunov exponent, and the global asymptotic dynamics when this single mode solution loses stability. This naturally raises the question of whether these dynamical features are preserved under discretization, since such preservation is essential for the resulting discrete system to faithfully capture the qualitative behavior of the continuous system. To address this question, we first establish the existence of a random attractor for the continuous system subject to multiplicative stochastic excitation, providing a rigorous characterization of the global asymptotic dynamics. We then propose a numerical discretization that induces a discrete random dynamical system and prove the convergence of its random attractor to the continuous one as the step size tends to zero. In addition, we show that the numerical Lyapunov exponent of the single mode solution has the same sign as its continuous counterpart for sufficiently small step sizes, thus preserving the corresponding almost-sure stability or instability classification. These results demonstrate that the proposed discretization captures both the global asymptotic dynamics and the stability characteristics of the underlying stochastic autoparametric system.

math.DS