Skip to Main content Skip to Navigation
Journal articles

An efficient algorithm for positive realizations

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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00121228
Contributor : Philippe Jaming <>
Submitted on : Wednesday, July 11, 2007 - 10:05:06 PM
Last modification on : Friday, August 2, 2019 - 2:30:10 PM
Document(s) archivé(s) le : Tuesday, September 21, 2010 - 1:19:23 PM

Files

efrevised_arxiv.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

255

Files downloads

189