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 combine recent ideas from the theory of positive systems to give an efficient general algorithm for positive realizations of transfer functions. With the help of our algorithm we determine the minimal order of positive realizations for a family of transfer functions, which complements an earlier result of \cite{large}. Finally, we improve a lower-bound of \cite{mn2} to indicate that our 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. 2006. ⟨hal-00121228v1⟩