Estimating the distance to uncontrollability: A fast method and a slow one
From MaRDI portal
Publication:673177
DOI10.1016/0167-6911(95)00023-3zbMATH Open0877.93005OpenAlexW2007954101MaRDI QIDQ673177FDOQ673177
Authors: Juan-Miguel Gracia
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
Recommendations
singular valuesoptimization problemDistance to uncontrollabilityNewton's method and global minimum searching
Cites Work
- Title not available (Why is that?)
- The generalized eigenstructure problem in linear system theory
- Stability radii of linear systems
- On condition numbers and the distance to the nearest ill-posed problem
- Controllability and stability radii for companion form systems
- Computing the distance to an uncontrollable system
- Between controllable and uncontrollable
- A formula for computation of the real stability radius
- Properties of numerical algorithms related to computing controllability
- An algorithm for computing the distance to uncontrollability
- Title not available (Why is that?)
- Computing rank-deficiency of rectangular matrix pencils
- Estimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
- Title not available (Why is that?)
- An algorithm for the computation of the structured complex stability radius
- Algebraic Riccati Equations and the Distance to the Nearest Uncontrollable Pair
- A global minimum search algorithm for estimating the distance to uncontrollability
- Title not available (Why is that?)
- A counterexample for two conjectures about stability
Cited In (18)
- The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability
- Irr: An algorithm for computing the smallest singular value of large scale matrices
- Bounding the distance from a controllable two order system to a non-controllable ones
- New Methods for Estimating the Distance to Uncontrollability
- A global minimum search algorithm for estimating the distance to uncontrollability
- Nearest linear systems with highly deficient reachable subspaces
- Computing the radius of controllability for state space systems
- On the structured distance to uncontrollability
- An algorithm for computing the distance to uncontrollability
- Distance to Uncontrollability for Convex Processes
- On the Estimation of the Distance to Uncontrollability for Higher Order Systems
- Title not available (Why is that?)
- Formulae for the distance between controllable and uncontrollable linear systems
- Computing the distance to uncontrollability via LMIs: lower bound computation with exactness verification
- Fast Methods for Estimating the Distance to Uncontrollability
- Pseudospectral Components and the Distance to Uncontrollability
- The structured distance to uncontrollability under multi-perturbations: an approach using multi-valued linear operators
- Title not available (Why is that?)
This page was built for publication: Estimating the distance to uncontrollability: A fast method and a slow one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673177)