Estimating the distance to uncontrollability: A fast method and a slow one
From MaRDI portal
Publication:673177
DOI10.1016/0167-6911(95)00023-3zbMath0877.93005OpenAlexW2007954101MaRDI QIDQ673177
Publication date: 28 February 1997
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(95)00023-3
singular valuesoptimization problemDistance to uncontrollabilityNewton's method and global minimum searching
Related Items
Computing the radius of controllability for state space systems, Irr: An algorithm for computing the smallest singular value of large scale matrices, The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the computation of the structured complex stability radius
- Between controllable and uncontrollable
- On condition numbers and the distance to the nearest ill-posed problem
- Computing rank-deficiency of rectangular matrix pencils
- Stability radii of linear systems
- Controllability and stability radii for companion form systems
- An algorithm for computing the distance to uncontrollability
- A global minimum search algorithm for estimating the distance to uncontrollability
- A formula for computation of the real stability radius
- The generalized eigenstructure problem in linear system theory
- Properties of numerical algorithms related to computing controllability
- Computing the distance to an uncontrollable system
- Algebraic Riccati Equations and the Distance to the Nearest Uncontrollable Pair
- A counterexample for two conjectures about stability
- Estimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
