An algorithm for computing the distance to uncontrollability

DOI10.1016/0167-6911(91)90085-SzbMath0749.93011OpenAlexW2078172548MaRDI QIDQ1189177

S. Singh

Publication date: 26 September 1992

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(91)90085-s

zbMATH Keywords

Newton's methodbisection methodNumerical resultsuncontrollability

Mathematics Subject Classification ID

Controllability (93B05)

Related Items (8)

Computing the radius of controllability for state space systems ⋮ Two-dimensional measures of reachability for linear time-invariant systems ⋮ Upper bounds for the distance between a controllable switched linear system and the set of uncontrollable ones ⋮ Estimating the distance to uncontrollability: A fast method and a slow one ⋮ The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability ⋮ Robust controllability assessment via semi-definite programming ⋮ A global minimum search algorithm for estimating the distance to uncontrollability ⋮ Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Between controllable and uncontrollable
• Computing rank-deficiency of rectangular matrix pencils
• Controllability and stability radii for companion form systems
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• Properties of numerical algorithms related to computing controllability
• Computing the distance to an uncontrollable system
• Estimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates

This page was built for publication: An algorithm for computing the distance to uncontrollability