Sign Controllability of a Nonnegative Matrix and a Positive Vector
- 1 April 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 14 (2) , 398-407
- https://doi.org/10.1137/0614028
Abstract
An n-by-n matrix A and a vector b are controllable if and only if the matrix $[ b,Ab,A^2 b, \ldots ,A^{n - 1} b ]$ has rank n. An array with each entry equal to +, –, or 0 is a sign pattern. If ${\bf A}$ and ${\bf B}$ are sign patterns of orders n-by-n and n-by-1, respectively, then the pair $( {\bf A},{\bf B} )$ is called sign controllable if $( A,b )$ is controllable for all $A \in {\bf A}$ and for all $b \in {\bf B}$ . Sign controllability of a nonnegative sign pattern ${\bf A}$ and a positive sign pattern ${\bf B}$ are characterized, and sufficient conditions for other cases of the sign controllability problem are given.
Keywords
This publication has 6 references indexed in Scilit:
- Linear Transformations which leave controllable multiinput descriptor systems controllableLinear Algebra and its Applications, 1989
- Combinatorial matrix analysis: An overviewLinear Algebra and its Applications, 1988
- Systems Analysis by Graphs and MatroidsPublished by Springer Nature ,1987
- Signsolvability revisitedLinear Algebra and its Applications, 1984
- Hyperstability of Control SystemsPublished by Springer Nature ,1973
- Qualitative Economics and the Scope of the Correspondence PrincipleEconometrica, 1968