Finding a set of (A, B, C, D) realisations for fractional one-dimensional systems with digraph-based algorithm: First approach

Abstract

This paper presents the first proposition of a method allowing the determination of a set of (A,B,C) realisations of the one-dimensional fractional system from created digraph. The algorithm presented is the extension of previously published algorithm that finds a complete set of all possible realisations, instead of only a few realisations, as was in case of canonical form methods. The advantages of the proposed method are the possibilities of obtaining a set of statematrices directly from digraph form of the system and using fast parallel computing method. The algorithm is presented in pseudo-code and illustrated with example.