Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2509.16665 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912596034060288 |
|---|---|
| author | Arnström, Daniel Teixeira, André M. H. |
| author_facet | Arnström, Daniel Teixeira, André M. H. |
| contents | The cyclic output-to-output gain is a security metric for control systems. Commonly, it is computed by solving a semi-definite program, which scales badly and inhibits its use for large-scale systems. We propose a method for computing the cyclic output-to-output gain using Hamiltonian matrices, similar to existing methods for the $H_\infty$-norm. In contrast to existing methods for the $H_{\infty}$-norm, the proposed method considers generalized singular values rather than regular singular values. Moreover, to ensure that the Hamiltonian matrices exist, we introduce a regularized version of the cyclic output-to-output gain. Through numerical experiments, we show that the proposed method is more efficient, scalable, and reliable than semi-definite programming approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_16665 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficiently Computing the Cyclic Output-to-Output Gain Arnström, Daniel Teixeira, André M. H. Systems and Control The cyclic output-to-output gain is a security metric for control systems. Commonly, it is computed by solving a semi-definite program, which scales badly and inhibits its use for large-scale systems. We propose a method for computing the cyclic output-to-output gain using Hamiltonian matrices, similar to existing methods for the $H_\infty$-norm. In contrast to existing methods for the $H_{\infty}$-norm, the proposed method considers generalized singular values rather than regular singular values. Moreover, to ensure that the Hamiltonian matrices exist, we introduce a regularized version of the cyclic output-to-output gain. Through numerical experiments, we show that the proposed method is more efficient, scalable, and reliable than semi-definite programming approaches. |
| title | Efficiently Computing the Cyclic Output-to-Output Gain |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2509.16665 |