Metraipolis › archive › dc_95a62641b2ad

Robust forms for passive descriptor systems — arXiv:2609.39465

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39465
License (as archived)
CC0-1.0
Archived
2026-10-07T14:11:24.388Z
SHA-256 of the archived text
6df1420ff60ecdd8e40942d9b33095f1fcab0493989c51ff822d90c1f1ae4501
Stable URL of this page
https://metraipolis.com/documento/dc_95a62641b2ad

How to cite

Robust forms for passive descriptor systems — arXiv:2609.39465 — arXiv (en), https://arxiv.org/abs/2609.39465 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_95a62641b2ad (Metraipolis archive dc_95a62641b2ad, sha256 6df1420ff60ecdd8e40942d9b33095f1fcab0493989c51ff822d90c1f1ae4501)
BibTeX
@misc{dc95a62641b2ad,
  title = {Robust forms for passive descriptor systems — arXiv:2609.39465},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39465},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_95a62641b2ad; sha256 6df1420ff60ecdd8e40942d9b33095f1fcab0493989c51ff822d90c1f1ae4501},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39465. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We show how to compute the passivity radius of a given generalized state-space model of a rational transfer function that represents a passive system, both in the continuous-time and discrete-time cases. We then use this to construct robust descriptor realizations. For the continuous-time case, these realizations have a port-Hamiltonian descriptor form. For the discrete-time case a similar result holds for the so-called normalized realizations. The computation of such robust realizations is linked in both these cases to a particular solution of a linear matrix inequality that characterizes the passivity of the transfer function.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.39465 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:03:18.262Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).