English

Computing the nearest $\Omega$-admissible descriptor dissipative Hamiltonian system

Numerical Analysis 2025-11-06 v1 Numerical Analysis Systems and Control Systems and Control Optimization and Control

Abstract

For a given set ΩC\Omega \subseteq \mathbb{C}, a matrix pair (E,A)(E,A) is called Ω\Omega-admissible if it is regular, impulse-free and its eigenvalues lie inside the region Ω\Omega. In this paper, we provide a dissipative Hamiltonian characterization for the matrix pairs that are Ω\Omega-admissible where Ω\Omega is an LMI region. We then use these results for solving the nearest Ω\Omega-admissible matrix pair problem: Given a matrix pair (E,A)(E,A), find the nearest Ω\Omega-admissible pair (E~,A~)(\tilde E, \tilde A) to the given pair (E,A)(E,A). We illustrate our results on several data sets and compare with the state of the art.

Cite

@article{arxiv.2511.03265,
  title  = {Computing the nearest $\Omega$-admissible descriptor dissipative Hamiltonian system},
  author = {Vaishali Aggarwal and Nicolas Gillis and Punit Sharma},
  journal= {arXiv preprint arXiv:2511.03265},
  year   = {2025}
}

Comments

24 pages, 6 figures, code available from https://gitlab.com/ngillis/nearest-omega-stable-pair

R2 v1 2026-07-01T07:22:31.300Z