Научная статья на тему 'A method for solving differential inclusions with fixed right end'

A method for solving differential inclusions with fixed right end Текст научной статьи по специальности «Математика»

CC BY
83
12
i Надоели баннеры? Вы всегда можете отключить рекламу.
Ключевые слова
DIFFERENTIAL INCLUSIONS / SUPPORT FUNCTION / STEEPEST DESCENT METHOD / ДИФФЕРЕНЦИАЛЬНЫЕ ВКЛЮЧЕНИЯ / ОПОРНАЯ ФУНКЦИЯ / МЕТОД НАИСКОРЕЙШЕГО СПУСКА

Аннотация научной статьи по математике, автор научной работы — Fominyh Alexander V.

In the paper, we study a differential inclusion with a given continuous convex multivalued mapping. For a given finite time interval, it is required to construct a solution of the differential inclusion, that satisfies the given initial condition or both the initial and final conditions. With the help of support functions, the original problem is reduced to the problem of global minimization of some functions in the space of piecewise continuous functions. In the case of continuous differentiability of the support function of a multivalued mapping with respect to the phase variables, this functional is Gateaux differentiable. In the paper, Gateaux gradient is found, necessary and (in some particular cases) sufficient conditions for the global minimum of the given functions are obtained. On the basis of these conditions, the method of steepest descent is applied to the original problem. Numerical examples illustrate the method realization.

i Надоели баннеры? Вы всегда можете отключить рекламу.
iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.
i Надоели баннеры? Вы всегда можете отключить рекламу.

Метод решения дифференциальных включений с закреплeнным правым концом

В статье изучается дифференциальное включение с заданным выпуклым непрерывным многозначным отображением. Для заданного конечного промежутка времени требуется пoстроить решение дифференциального включения, которое удовлетворяет начальному условию или обоим начальному и конечному условиям. С помощью опорных функций исходная задача сводится к задаче глобальной минимизации некоторого функционала в пространстве кусочно-непрерывных функций. В случае непрерывности производной опорной функции многозначного отображения по фазовым переменным этот функционал дифференцируем по Гато. В работе для данного функционала найдены градиент Гато, выписаны необходимые (и для некоторых частных случаев) достаточные условия минимума. На основании таких условий к исходной задаче применяется метод наискорейшего спуска. Численные методы иллюстрируют реализацию построенного алгоритма.

Текст научной работы на тему «A method for solving differential inclusions with fixed right end»

UDC 517.977.58 Вестник СПбГУ. Прикладная математика. Информатика... 2018. Т. 14. Вып. 4 MSC 49M05

A method for solving differential inclusions with fixed right end*

A. V. Fominyh

St. Petersburg State University, 7—9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation

For citation: Fominyh A. V. A method for solving differential inclusions with fixed right end. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2018, vol. 14, iss. 4, pp. 302-315. https://doi.org/10.21638/11702/spbu10.2018.403

In the paper, we study a differential inclusion with a given continuous convex multivalued mapping. For a given finite time interval, it is required to construct a solution of the differential inclusion, that satisfies the given initial condition or both the initial and final conditions. With the help of support functions, the original problem is reduced to the problem of global minimization of some functions in the space of piecewise continuous functions. In the case of continuous differentiability of the support function of a multivalued mapping with respect to the phase variables, this functional is Gateaux differentiable. In the paper, Gateaux gradient is found, necessary and (in some particular cases) sufficient conditions for the global minimum of the given functions are obtained. On the basis of these conditions, the method of steepest descent is applied to the original problem. Numerical examples illustrate the method realization.

Keywords: differential inclusions, support function, the steepest descent method.

1. Introduction. Differential inclusions [1, 2] are often necessary in mathematical modeling of systems with incomplete description [3, 4] and in analyzing the behavior of discontinuous systems [5]. It is also known, that many optimal control problems under natural assumptions may be reduced to differential inclusions [4]. Finding solutions for a differential inclusion is important for applications [6-8]. As a rule, it is possible to obtain an analytical solution of a differential inclusion only in special cases but in the other cases one has to use numerical methods for this purpose.

Well-known classical methods of ordinary differential equations have been applied to exploring Cauchy problem with differential inclusions (the forward Euler method [9], implicit Euler numerical scheme [10, 11], a modification of Euler scheme [12]). Some authors also applied Runge—Kutta schemes to discontinuous equations and differential inclusions (see, e. g., [13, 14]). Attainability sets of differential inclusions were also studied in some works (see, e. g., [15-18]). A survey of difference methods for differential inclusions can be found in [19]. A noticeably smaller number of papers is devoted to the problem of solving differential inclusions with fixed right end. For example, an algorithm to solve boundary value problems for differential inclusions was constructed in [20].

