|
This article is cited in 10 scientific papers (total in 11 papers)
Parallel algorithm for calculating the invariant sets of high-dimensional linear systems under uncertainty
A. N. Daryin, A. B. Kurzhanski M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
The development of efficient computational methods for synthesizing controls of high-dimensional linear systems is an important problem in theoretical mathematics and its applications. This is especially true for systems with geometrical constraints imposed on the controls and uncertain disturbances. It is well known that the synthesis of target controls under the indicated conditions is based on the construction of weakly invariant sets (reverse reachable sets) generated by the solving equations of the process under study. Methods for constructing such equations and corresponding invariant sets are described, and the computational features for high-dimensional systems are discussed. The approaches proposed are based on the previously developed theory and methods of ellipsoidal approximations of multivalued functions.
Key words:
dynamic programming, ellipsoidal approximation, parallel computations, algorithm for computing invariant sets of linear systems.
Received: 06.07.2012
Citation:
A. N. Daryin, A. B. Kurzhanski, “Parallel algorithm for calculating the invariant sets of high-dimensional linear systems under uncertainty”, Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013), 47–57; Comput. Math. Math. Phys., 53:1 (2013), 34–43
Linking options:
https://www.mathnet.ru/eng/zvmmf9792 https://www.mathnet.ru/eng/zvmmf/v53/i1/p47
|
|