|
This article is cited in 3 scientific papers (total in 3 papers)
Transfinite sequences in the method of programmed iterations
D. A. Serkovab a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
Abstract:
We consider the problem of retaining the motions of an abstract dynamic system in a given constraint set. Constructions from the method of programmed iterations are extended to problems whose dynamics, in general, does not possess any topological properties. The weaker requirements are compensated by introducing transfinite iterations of the programmed absorption operator. The technique of fixed points of mappings in inductive partially ordered sets is used in the proofs. The proposed procedure produces the set where the problem under consideration is successfully solved in the class of quasistrategies. The control interval is not assumed to be finite.
Keywords:
method of programmed iterations, transfinite iterations, quasistrategies, fixed points, inductive posets.
Received: 31.10.2016
Citation:
D. A. Serkov, “Transfinite sequences in the method of programmed iterations”, Trudy Inst. Mat. i Mekh. UrO RAN, 23, no. 1, 2017, 228–240; Proc. Steklov Inst. Math. (Suppl.), 300, suppl. 1 (2018), 153–164
Linking options:
https://www.mathnet.ru/eng/timm1398 https://www.mathnet.ru/eng/timm/v23/i1/p228
|
Statistics & downloads: |
Abstract page: | 279 | Full-text PDF : | 42 | References: | 57 | First page: | 16 |
|