Although there exist many explorations of the problem considered in this article, papers with the constructive methods are just a quite small part of them. But even in these investigations, as it has been noted, the majority of the known numerical methods are applied to the Cauchy problem with differential inclusions. There are few works containing the case, when the right end is fixed. So this work is aimed to obtain concrete solutions (including problems with the fixed right). The general ideas of the method of the paper date back to the scientific school of V. F. Demyanov, which is distinguished by constructiveness

* The work is supported by Russian Found of Fundamental Research (project N 18-31-00014 mol-a). © Санкт-Петербургский государственный университет, 2018

of the developed methods. Another distinguishing feature of the methods of this scientific school (including the method of this article) is continuity in contrast to discrete methods in all the works (on numerical methods) listed above. Such an approach can sometimes be less effective in implementation and in computation (than its discrete analogs), but it is interesting theoretically (the method of this article is original in that it is not based on any discretization of the initial problem).

2. Statement of the problem. Consider the differential inclusion

x € F(x,t) (1)

with the initial condition

x(0) = xo. (2)

In formula (1) F(x,t) is the given continuous multivalued mapping, t € [0,T], x is a «.-dimensional continuous vector-function of the phase coordinates with piecewise continuous (with the finite number of the points of discontinuity) and bounded derivative in the interval [0,T], T > 0, is the given moment of time. In formula (2) x0 € Rn is the given vector. We assume, that the function F(x,t) puts in correspondence a certain convex compact set from Rn for every moment of time t € [0,T] and for every phase point x € Rn. We also suppose, that the support function of the multivalued mapping F(x,t) is differentiable in x and that its derivative in x is continuous. This assumption is satisfied, for example, in optimal control problems with controllable systems described by the ordinary differential equations system, where in the right-hand side there is a continuously differentiable function, and control belongs to some convex compact set for each t € [0,T].

