An efficient algorithm for positive realizations
Classical Analysis and ODEs
2009-09-29 v2
Abstract
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.
Keywords
Cite
@article{arxiv.math/0612551,
title = {An efficient algorithm for positive realizations},
author = {Wojciech Czaja and Philippe Jaming and Maté Matolcsi},
journal= {arXiv preprint arXiv:math/0612551},
year = {2009}
}