An efficient algorithm for positive realizations
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)