The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
From MaRDI portal
Publication:1894653
DOI10.1007/BF01211520zbMath0840.93073OpenAlexW2089575632MaRDI QIDQ1894653
Christopher L. DeMarco, Gregory E. Coxson
Publication date: 4 July 1996
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01211520
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Complexity issues in robust stability of linear delay-differential systems ⋮ On computational complexity of invalidating structured uncertainty models ⋮ A survey of computational complexity results in systems and control ⋮ Randomized algorithms for robust controller synthesis using statistical learning theory ⋮ Randomized algorithms for robust controller synthesis using statistical learning theory: a tutorial overview
Cites Work
- Some simplified NP-complete graph problems
- Several NP-hard problems arising in robust stability analysis
- Checking robust nonsingularity is NP-hard
- The Componentwise Distance to the Nearest Singular Matrix
- Interval Methods for Systems of Equations
- Computational complexity of μ calculation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
