An efficient algorithm for positive realizations

Wojciech Czaja (1, 2) , Philippe Jaming (3) , Maté Matolcsi (4)

1 Institute of Mathematics [University of Wroclaw]
2 MARYLAND - Department of Mathematics
3 MAPMO - Mathématiques - Analyse, Probabilités, Modélisation - Orléans
4 Renyi Institute

We observe that successive applications of known results from the theory of positive systems lead to an {\it 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 \cite{large}. Finally, we improve a lower-bound of \cite{mn2} to indicate that the algorithm is indeed efficient in general.

Mots clés: Positive linear systems; discrete time filtering; positive realizations

Domaines: Analyse classique [math.CA]

Wojciech Czaja, Philippe Jaming, Maté Matolcsi. An efficient algorithm for positive realizations. Systems and Control Letters, 2008, pp.doi:10.1016/j.sysconle.2007.11.001. ⟨hal-00121228v2⟩