Soft-hard equivalence in circular scaled graph containment bypasses computational constraints for feedback stability, while hyperbolically convex conics yield tighter bounds for nonsymmetric cases.
Computing the hard scaled relative graph of LTI systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scaled Graph Containment for Feedback Stability: Soft-Hard Equivalence and Conic Regions
Soft-hard equivalence in circular scaled graph containment bypasses computational constraints for feedback stability, while hyperbolically convex conics yield tighter bounds for nonsymmetric cases.