Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/ACC.2002.1025383 | American Control Conference, 2002. Proceedings of the 2002 |
Keywords | DocType | Volume |
controllability,discrete time systems,graph theory,linear systems,matrix decomposition,reachability analysis,controllability properties,decomposition algorithm,digraph form criteria,graph-theoretic nature,large-scale problems,monomial decomposition,positive linear discrete-time system,reachability properties,reachable controllable positive linear systems,system matrix,zero columns,vectors,sequences,canonical form,optimal control,control systems,mathematics,linear system | Conference | 6 |
ISSN | Citations | PageRank |
0743-1619 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bru, R. | 1 | 0 | 0.34 |
| Caccetta, L. | 2 | 0 | 0.34 |
| Rumchev, V.G. | 3 | 0 | 0.34 |