It is required to find the vector-function x* € Cn[0,T], which satisfies inclusion (1) at every point t € [0,T] and satisfies condition (2). (Actually, under the assumptions made, there exists even a continuously differentiable (classical) solution [4, p. 213, Corollary after Theorem 2].

Here Cn[0,T] is the space of «-dimensional vector-functions, continuous in [0,T], with derivative from the space Pn[0,T], Pn[0,T] is the space of «-dimensional vector-functions, piecewise continuous and bounded in [0,T], with the finite number of the points of discontinuity in the interval [0,T]. If t0 € [0,T) is the point of discontinuity of the vector-function x, then we suppose, that x(t0) is a right-handed derivative of the vector-function x at the point t0, x(T) is a left-handed derivative of the vector-function x at the point T. For the arbitrary set F c Rn define the support function (of the vector — € Rn) as follows: c(F, —) = sup(f, —), where (a, b) is the inner product of the vectors a,b € Rn. f

Remark 1. Instead of trajectories from the space Cn[0,T] with derivatives from the space Pn[0,T] one can consider absolutely continuous in the interval [0,T] trajectories with measurable and almost everywhere bounded in [0,T] derivatives (which must satisfy the differential inclusion almost everywhere on [0,T]) respectively. The choice of the space of solutions in the paper is explained by the possibility of their practical construction. Note, that in the Cauchy problem there usually exists infinite number of solutions. As it has been noted, this set of solutions contains a continuously differentiable solution. But as we will see below, there is no guarantee, that we will obtain such a solution, applying the method of the paper (we will possibly obtain a solution, which is not continuously differentiable (see examples below, point 7)).

3. Equivalent statement of the problem. Further, for brevity, we sometimes write F instead of F(x,t). Since for all t € [0,T] and for all x € Rn the multivalued mapping F(x,t) is a convex, closed and bounded set in Rn, inclusion (1) may be rewritten as follows [3]:

(x(t),^)$c(F(x(t),t),^) W e S, Vt e[0,T],

where S is the unit sphere in Rn with the center in the origin. Denote z(t) = x(t), z e Pn[0,T], then from (2), we get

t

z(t) = xo + ^ z(t)dr.

Put

l(^,z,t) = (z(t),^)-c(F (x(t),t),^), (3)

h(z,t) = maxmax{0,i(^, z,t)} (4)

^iS

and construct the functional

T

<p(*) = \f h2(z(t),t)dt. (5)

0

Consider the set

Q = {z € Pn[0,T] | p(z) = 0}. It is not difficult to see, that for functional (5) the relations are valid

p(z)=0 (z € Q), if (X(t),^)$c(F (x(t),t),^) V^ € S, yt € [0,T],

p(z) >0 (z £ Q), otherwise.

So, the problem of finding a solution of differential inclusion (1) with initial condition (2) is reduced to the minimization of functional (5) in the space Pn[0,T]. If z* € Pn[0,T] is the solution of this problem, then

t

x* (t)= xo + J z*(t)dr

o

is the solution of problem (1), (2).

4. Differential properties of functional y. As it has been noted, we suppose, that the support function c(F(x,t),ф) of the multivalued mapping F(x,t) is differentiable in

dc(F (x,t),ф)

the phase variable x and that the vector-function---is continuous in (x,

dx

Then for all x,y e Cn [0,T], and for all ф e S, t e [0,T], the following relation holds: c(F(x(t) + ay(t),t)^)- c(F(x(t),t), ф) =

= a( ^ ,y{t)| + 0(a,x(t), y(tM,t), (6)

o(a,x(t),y(t)^,t) --► 0, when о. \ 0.

a

Let v e Pn[0,T]. Fix the point z e Pn[0,T]. Put

za(t) = z(t) + av(t),

t

y(t) = / v(T)dT. (7)

0

Using the property of the additivity of a support function in the first argument [4, p. 198, Property 3] and equations (6), (7), let us calculate

¿(^, za,t) = ¿(^, z, t) + aH\(^, z,v,t) + o(a,

y ' 0, when a | 0,

a

where

HM, z,v,t) = (<M(i)> - ( [ v(r)dr, 3c(i,(l(i),i)'

[J

0

Using relations (3), (4), find

h(za,t) = h(z,t) + aH (z,v,t) + o(a,t),

o(a,t) K ' ' 0, when a | 0,

here

H(z,v,t) = max Hi(ip,z,v,t), if тях£(ф, z, t) > 0,

■ipiR(z,t)

H (z, v, t) = 0, if max l(^,z,t)<0, H(z,v,t) = max max.{0,Hi(ip,z,v,t)}, if max^(V>, z,t) = 0,

with

R(z,t) = l'tp(z,t) e S | max{0,£(ip,z,t)} = max max{0,£(ip,z,t)}\.

Due to the structure of functional (3) it is easy to see, that in the case ¿(^, z,t) > 0 the maximum of the function

max{0^(^, z,t)} = ¿(^, z, t)

is reached at the only element ^*(z,t) e S. Actually, in this case the point z does not belong to the set F. From the properties of the support function, it is known [3], that at every fixed t e [0,T] the value h(z(t),t) is the Euclidean distance from the point z(t) to the set F(x(t),t), that is h(z(t),t) = \\z(t) - f (x(t),t)\\ (the Euclidean norm), where f (x(t),t) is the projection of the point z(t) on the set F(x(t),t), which is unique as F(x(t),t) is the convex compact. Hence it is clear, that the maximum of the expression h(z(t),t) = £(^,z(t),t) = (z(t),^)-c(F(x(t),t),^) = \\z(t)-f(x(t),t)\\ is reached at the vector i>*(z(t),t) = (z(t) - f (x(t),t))/\\z(t) - f (x(t),t)\\, which is unique because of the uniqueness of the vector f(x(t),t). So in this case the set R(z,t) consists of the only element ^*(z,t).

Now, it is not difficult to obtain the expansion

T

(z„) = v(z) + a J h(z(t),t)H (z(t),v(t),t) + o(

0

T

^(z0) = ^(z) + a J h(z(t),t)H (z(t),v(t),t) + o(a,t)dt. (8)

a

It is obvious, that if 2 e Q, then the functional p is Gateaux differentiable, and its Gateaux gradient vanishes.

Consider the case 2 £ Q. Denote

w(z, t) = max z, t)2 > 0.

As it has been already noted, in this case this maximum is reached at the only element ^*(z,t). Then the function ^*(z,t) is continuous in z at the fixed t [21], therefore, in view of the continuity of the function ^(-POM),^) we conclude, that the function ^(M)

J ox 1 dz

is continuous in z at the fixed t. Further, by Lagrange's mean value theorem there exists such a number d = 6(t) e [0,1], that

idw(z + dav,t) \

w(z + av,t) — w(z,t) = a{-,v) =

> dz '

= I^L i^im)^ | w Q

> dz I 1 dz dz I

Then we have

T

p(z + av) — p(z) f I . . dw(z(t),t) '

f{^ dz )dt

Г I dw(z(t) + eav(t),t) dw(z(t),t)\

J Ht}'-Fz---дГ~Г

, max нт Г II dW{z{t) + eav{t),t) _ dW(z(tlt) ,,

u[0,t] J II dz dz И

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

The multiplier max ||v(t)|| is bounded, as v e Pn[0,T]. The norm under the integral tends te[0,T ]

to zero, when a j 0 at the every fixed t e [0, T] due to the continuity of the function in z at the fixed t. Besides, this norm is bounded due to the continuity of the function . Then by Lebesgue's dominated convergence theorem expression (9) tends to zero, when a I 0, what proves Gateaux differentiability of the functional p in the case z £ Q.

Theorem 1. If the support function c(F,^) of the multivalued mapping F(x,t) is differentiable in the phase variable x and its derivative in x is continuous, then the functional p is Gateaux differentiable and its gradient at the point z is expressed by the formula

- h(z,t)4>*(z,t)(10)

t

where rtl)*(z,t) e R(z,t).

5. Necessary minimum conditions. From the known minimum condition [22, p. 85, Theorem 2.5.1] of Gateaux differentiable functional, expression (10) and the uniqueness of the zero solution of the homogeneous Volterra integral equation of the second kind we conclude, that the following theorem holds.

a

Theorem 2. Let the conditions of Theorem 1 hold. For the point x* to satisfy inclusion (1) and condition (22), it is necessary and sufficient to have

h(z ,t)ip (z ,t)~ J h(z (t),t)-—-dr = 0„, (11)

t

where rtp*(z*,t) e R(z*,t), and 0„ is the zero element of the space Pn[0,T].

Let us return to the original problem. Suppose, in addition to initial condition (2), there is a finite restriction on the trajectory

x(T ) = xT, (12)

here xT e Rn is the given vector.

It is required to find the vector-function x* e Cn[0,T], which is a solution of differential inclusion (1) and satisfies boundary conditions (2), (12). Suppose, that there exists such a solution.

Introduce the functional

I{z) = -У ' 2

T T

J h2(z(t),t)dt + (x0 + J z(t)dt-xTy

L 0 0

= f(z)+x(z). (13)

It is obvious, that the problem is reduced to the minimization of functional (13) in the space Pn[0,T]. If z* e Pn[0,T] is the solution of this problem, then

t

* z

x*(t)=xo + J z*(t)d

is the solution of problem (1), (2), (12).

Using again expansion (8), and also calculating Gateaux gradient for the functional x and using the known minimum condition [22, p. 85, Theorem 2.5.1], we verify the following theorem.

Theorem 3. Let the conditions of Theorem 1 hold. For the point x* to satisfy inclusion (1) and conditions (22), (12), it is necessary to have

V^(z*) + Vx(z*) =

h(*+M*(*+\ f hi *( \ ^c(F(x*(t),t),iP*(z*(t),t)) = h(z ,t)ip (z ,t)~ J h(z (t),t)-—-d,T +

t

T

+ x0 + J z*(t)dt - xT = 0n, (14)

0

where ip*(z*,t) e R(z*,t).

If we have I(z*) = 0, then condition (14) is also sufficient.

6. The steepest descent method. Describe the steepest descent method [23] for finding stationary points of the functional p (the functional I). Fix an arbitrary point

zi e Pn[0,T]. Let the point zk e Pn[0,T] be already constructed. If minimum condition (11) or (14) holds, then the point zk is the stationary point of the functional p (the functional I), and the process terminates. Otherwise put

zfc+i = zk - YkVp(zk)

(zfc+i = zk - YkVI(zk)),

here the vector-function

t

Xk (t) = xo + J Zk (t)dT

and the magnitude Yk is the solution of the following one-dimensional minimization problem:

minp(zk - YVp(zk)) = ¥>(zk - YkVp(zk)) ( min I (zk - yVI (zk)) = I (zk - YkVI (zk))). (15)

Due to (15) p(zk+1) ^ p(zk) (I(zk+1) ^ I(zk)). If the sequence {zk} is finite, then its last point is the stationary point of the functional p (the functional I) by construction.

Let the functional Vp (the functional VI) be Lipschitz continuous on the ball in

L„[0,T] with the center in the origin and the radius r > sup ||^||[o,t]• ^Lebesgue set

Z1 = {z e Pn[0,T] \ p(z) ^ p(z1) (I (z) ^ I (zi))} is supposed to be bounded in the

Ln\0,T] norm.) If the sequence {zk} is infinite, then it can be shown, that the method converges [23] in the sense

\\Vp(zk)\\L2 [0 T] ^ 0, when k

(||V/(zk)\\L2n[0 T] ^ 0, when к ^^

where L2n[0,T] is the space of square summable n-dimensional vector-functions in the interval [0,T].

7. Numerical examples. Let us consider some examples of the implementation of the proposed algorithm. In the first three examples, differential inclusions with a free right end are investigated, then in the following two examples the right end is fixed. The symbol' means transposition. The calculations were performed symbolically in the Maple 12.0 package.

Example 1. Consider the differential inclusion

x e F(x), F(x) = ([-1, 1],x1)', t e[0,1], and the initial condition

x(0) = (0,0)'.

Here one of the solutions is evident. For example, one can take z1 = в e [-1,1], then xi = pt, z2 = x1 = pt and x2 = 0.5pt2. However, let us demonstrate in detail the steps of the algorithm in this simple example. We choose a starting point, which is not a solution, and make one iteration according to the described algorithm.

dc

In this example c(F,ip) = |?/>i| + £1^2, tt- = (^2,0) . Put z\ = (2,xi 1)', where x\ \

dx - -

is x1 on the first iteration. By formula (3) we have

i(^,zi,t) = 2^i -\ = ^1, > 0,

£(^,zi,t) = 3^i, fa < 0,

and

and from (4) we get

тах(2ф1 -|ф1 \) = 1, where ф* = (1,0)',

•ф^Б

h(zi,t) = 1.

The gradient of the functional p at the point z1 is of the form (see (10))

1

Vp(zi) = (1,0)' -J (0,0)'dr =(1,0)'.

t

Construct the next point z2 = (2 - y, x2 i)', where x2 i is xi on the second iteration. Calculate

l(V, z2,t) = (2 - y )Vi - \ Vi\ = (1 - Y )Vi, Vi > 0,

i(^,z2,t) = (3 - y)Vi, Vi < 0.

For the point z2 to satisfy the considered differential inclusion, it is necessary to have i(V,z2,t) ^ 0 for all V e S and for all t e [0,T], which is true, when y1 e [1, 3].

We get z2 = (2- y1,x2 0 = (3,x2 i), / e [-1,1], so the point on the second iteration

t

41) ■= X2(t) = J z2(t)dT

is the solution of this example.

Example 2. Consider the differential inclusion

X e F(x,t), F(x,t) = [0.5xt, 1.5xt], t e[0,1], (16)

and the initial condition

x(0) = 1. (17)

dc

In this example = хЛ(ф + 0.5Щ), — = Ыф + 0.5Ы), if ж > 0. We see, that

dx

here appears an additional phase restriction, so formally the considered method can't be applied to this problem (as in the statement of the problem considered in this paper, we don't have the phase constraints). However, the method was successfully applied to this problem, as with the chosen point z1 the points xi satisfy the constraint xi > 0 at all iterations.

Put z1 = 1, then x1 = t + 1. By formula (3) we have

£(ф, z1 ,t) = ф - t(t + 1)(ф + 0.5|ф|) = ф - 1.5t(t + 1)ф, ф > 0, £(ф, z1 ,t) = ф - t(t + 1)(ф + 0.5|ф|) = ф - 0.5t(t + 1)ф, ф < 0, Вестник СПбГУ. Прикладная математика. Информатика... 2018. Т. 14. Вып. 4 309

and

max (ф - t(t + 1)(ф + 0.5|ф|)) = 1 - 1.5t(t + 1), t e[0,1], ф* = 1.

Let t* e [0,1] be the root of the equation 1 — 1.5t(t + 1) = 0, and from (4) we get

h(z1,t) = 1 — 1.5t(t + 1), t e [0,t*],

h(z1,t)=0, t e[t*, 1]. The gradient of the functional p at the point z1 is of the form (see (3))

t*

Vp(z1) = 1 — 1.5t(t + 1) — f (1 — 1.5t(t + 1)]1.5rdr, t e[0,t*],

t

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

Vp(zi)=0n, t e[t*, 1].

Applying the algorithm, one can see, that the point on the 3rd iteration (with precision up to the 4th sign)

x* (t) ■= хз =

0.5837t5 - 0.5086t4 + 0.3914t3 + + 0.6187t2 + 0.0107t + 1, t € [0,t*], 1.1612 + 0.5t2, t €[t*, 1],

is the solution of this example. Figure 1 shows the functions 0.5x*(t)t, 1.5x*(t)t and z*(t) (on the 3-rd iteration). As the function z*(t) lies "between" the functions 0.5x*(t)t and 1.5x*(t)t at every t e [0,1], we see, that inclusion (16) is satisfied. (The condition (17) is automatically satisfied at every iteration.)

0.2 t* 0.6

Figure 1. Solution of Example 2 Example 3. Consider the differential inclusion

x e F(x), F(x) = (x2,x1)' + B, t e[0,1],

(18)

where B is a unit ball in Rn with the center in the origin ({b = {x e R2 | ^ x2 ^ 1}

B is a

and the boundary conditions

x(0) = (0.5,0.25)',

(19)

x(1) = (1.75,2)'. (20)

qc

In this example c(F, VO = + + xAAi+W, tt = (^2, V'l)'- Put 21 = (2,1)', then

dx

x1 = (0.5 + 2t, 0.25 +1)'.

By formula (3) we have

е(ф, zi,t) = 2ф1 + Ф2 - (0.25 + t^i - (0.5 + 2t)ф2 -J ф2 + Ф2 =

max

where

= (1.75 - t^i + (0.5 - 2Ь)ф^ -у/ ф2 + ф2, ((1.75 - 1)фг + (0.5 - 2î)V>2 - \!ф\ + Ф\)

феБ \ » /

= л/(1.75 -1)2 + (0.5 - 2t)2 - 1,

,* , 1.75 -1 0.5 - 2t

ф* =

, v/(1.75 -t)2 + (0.5- 2t)2' v/(1.75 -t)2 + (0.5 - 2t)2 / ' and from (4) we get

/i(zi,t) = >/(1.75-t)2 + (0.5-21)2 - 1. The gradient of the functional p at the point z1 is of the form (see (10))

Wzi) = hM) (i 7K-* ns-9*)'-

\J(1.75 - t)2 + (0.5 - 2t)2

- f iO K - 9t 1 7K - t\'d.T

J yj(1.75 - t)2 + (0.5 - 2r)2

Applying the algorithm, one can see, that the point on the 4th iteration (with precision up to the 4th sign)

xX*(t) ■= X4 1 =

x*(t) ■= X4 2 =

0.5 - 0.0525t3 + 0.4248t2+ + 0.7192t + 0.0078t4 - 0.001t5, t e [0,0.1021], 0.5008 - 0.1707t3 + 0.7395t2 + 0.6804t, t e [0.1021,1],

Î0.25 + 0.1424t3 - 0.0808t2+ + 1.3539t - 0.0022t4 + 0.0012t5, t e [0,0.1021], 0.2630 - 0.1027t3+

+ 0.6897t2 + 1.1499t, t e [0.1021,1],

is the solution of this example. (The first index denotes the iteration number, and the second index denotes the coordinate number.) Rewrite inclusion (18) in the following way:

Xi(t) = X2 (t) + ui(t),

X2 (t) = Xl(t) + U2 (t),

^Jv2(t)+v2(t) «S 1, ¿6 [0,1].

Figure 2 shows the functions x\(t) and x2(t) (on the 4-th iteration). As we can see, condition (20) is satisfied. Figure 2 also shows the function \Ju\2(t) + «^(t), where = - x2(t), w2(t) = - x\(t) (on the 4-th iteration). As \Ju\2(t) + u^it)

^ 1 at every t e [0,1], we see, that inclusion (18) is satisfied. (Condition (19) is automatically satisfied at every iteration.)

2

1 t

0.2 0.6 1

Figure 2. Solution of Example 3 Example 4. Consider the differential inclusion

x e F(x), F(x) = (x2, 2xi)' + D, t €[0,1], (21)

where D is a unit rhombus Rn with the center in the origin (D = {x e R2 | ^ l}

\ ¿=i

and the boundary conditions

x(0) = (0,1)', (22)

x(1) = (1.75, 2)'. (23)

dc

In this example c(F,tp) = x^i + 2xi?/>2 + max{|V>i|, IV^I}, -r— = (2^2,2x2?/>i)'. Put

dx

z1 = (1,1)', then x1 = (t, 1 +1)'. By formula (3) we have

zi,t) = + ^2 -(1 + t)2^i - 2tfa - max{|^i|, |^21} =

= (1 - (1 + t)2)^i + (1 - 2t)^2 - max{|^i|, |^2|>. One can see, that the point on the 13th iteration (with precision up to the 4th sign)

-0.0833t4 + 0.1666t3 + 1.3332t, t e [0,0.4901],

0.8103 + 5.3677t4 - 12.5804t3 + + 11.8697t2 - 3.7173t, t e [0.4901,1],

x*1(t) := xi3_i =

+ 1:

r1 + 0.045t5 + 0.0833t4 - 0.1666t3 + 0.417t, t e [0,0.4901],

x2 (t) := Xi3_2 =

1.5777 + 2.2506t4 - 5.2491t3 + + 6.3034t2 - 2.8826t, t e [0.4901,1],

is the solution of this example. (The first index denotes the iteration number, and the second index denotes the coordinate number.)

Rewrite inclusion (21) in the following way:

xi(t) = ^^(t) + ui(t), ±2(t) = 2xi(t)+u2(t),

K(t)l + k(t)K i, t €[o, 1].

Figure 3 shows the functions x\(t) and x1(t) (on the 13th iteration). As we can see, condition (23) is satisfied. Figure 3 also shows the function |u1(t)| + |u1(t)|, where u*1(t) = z1(t)-x12(t), u1(t) = z|(t)-2xï(t) (on the 13th iteration). As K(t)|+ |u1(t)| ^ 1 at every t e [0,1], we see, that inclusion (21) is satisfied. (Condition (22) is automatically satisfied at every iteration.) Figure 4 shows the functions x 1 (t) and x2(t) (on the 1st, 5th and 9th iterations). (The first index denotes the iteration number, and the second index denotes the coordinate number.) As it was noted, the point z 1 (t) = (1,1)' was taken on the first iteration (so x 1 (t) = (t, 1 + t)' by (22)). Table shows the values of I(zk), ||Vy>(zk)||, ||Vx(zfc)|| (on the 1st, the 5th, the 9th and the 13th iterations). As we can see, the exact solution (I(z13) = 0) was obtained for this example. (This is due to the structure of functional I(z) and the fact, that is was possible to obtain the exact value of Yk on some iterations (including the 13th iteration) in problem (15)).

Figure 3. Solution of Example 4

Table. Example 4: values on some iterations

к I(zfc) l|V¥>(*fc)ll l|Vx(*fc)||

1 0.7089 1.7403 0.75

5 0.3753 0.7286 0.5995

9 0.1229 0.2966 0.2223

13 0.0 0.0 0.0

0.2 0.6 1

Figure 4- Example 4: some iterations

8. Conclusion. The considered problem of constructing an optimal control in the form of Lagrange with integral restriction on control reduces to the variational problem of minimizing a nonsmooth functional on the whole space. For this functional the subdifferential and the hypodifferential are obtained, the necessary minimum conditions are found, which are also sufficient in a partial case. The methods of the subdifferential descent and the hypodifferential descent are applied to the problem. The results are illustrated with numerical examples.

References

1. Aubin J.-P., Cellina A. Differential inclusions. Berlin, Springer-Verlag Publ., 1984, 344 p.

2. Polovinkin E. S. Mnogoznachnyj analiz i differencialnye vklyucheniya [Multivalued analysis and differential inclusions]. Moscow, Fizmatlit Publ., 2014, 597 p. (In Russian)

3. Blagodatskih V. I. Vvedenie v optimalnoe upravleniye [Introduction to optimal control]. Moscow, Vysshaya shkola Publ., 2001, 239 p. (In Russian)

4. Blagodatskih V. I., Filippov A. F. Differencialnye vklyucheniya i optimalnoe upravlenie. Differential inclusions and optimal control. Proceedings of the Steklov Institute of Mathematics, 1985, vol. 169, pp. 194-252. (In Russian)

5. Filippov A. F. Differencialnye uravneniya s razryvnoj pravoj chastyu [Differential equations with discontinuous right-hand side]. Moscow, Nauka Publ., 1985, 226 p. (In Russian)

6. Watbled F. On singular perturbations for differential inclusions on the infinite interval. Journal of Mathematical Analysis and Applications, 2005, vol. 310, no. 2, pp. 362-378.

7. Gama R., Smirnov G., Watbled F. Stability and optimality of solutions to differential inclusions via averaging method. Set-Valued and Variational Analysis, 2014, vol. 22, no. 2, pp. 349-374.

8. Chengi Yi. Existence of solutions for a class of nonlinear evolution inclusions with nonlocal conditions. Journal of Optimization Theory and Applications, 2014, vol. 162, no. 1, pp. 13-33.

9. Sandberg M. Convergence of the forward Euler method for nonconvex differential inclusions. SIAM J. Numer. Anal., 2008, vol. 47, no. 1, pp. 308-320.

10. Bastien J. Convergence order of implicit Euler numerical scheme for maximal monotone differential inclusions. Z. Angew. Math. Phys., 2013, vol. 64, pp. 955-966.

11. Beyn W-J., Rieger J. The implicit Euler scheme for one-sided Lipschitz differential inclusions. Discrete and Continuous Dynamical Systems. Series B, 2010, vol. 14, no. 2, pp. 409-428.

12. Lempio F. Modified Euler methods for differential inclusions. Set-Valued Analysis and Differential Inclusions. A Collection of Papers resulting from a Workshop held in Pamporovo. Bulgaria, September 17-21, 1990. Eds by A. B. Kurzhanski, V. M. Veliov. Progr. Systems Control Theory 16. Boston, Basel, Berlin, Birkhauser Verlag Publ., 1993, pp. 131-148.

13. Veliov V. Second order discrete approximations to strongly convex differential inclusions. Systems Control Lett., 1989, no. 13, pp. 263-269.

14. Taubert K. Dierenzenverfahren fiir Schwingungen mit trockener und zdher Reibung und fiir Regelungssysteme. Numer. Math., 1976, no. 26, pp. 379-395.

15. Nikol'skiy M. S. Ob approksimacii mnozhestva dostizhimosti dlya upravlyaemogo processa [On approximation of the attainability domain of control process]. Mat. Zametki [Mat. notes], 1987, no. 41, pp. 71-76. (In Russian)

iНе можете найти то, что вам нужно? Попробуйте сервис подбора литературы.

16. Nikol'skiy M. S. Ob odnom metode approksimacii mnozhestva dostizhimosti dlya differencialnogo vklyucheniya [On a method for approximation of attainable set for a differential inclusion]. Journal of Vych. Mat. Math. Phys., 1988, vol. 28, pp. 1252-1254. (In Russian)

17. Panasyuk A. I. Equations of attainable set dynamics. Pt 1. Integral funnel equations. Journal of Optim. Theory Appl., 1990, no. 64, pp. 349-366.

18. Baier R., Gerdts M., Xausa I. Approximation of reachable sets using optimal control algorithms. Numer. Algebra Control Optim., 2013, vol. 3, pp. 519-548.

19. Dontchev A., Lempio F. Difference methods for differential inclusions: A survey. SIAM Rev., 1992, vol. 34, iss. 2, pp. 263-294.

20. Schilling K. An algorithm to solve boundary value problems for differential inclusions and applications in optimal control. Numer. Funct. Anal. and Optimiz., 1989, vol. 10, iss. 7, pp. 733-764.

21. Bonnans J. F., Shapiro A. Perturbation analysis of optimization problems. New York, Springer Science+Business Media, 2000, 600 p.

22. Demyanov V. F. Usloviya ehkstremuma i variacionnoe ischislenie [Extremum conditions and variation calculus]. Moscow, Vysshaya shkola Publ., 2005, 335 p. (In Russian)

23. Kantorovich L. V., Akilov G. P. Funkcionalnyj analiz [Functional analysis]. Moscow, Nauka Publ., 1977, 741 p. (In Russian)

Received: April 8, 2018.

Accepted: September 25, 2018.

Author's information:

Alexander V. Fominyh — PhD in Physics and Mathematics, Assistant; alexfomster@mail.ru

Метод решения дифференциальных включений с закрепленным правым концом

А. В. Фоминых

Санкт-Петербургский государственный университет, Российская Федерация, 199034, Санкт-Петербург, Университетская наб., 7—9

Для цитирования: Fominyh A. V. A method for solving differential inclusions with fixed right end // Вестник Санкт-Петербургского университета. Прикладная математика. Информатика. Процессы управления. 2018. Т. 14. Вып. 4. С. 302-315. https://doi.org/10.21638/11702/ spbu10.2018.403

В статье изучается дифференциальное включение с заданным выпуклым непрерывным многозначным отображением. Для заданного конечного промежутка времени требуется гостроить решение дифференциального включения, которое удовлетворяет начальному условию или обоим начальному и конечному условиям. С помощью опорных функций исходная задача сводится к задаче глобальной минимизации некоторого функционала в пространстве кусочно-непрерывных функций. В случае непрерывности производной опорной функции многозначного отображения по фазовым переменным этот функционал дифференцируем по Гато. В работе для данного функционала найдены градиент Гато, выписаны необходимые (и для некоторых частных случаев) достаточные условия минимума. На основании таких условий к исходной задаче применяется метод наискорейшего спуска. Численные методы иллюстрируют реализацию построенного алгоритма.

Ключевые слова : дифференциальные включения, опорная функция, метод наискорейшего спуска.

Контактная информация:

Фоминых Александр Владимирович — канд. физ.-мат. наук, ассистент; alexfomster@mail.ru

i Надоели баннеры? Вы всегда можете отключить рекламу.