An efficient algorithm for positive realizations

Wojciech Czaja, Philippe Jaming, Máté Matolcsi

Research output: Contribution to journalArticle

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)436-441
Number of pages6
JournalSystems and Control Letters
Issue number5
Publication statusPublished - May 1 2008



  • Discrete time filtering
  • Positive linear systems
  • Positive realizations

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)
  • Mechanical Engineering
  • Electrical and Electronic Engineering

Cite this