Pages that link to "Item:Q1189177"
From MaRDI portal
The following pages link to An algorithm for computing the distance to uncontrollability (Q1189177):
Displaying 10 items.
- Computing the radius of controllability for state space systems (Q414570) (← links)
- Upper bounds for the distance between a controllable switched linear system and the set of uncontrollable ones (Q474765) (← links)
- Estimating the distance to uncontrollability: A fast method and a slow one (Q673177) (← links)
- Robust controllability assessment via semi-definite programming (Q730095) (← links)
- A global minimum search algorithm for estimating the distance to uncontrollability (Q1260792) (← links)
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization (Q1826601) (← links)
- The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability (Q1989181) (← links)
- Computing the distance to uncontrollability via LMIs: lower bound computation with exactness verification (Q2519756) (← links)
- Computing the distance to an uncontrollable system (Q3970474) (← links)
- Two-dimensional measures of reachability for linear time-invariant systems (Q4880899) (← links)
