|
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2015, Volume 25, Issue 4, Pages 459–472
(Mi vuu500)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
MATHEMATICS
A parallel algorithm for constructing approximate attainable sets of nonlinear control systems
A. A. Zimovetsa, A. R. Matviichukb a Department of Dynamical Systems, N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620990, Russia
b Department of Information Technologies, N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620990, Russia
Abstract:
The paper investigates the effectiveness of shared memory parallel programming approach for constructing approximate attainable sets of nonlinear control systems in a finite-dimensional Euclidean space. In this study, we propose a parallel iterative algorithm for constructing approximate attainable sets employing a regular Cartesian grid for spatial discretization. The proposed algorithm has been designed for implementation on SMP systems and handles such issues as data decomposition, threads synchronization and distribution of work between multiple threads. Numerical experiments on a system with two quad-core processors confirmed a high efficiency of shared memory parallel programming approach for applying grid-based methods to construct approximate attainable sets.
Keywords:
attainability set, parallel algorithm, control system, grid-based method.
Received: 16.10.2015
Citation:
A. A. Zimovets, A. R. Matviichuk, “A parallel algorithm for constructing approximate attainable sets of nonlinear control systems”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 25:4 (2015), 459–472
Linking options:
https://www.mathnet.ru/eng/vuu500 https://www.mathnet.ru/eng/vuu/v25/i4/p459
|
Statistics & downloads: |
Abstract page: | 391 | Full-text PDF : | 190 | References: | 101 |
|