Is something known about the complexity of checking for diagonal stability? (A real square matrix $A$ is diagonally stable if there is a diagonal positive definite matrix $P$ so that $AP+PA^{T}$ is negative definite; this is a specialization of the standard notion of stability).
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
|
|
|
