A global minimum search algorithm for estimating the distance to uncontrollability
From MaRDI portal
Publication:1260792
DOI10.1016/0024-3795(93)90472-ZzbMath0778.65049WikidataQ128012504 ScholiaQ128012504MaRDI QIDQ1260792
Publication date: 25 August 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
controllabilitynumerical examplesingular valuesdifferential systemdistance to uncontrollabilitybisection algorithmglobal minimum search algorithm
Related Items
Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates, 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, Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
Cites Work
- Between controllable and uncontrollable
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Computing rank-deficiency of rectangular matrix pencils
- The weak and strong stability of algorithms in numerical linear algebra
- Controllability and stability radii for companion form systems
- An algorithm for computing the distance to uncontrollability
- Perturbation bounds for the definite generalized eigenvalue problem
- Computable Bounds for the Sensitivity of the Algebraic Riccati Equation
- A Perturbation Result for Linear Control Problems
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- Properties of numerical algorithms related to computing controllability
- An algorithm for pole assignment of time invariant linear systems†
- The Strong Stability of Algorithms for Solving Symmetric Linear Systems
- Mathematical Description of Linear Dynamical Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
