Monomial decomposition of reachable and controllable positive linear systems
Tóm tắt
An algorithm for decomposing positive linear systems into monomial components is developed for the case when the system matrix contains zero columns. Criteria in digraph form for identifying the reachability and controllability properties of such systems are provided. The decomposition algorithm can be, used to generate a variety of reachable and controllable canonical form of positive linear systems. The graph-theoretic nature of the algorithm substantially simplifies the solution of large-scale problems arising in many application areas of positive systems.
Từ khóa
#Control systems #Linear systems #Controllability #Optimal control #Matrix decomposition #Vectors #Sequences #Mathematics #Australia #Large-scale systemsTài liệu tham khảo
caccetta, 1989, Reachable discrete-time positive systems with minimal dimension control sets, Dynamics of Continuous Discrete and Impulsive Systems, 4, 539
bru, 2000, Canonical forms for positive linear discrete-time linear systems, Linear Algebra and its Applications, 310, 49, 10.1016/S0024-3795(00)00044-6
rumchev, 1997, On the combinatorial properties of reachable positive single-input systems, Systems Science, 23, 13
10.1137/1.9781611971262
kaczorek, 2001, Positive 1D and 2D Systems
foulds, 1995, Graph Theory Applications (2nd Edition)
10.1016/0024-3795(87)90076-0
10.1023/A:1019244121533
10.1080/00207178908953401
luenberger, 1979, Introduction to Dynamical Systems Theory Models and Applications
rumchev, 2000, On controllability of discrete-time positive systems, Proc ICARCV2000 (CD-ROM Version Available)