A note on approximating the nearest stable discrete-time descriptor systems with fixed rank
From MaRDI portal
Publication:2010262
DOI10.1016/j.apnum.2019.09.004zbMath1427.93131arXiv1807.04481OpenAlexW2841025320MaRDI QIDQ2010262
Michael Karow, Punit Sharma, Nicolas Gillis
Publication date: 27 November 2019
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04481
Convex programming (90C25) Discrete-time control/observation systems (93C55) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Linear systems in control theory (93C05)
Related Items (1)
Cites Work
- Unnamed Item
- Nearest stable system using successive convex approximations
- On stabilization methods of descriptor systems
- Stability radii of linear systems
- Singular control systems
- The autonomous linear quadratic control problem. Theory and numerical solution
- On the stability radius of a generalized state-space system
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- Stability radii for real linear Hamiltonian systems with perturbed dissipation
- Perturbation Theory for Hamiltonian Matrices and the Distance to Bounded-Realness
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- On the Closest Stable/Unstable Nonnegative Matrix and Related Stability Radii
- Computing the nearest stable matrix pairs
- Matrix Stabilization Using Differential Equations
- Finding the Nearest Positive-Real System
- Robust Stability of Differential-Algebraic Equations
- On Nonsingularity Verification of Uncertain Matrices Over a Quadratically Constrained Set
This page was built for publication: A note on approximating the nearest stable discrete-time descriptor systems with fixed rank