An efficient algorithm for positive realizations

We observe that successive applications of known results from the theory of positive systems lead to an 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 [6]. Finally, we improve a lower-bound of [18] to indicate that the algorithm is indeed efficient in general. Key words: Positive linear systems, discrete time filtering, positive realizations

• Type: Journal
• Year: 2008
• Where: SCL
• Authors: Wojciech Czaja, Philippe Jaming, Máté Matolcsi
• Keywords: Efficient General Algorithm, Positive Realizations, SCL 2008, Successive Applications