02386nab a2200253 i 4500 acta75625 20220513092955.0 220513s2022 hu o 0|| eng d 0324-721X 10.14232/actacyb.291870 doi SZTE Egyetemi Kiadványok Repozitórium hun eng Szlobodnyik Gergely Computing different realizations of linear dynamical systems with embedding eigenvalue assignment [elektronikus dokumentum] / Szlobodnyik Gergely University of Szeged, Institute of Informatics Szeged 2022 585-611 Acta cybernetica 25 No. 3 In this paper we investigate realizability of discrete time linear dynamical systems (LDSs) in fixed state space dimension. We examine whether there exist different Θ = (A,B,C,D) state space realizations of a given Markov parameter sequence Y with fixed B, C and D state space realization matrices. Full observation is assumed in terms of the invertibility of output mapping matrix C. We prove that the set of feasible state transition matrices associated to a Markov parameter sequence Y is convex, provided that the state space realization matrices B, C and D are known and fixed. Under the same conditions we also show that the set of feasible Metzler-type state transition matrices forms a convex subset. Regarding the set of Metzler-type state transition matrices we prove the existence of a structurally unique realization having maximal number of non-zero off-diagonal entries. Using an eigenvalue assignment procedure we propose linear programming based algorithms capable of computing different state space realizations. By using the convexity of the feasible set of Metzler-type state transition matrices and results from the theory of non-negative polynomial systems, we provide algorithms to determine structurally different realization. Computational examples are provided to illustrate structural non-uniqueness of network-based LDSs. Természettudományok Számítás- és információtudomány Számítástechnika, Programozás, Algoritmus Szederkényi Gábor aut Conference of PhD Students in Computer Science (12.) (2020) (Szeged) http://acta.bibl.u-szeged.hu/75625/1/cybernetica_025_numb_003_585-611.pdf Dokumentum-elérés