An efficient algorithm for positive realizations |
| |
| Authors: | Wojciech Czaja, Philippe Jaming,M t Matolcsi |
| |
| Affiliation: | aInstitute of Mathematics, University of Wroclaw, Pl. Grunwaldzki 2/4, 50-384 Wroclaw, Poland;bDepartment of Mathematics, University of Maryland, College Park, MD 20742, USA;cMAPMO-Fédération Denis Poisson, Université d’Orléans, B.P. 6759, 45067 Orléans cedex 2, France;dAlfréd Rényi Institute of Mathematics, Budapest, H-1053, Hungary |
| |
| Abstract: | 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 [L. Benvenuti, L. Farina, An example of how positivity may force realizations of ‘large’ dimensions, Systems Control Lett. 36 (1999) 261–266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782–784] to indicate that the algorithm is indeed efficient in general. |
| |
| Keywords: | Positive linear systems Discrete time filtering Positive realizations |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
