The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- 1 December 1994
- journal article
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- Vol. 7 (4) , 279-291
- https://doi.org/10.1007/bf01211520
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Robust stability of linear systems relative to guarded domainsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Computational complexity of μ calculationIEEE Transactions on Automatic Control, 1994
- Several NP-hard problems arising in robust stability analysisMathematics of Control, Signals, and Systems, 1993
- Checking robust nonsingularity is NP-hardMathematics of Control, Signals, and Systems, 1993
- The Componentwise Distance to the Nearest Singular MatrixSIAM Journal on Matrix Analysis and Applications, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988
- Analysis of feedback systems with structured uncertaintiesIEE Proceedings D Control Theory and Applications, 1982
- Stability margins of diagonally perturbed multivariable feedback systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981