Characterization and Stability of Autonomous Positive Descriptor Systems
Authors:
- 7 March 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 57 (10) , 2668-2673
Abstract
This note addresses two problems: the characterization of positivity of autonomous descriptor systems and the problem of finding conditions for their stability. For these fundamental issues, we provide necessary and sufficient conditions complemented with a numerically reliable computational approach. The given conditions can be checked by means of linear programming (LP). Also, we derive a necessary and sufficient condition for stability that is connected to the underlying eigenstructure of the system.Keywords
This publication has 18 references indexed in Scilit:
- Nonnegativity, stability, and regularization of discrete-time descriptor systemsLinear Algebra and its Applications, 2010
- Stability analysis of positive descriptor systemsLinear Algebra and its Applications, 2008
- Generalisation of the Perron–Frobenius theory to matrix pencilsLinear Algebra and its Applications, 2008
- Positive solutions of a discrete-time descriptor systemInternational Journal of Systems Science, 2008
- An algorithm to check the nonnegativity of singular systemsApplied Mathematics and Computation, 2007
- Looking for nonnegative solutions of a Leontief dynamic modelLinear Algebra and its Applications, 2003
- Structural properties of positive linear time-invariant difference-algebraic equationsLinear Algebra and its Applications, 2002
- A characterization of the drazin inverseLinear Algebra and its Applications, 2001
- On invariant polyhedra of continuous-time linear systemsIEEE Transactions on Automatic Control, 1993
- Pseudo-Inverses in Associative Rings and SemigroupsThe American Mathematical Monthly, 1958