Related papers: Distance problems for dissipative Hamiltonian syst…
The Distance Geometry Problem (DGP) seeks to find positions for a set of points in geometric space when some distances between pairs of these points are known. The so-called discretization assumptions allow to discretize the search space of…
We investigate the reductions of dispersionless Harry Dym hierarchy to systems of finitely many partial differential equations. These equations must satisfy the compatibility condition and they are diagonalizable and semi-Hamiltonian. By…
This paper presents a novel framework for characterizing dissipativity of uncertain systems whose dynamics evolve according to differential-algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or…
It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…
The optimal control of a mechanical system is of crucial importance in many realms. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information. Graphs…
We define discrete Hamiltonian systems in the framework of discrete embeddings. An explicit comparison with previous attempts is given. We then solve the discrete Helmholtz's inverse problem for the discrete calculus of variation in the…
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l\infty-error ||d - dR||\infty…
The structural invariant subspaces of the discrete-time singular Hamiltonian system are used in 1] to give an analytic nonrecursive expression of all the admissible trajectories. A deeper insight into the features of these subspaces,…
A great number of works is devoted to qualitative investigation of Hamiltonian systems. One of tools of such investigation is the method of skew-symmetric differential forms. In present work, under investigation Hamiltonian systems in…
The relationship between different dissipativity concepts for linear time-varying systems is studied, in particular between port-Hamiltonian systems, passive systems, and systems with nonnegative supply. It is shown that linear time-varying…
The paper is concerned with the properties of the distance function from a closed subset of a Riemannian manifold, with particular attention to the set of singularities.
We present a gradient-based identification algorithm to identify the system matrices of a linear port-Hamiltonian system from given input-output time data. Aiming for a direct structure-preserving approach, we employ techniques from optimal…
Distance metric learning can be viewed as one of the fundamental interests in pattern recognition and machine learning, which plays a pivotal role in the performance of many learning methods. One of the effective methods in learning such a…
We consider the singular optimal control problem of minimizing the energy supply of linear dissipative port-Hamiltonian descriptor systems subject to control and terminal state constraints. To this end, after reducing the problem to an ODE…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Discrete gradient methods are a powerful tool for the time discretization of dynamical systems, since they are structure-preserving regardless of the form of the total energy. In this work, we discuss the application of discrete gradient…
We discuss structure-preserving time discretization for nonlinear port-Hamiltonian systems with state-dependent mass matrix. Such systems occur, for instance, in the context of structure-preserving nonlinear model order reduction for…