- Tytuł:
- Parallel Digraphs-building Computer Algorithm for Finding a Set of Characteristic Polynomial Realisations of Dynamic System
- Autorzy:
-
Hryniów, K.
Markowski, K. A. - Powiązania:
- https://bibliotekanauki.pl/articles/384585.pdf
- Data publikacji:
- 2016
- Wydawca:
- Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
- Tematy:
-
dynamic system
GPGPU
characteristic polynomial
digraphs
algorithm - Opis:
- This paper presents in-depth the parallel computer algorithm for the determination of characteristic polynomial realisations of dynamic system. The main differences between the depicted method and other state of- the-art solutions include finding not few realisations, but a whole set, and the fact that the found realisations are always minimal among all possible. As digraphsbuilding methods used in the algorithm are NP-complete or NP-hard problems, the algorithm is paralleled and GPGPU (General-Purpose computing on Graphics Processor Units) computation is proposed as the only feasible solution. The article describes in detail the proposed method, discusses it’s complexity, presents optimisation solutions and still open problems. The working algorithm is illustrated with a numerical example and compared to results of other known methods.
- Źródło:
-
Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 3; 38-51
1897-8649
2080-2145 - Pojawia się w:
- Journal of Automation Mobile Robotics and Intelligent Systems
- Dostawca treści:
- Biblioteka Nauki
Artykuł