An $n \times n$ real matrix A is said to be (totally negative) totally nonpositive if every minor is (negative) nonpositive. In this paper, we study the properties of a totally nonpositive matrix and characterize the case of a nonsingular totally nonpositive matrix A, with $a_{11}< 0$ in terms of its $LDU$ factorization ($L(U)$) is a unit lower- (upper-) triangular matrix, respectively, and D is a diagonal matrix). This characterization allows us to significantly reduce the number of minors to be checked in order to decide the total nonpositivity of a nonsingular matrix with a negative (1,1) entry.
The pole-placement problem for the monodromy matrix of a discrete-time linear periodic system is considered. Given a partition of the complex plane into a ‘good’ part ℂ and a ‘bad’ part ℂb, the result obtained by Wonham (1979) is extended to the periodic case. This extension is based on the decomposition of a completely controllable periodic system into two subsystems, such that the first subsystem is completely reachable and the eigenvalues of the monodromy matrix of the second one are equal to zero.
Given a square matrix A, a Brauer’s theorem [Brauer A., Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices, Duke Math. J., 1952, 19(1), 75–91] shows how to modify one single eigenvalue of A via a rank-one perturbation without changing any of the remaining eigenvalues. Older and newer results can be considered in the framework of the above theorem. In this paper, we present its application to stabilization of control systems, including the case when the system is noncontrollable. Other applications presented are related to the Jordan form of A and Wielandt’s and Hotelling’s deflations. An extension of the aforementioned Brauer’s result, Rado’s theorem, shows how to modify r eigenvalues of A at the same time via a rank-r perturbation without changing any of the remaining eigenvalues. The same results considered by blocks can be put into the block version framework of the above theorem.