Monomial decomposition of reachable and controllable positive linear systems

Author

Bru, R. ; Caccetta, L. ; Rumchev, V.G.

Author_Institution

Dept. de Matematica Aplicada, Univ. Politecnica de Valencia, Spain

Volume

6

fYear

2002

fDate

2002

Firstpage

4620

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.

Keywords

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; Australia; Control systems; Controllability; Large-scale systems; Linear systems; Mathematics; Matrix decomposition; Optimal control; Sequences; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2002. Proceedings of the 2002

ISSN

0743-1619

Print_ISBN

0-7803-7298-0

Type

conf

DOI

10.1109/ACC.2002.1025383

Filename

1025383