arXiv (All)
open access
Iterative graph lifting for automatic design of path-complete stability certificates
Stability of switched linear systems under arbitrary switching is a fundamental problem in control theory, closely related to the joint spectral radius (JSR), which characterizes the worst-case growth rate of system trajectories. In this paper, we contribute to the path-complete approach for approxi
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
- 1423 Hybrid Stabilization of Linear Time-Invariant Systems : An Approach Using Conic Switching Law#69429
- Distance-Misaligned Training in Graph Transformers and Adaptive Graph-Aware Control#134565
- The MANTA Drive: Multi-Axis Non-holonomic Toroidal Actuation Active Feedback Stabilization of a Positive-Energy Toroidal Warp Spacetime via Non-Holonomic Multi-Axis Lie Bracket Actuation#691365
- Switching graphs and designs#1033810
- Tight Convergence Bounds for the Classical Kaczmarz Method#1115990
Record · ID 998285
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