UPDF AI

On computing the distance to stability for matrices using linear dissipative Hamiltonian systems

Nicolas Gillis,Punit Sharma

2016 · DOI: 10.1016/j.automatica.2017.07.047
52 Citations

TLDR

It is shown that a matrix A is stable if and only if it can be written as A = ( J − R ) Q, where J = − J T, R ⪰ 0 and Q ≻ 0 (that is, R is positive semidefinite and Q is positive definite).