An efficient algorithm for positive realizations

Czaja, W. and Jaming, P. and Matolcsi, Máté (2008) An efficient algorithm for positive realizations. SYSTEMS & CONTROL LETTERS, 57 (5). pp. 436-441. ISSN 0167-6911

Text 0612551.pdf Restricted to Repository staff only Download (201kB) | Request a copy

Abstract

We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of [L. Benvenuti, L. Farina, An example of how positivity may force realizations of 'large' dimensions, Systems Control Lett. 36 (1999) 261-266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782-784] to indicate that the algorithm is indeed efficient in general.

Actions (login required)

Edit Item