Computing the distance to an uncontrollable system
From MaRDI portal
Publication:3970474
DOI10.1109/9.62266zbMath0743.93023OpenAlexW2100486700MaRDI QIDQ3970474
Publication date: 25 June 1992
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.62266
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Safety neighbournoods for the invariants of the matrix similarity∗ ⋮ Model reduction via near-uncontrollability and near-unobservability decomposition ⋮ Approximate zero polynomials of polynomial matrices and linear systems ⋮ On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods ⋮ Two-dimensional measures of reachability for linear time-invariant systems ⋮ Estimating the distance to uncontrollability: A fast method and a slow one ⋮ An algorithm for computing the distance to uncontrollability ⋮ On computing critical delay for fixed mode radius: centralized and decentralized control ⋮ The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability ⋮ On the structured distance to uncontrollability
This page was built for publication: Computing the distance to an uncontrollable system
