This paper presents a method of the determination of characteristic polynomial realisations of the fractional positive system. The algorithm finds a complete set of all possible realisations instead of only a few realisations. In addition, all realisations in the set are minimal. The proposed method uses a parallel computing algorithm based on a digraphs theory which is used to gain much needed speed and computational power for a numeric solution. The presented procedure has been illustrated with a numerical example.
CITATION STYLE
Hryniów, K., & Markowski, K. A. (2015). Digraphs minimal realisations of state matrices for fractional positive systems. Advances in Intelligent Systems and Computing, 350, 63–72. https://doi.org/10.1007/978-3-319-15796-2_7
Mendeley helps you to discover research relevant for your work.