arXiv (All)
open access
Computable Characterisations of Scaled Relative Graphs of Closed Operators
The Scaled Relative Graph (SRG) is a promising tool for stability and robustness analysis of multi-input multi-output systems. In this paper, we provide tools for exact and computable constructions of the SRG for closed linear operators, based on maximum and minimum gain computations. The results ar
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computable Characterisations of Scaled Relative Graphs of Closed Operators#920242
- Bounding the Multiplicities of Eigenvalues of Graph Matrices in Terms of Circuit Rank#256591
- Benefits of Linear Dynamic State Feedback in Co-stabilization#1049428
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization#955121
- Disconnected graphs and extremal bounds for realizable distance orders#616985
Record · ID 924473
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive