On a Decomposition Method in the Problem of Operation Speed for a Linear Discrete System with Bounded Control

The article presents the problem of operation speed for a linear discrete system with bounded control. For the case when the minimum number of steps necessary for the system to reach zero significantly exceeds the dimension of the phase space, a method of decomposition into scalar and two-dimensional subsystems is developed, based on the reduction of the state matrix to normal Jordan form. Moreover, due to the developed algorithm for adding two polyhedrons with linear complexity, it is possible to construct sets of 0-controllability for two-dimensional subsystems in an explicit form. A description of the main tools for solving the problem of operation speed is also presented, as well as the statement of the decomposition problem. Further, some properties of polyhedrons in the plane are formulated and proved, on the basis of which an algorithm for calculating the set of vertices of the sum of two polyhedrons in R2 in explicit form is developed. In conclusion, the main decomposition theorem is formulated and proved. And on the basis of the developed methods, the solution to the problem of the optimal damping speed of a high-rise structure located in the zone of seismic activity was constructed.

1. Elkin V.I. Subsystems of controllable systems and the problem of terminal control // Autom. Remote Control. 1995. V. 56. No. 1. P. 16–22.
2. Kamachkin A.M., SHamberov V.N. Metod dekompozicii v mnogomernyh nelinejnyh dinamicheskih sistemah // Vestnik VGU. Seriya: Sistemnyj analiz i informacionnye tekhnologii. 2012. No 1. S. 47–55.
3. Weibel C. Minkowski sums of polytopes: combinatorics and computation. Lau- sanne:EPFL, 2007.
4. Fukuda K., Weibel C. On f-vectors of Minkowski additions of convex polytopes // Discrete and Computational Geometry. 2007. No. 37. P. 503–516.
5. Angelov T.A. Nahozhdenie krajnih tochek summy dvuh politopov // Vestn. Vol- gogr. gos. un-ta. Ser. 1, Mat. Fiz. 2016. T. 37. No 6. S. 7–17.
6. Barber C.B., Dobkin D.P., Huhdanpaa H. The quickhull algorithm for convex hulls // ACM Transactions on Mathematical Software. V. 4. No. 22. 1996. P. 469–483.
7. Kamenev G.K., Pospelov A.I. Poliedral’naya approksimaciya vypuklyh kompaktnyh tel metodami napolneniya // ZH. vychisl. matem. i matem. fi z. 2012. T. 52. No 5. S. 818–828.
8. Kamenev G.K. CHislennoe issledovanie effektivnosti metodov poliedral’noj approksimacii vypuklyh tel. M.:Vychislitel’nyj centr RAN, 2010.
9. Cigler G.M. Teoriya mnogogrannikov. M.:MCNMO, 2014.
10. Pontryagin L.S., Boltyanskij V.G., Gamkrelidze R.V., Mishchenko B.F. Matematicheskaya teoriya optimal’nyh processov. M.: Nauka, 1969.
11. Bellman R. Dinamicheskoe programmirovanie. M.: IIL, 1960.
12. Horn R., Dzhonson CH. Matrichnyj analiz. M.:Mir, 1989.
13. Rokafellar R. Vypuklyj analiz. M.: Mir, 1973.
14. Sirotin A.N., Formal’skii A.M. Reachability and Controllability of Discrete-Time Systems under Control Actions Bounded in Magnitude and Norm // Autom. Remote Control. 2003. V. 64. No. 12. P. 1844–1857.
15. Ibragimov D.N., Sirotin A.N. On the Problem of Optimal Speed for the Discrete Linear System with Bounded Scalar Control on the Basis of 0-controllability Sets // Autom. Remote Control. 2015. V. 76. No. 9. P. 1517–1540.
16. Ibragimov D.N. Optimal’noe po bystrodejstviyu upravlenie dvizheniem aerostata // Elektron. zhurn. Tr. MAI. 2015. No 83.
17. Ibragimov D.N. Approksimaciya mnozhestva dopustimyh upravlenij v zadache bystrodejstviya linejnoj diskretnoj sistemoj // Elektron. zhurn. Tr. MAI. 2016. No 87.
18. Ibragimov D.N. On the Optimal Speed Problem for the Class of Linear Autonomous Infi nite-Dimensional Discrete-Time Systems with Bounded Control and Degenerate Operator // Autom. Remote Control. 2019. V. 80. No. 3. P. 393–412.
19. Ibragimov D.N., Sirotin A.N. On the Problem of Operation Speed for the Class of Linear Infi nite-Dimensional Discrete-Time Systems with Bounded Control // Autom. Remote Control. 2017. V. 78. No. 10. P. 1731–1756.