Qualitative stability of linear systems

Citations of this article
Mendeley users who have this article in their library.


This paper provides a finitely computable graph-theoretic answer to the following question concerning linear dynamical systems: When, given only the signs of entries (+, -, or 0) in a real square matrix A, can one be certain that all positive trajectories of the system ẋ = Ax are bounded? Matrices having such sign-patterns are called sign-quasistable. With "bounded" replaced by "convergent to the origin," the matrices are called sign-stable and were fully described in earlier papers. However, when A's digraph has several strong components, so that the system is actually a hierarchy of subsystems, and when some of those subsystems fail to be sign-stable, the recognition of sign-quasistability is a very delicate matter. By means of certain graph color tests, it is possible to identify the system variables that are capable (for some choice of matrix-entry magnitudes and initial conditions) of emitting nonzero constant. © 1987.




Jeffries, C., Klee, V., & van den Driessche, P. (1987). Qualitative stability of linear systems. Linear Algebra and Its Applications, 87(C), 1–48. https://doi.org/10.1016/0024-3795(87)90156-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free