|
This article is cited in 2 scientific papers (total in 2 papers)
Applied mathematics
Method for finding a solution to a linear nonstationary interval ODE system
A. V. Fominyhab a Institute of Problems in Mechanical Engineering, Russian Academy of Sciences, 61, Bolshoy pr. V. O., St. Petersburg, 199178, Russian Federation
b St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation
Abstract:
The article analyses a linear nonstationary interval system of ordinary differential equations so that the elements of the matrix of the system are the intervals with the known lower and upper bounds. The system is defined on the known finite time interval. It is required to construct a trajectory, which brings this system from the given initial position to the given final state. The original problem is reduced to finding a solution of the differential inclusion of a special form with the fixed right endpoint. With the help of support functions, this problem is reduced to minimizing a functional in the space of piecewise continuous functions. Under a natural additional assumption, this functional is Gateaux differentiable. For the functional, Gateaux gradient is found, necessary and sufficient conditions for the minimum are obtained. On the basis of these conditions, the method of the steepest descent is applied to the original problem. Some numerical examples illustrate the constructed algorithm realization.
Keywords:
linear nonstationary interval system of ordinary differential equations, differential inclusion, support function, the steepest descent method.
Received: November 29, 2020 Accepted: April 5, 2021
Citation:
A. V. Fominyh, “Method for finding a solution to a linear nonstationary interval ODE system”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 17:2 (2021), 148–165
Linking options:
https://www.mathnet.ru/eng/vspui486 https://www.mathnet.ru/eng/vspui/v17/i2/p148
|
Statistics & downloads: |
Abstract page: | 144 | Full-text PDF : | 61 | References: | 24 | First page: | 12 |
|