Exact and computable constructions of Scaled Relative Graphs for closed linear operators are given via maximum and minimum gain computations, with a Bounded Real Lemma route for state-space models.
arxiv:2411.18318
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computable Characterisations of Scaled Relative Graphs of Closed Operators
Exact and computable constructions of Scaled Relative Graphs for closed linear operators are given via maximum and minimum gain computations, with a Bounded Real Lemma route for state-space models.