A stability criterion for the single delay equation in terms of the Lyapunov matrix a stability criterion for the single delay equation in terms of the Lyapunov matrix Текст научной статьи по специальности «Математика»

ВЕСТНИК САНКТ-ПЕТЕРБУРГСКОГО УНИВЕРСИТЕТА

Сер. 10. 2013. Вып. 1

ПРОЦЕССЫ УПРАВЛЕНИЯ

UDK 517.929.4

A. V. Egorov, S. Mendié

A STABILITY CRITERION FOR THE SINGLE DELAY EQUATION IN TERMS OF THE LYAPUNOV MATRIX

1. Introduction. In the case of delay systems the Lyapunov-Krasovskii functionals method plays the role of the second Lyapunov approach for the case of ordinary differential equations. The main idea of the method, proposed by Krasovskii in [1], has been developed for linear systems in [2-6].

In [6] complete type functionals, admitting a quadratic lower bounds, were proposed. The functionals have been applied both to the stability analysis and to solutions of some related problems [7-9]. The complete type functionals depend on special matrix valued functions, called, by analogy with ordinary differential equations, the Lyapunov matrices.

It is of interest to find conditions on a Lyapunov matrix, which guarantee the stability of the system. Such conditions have been established in [10] for the linear single delay equations. In [9] some necessary stability conditions have been obtained for the single delay linear systems. In our contribution it is proved that these necessary conditions become sufficient for the case of scalar single delay equation.

The organization of the paper is as follows. In the section 2 a linear delay equation is introduced and stability region for the equation is provided. In section 3 Lyapunov-Krasovskii quadratic functionals with prescribed time derivatives are presented. Section 4 is devoted to the computations of the Lyapunov auxiliary function. The main contribution, a new stability criterion, is proved in section 5. Some concluding remarks end the paper.

2. Preliminaries. We consider a linear time-delay equation of the form

x(t) = ax(t)+bx(t - 1), t > 0, (1)

where a,b G R.

Let us introduce the following notation:

xt(^): в ^ x(t + в,ф), в G [-1, 0],

Егоров Алексей Валерьевич — аспирант кафедры теории управления факультета прикладной математики—процессов управления Санкт-Петербургского государственного университета. Научный руководитель: доктор физико-математических наук, проф. В. Л. Харитонов. Научное направление: уравнения с запаздывающим аргументом. E-mail: [email protected].

Mondié Sabine — профессор кафедры автоматического управления CINVESTAV-IPN, г. Мехико, Мексика. Количество опубликованных работ: более 50. Научное направление: уравнения с запаздывающим аргументом. E-mail: [email protected].

© A. V. Egorov, S. Mondie, 2013

where x(t,p) is the solution of (1) with the initial time instant t0 = 0, and a function It is supposed that the initial function belongs to the space of piecewise continuous, on the segment [-1, 0], functions PC0([-1, 0],R),

x(0,v) = v(0), 0 e [-1,0]. (2)

It is known [11] that the initial value problem (1), (2) has a unique solution, defined on [-1, «>).

We will use the norm

Mh = sup |^(0)|. o e [—1,0]

The equation (1) is said to be exponentially stable if there exist constants y ^ 1 and a > 0, such that

lx(t,p)l < je—(jtMh, t > 0.

The characteristic equation for the equation (1) is

5 - a - be—s = 0. (3)

The exact exponential stability domain in space of coefficients is [12]

ft = ({a + b< 0} H {a - b < 0}) U

U (j|a| < 0} H ja + b cos \Jb2 - a2 < o| H ^b2 -a2 < tt}) .

The first term of this union describes the delay-independent part of the exponential stability domain, while the second term describes the delay-dependent part. The region ft is depicted in figure with the curves, corresponding to parameter values for which the characteristic equation (3) has pure imaginary roots.

b 10

5

0

-5

-10 -5 0 5 10 a

Exponential stability region of (1)

For a symmetric matrix Q, the notation Q > 0 (Q > 0) means that Q is positive definite (positive semidefinite).

3. The Lyapunov-Krasovskii approach. According to the second Lyapunov method, the exponential stability of delay free system

x(t) = Ax(t) (4)

is equivalent to the existence of two positive-definite quadratic forms v(x) = xTVx and w(x) = xTWx, satisfying the condition

^¡v{x{t)) = -w(x(t))

along the solutions x(t) of system (4).

In [6, 7], a generalization of this method was given for delay linear systems. In particular, the true counterpart of the quadratic form v(x) for equation (1) is the functional

v(^) = u(0)^>2(0) + 2bp(0) J u(d + 1)<f(d) dd +

-i

0 0 0 1,2 I I ,„//). \r,,<a. q.\,„<q„\ aq. ao. i „t,. I ,„2/

+ b2 J J ^(di)u(di - 62)^(62) d02 dOi + Wi J v2(e) dd, (5)

-i -i -i

where wi is some positive constant, and u(t) is the function, satisfying the set of equations

u(-t) = u(t), t > 0, (6)

U(t) = au(r)+6u(t - 1), t > 0, (7)

au(0) + bu(-1) = -w, (8)

where w = ^ , and wq is an arbitrary positive constant. In the case of delay systems this function is named the Lyapunov delay matrix. In this paper we name it the Lyapunov function.

The derivative of the functional (5) along the solutions of equation (1) is -w(xt), where

w(y) = wo¥2(0) + Wi¥>2(-1). The proof of the following theorem can be found in [6].

Theorem 1. Equation (1) is exponentially stable if and only if the set of equations (6)-(8) admits a unique continuous solution, and for any (there exists) number Wji G (0, 2w) there exists a constant ¡3 > 0, such that the following inequality holds:

v(<p) > ¡3^(0).

Phrase "for any (there exists)" means that the theorem remains true if we use "for any" or "there exists".

4. The solution of the system (6)—(8). If we have the Lyapunov function u(t), satisfying the system (6)-(8) with w = 1, then the Lyapunov function for any w can be defined as u(t) = wu(t). Therefore, without any loss of generality, below, we take w = 1.

0

The Lyapunov function u(t) on [0,1] is a solution of the system

U(t) = o,u(t) + bu(1 - t), (9)

au(0) + bu(1) = -1. (10)

The following theorem gives exhaustive information about u(t), satisfying (9), (10). The

following identities, which are extensively used, are recalled:

ea + e—a

cosh a = ---= cos(ia),

ea — e—a sinh a = - = —«silica).

Theorem 2. Let us set A = \Ja? —b2 and A = V&2 — a2- All values in the following expressions are real:

1) if |a| > |b|, a + b cosh A = 0, then

b sinh A(1 - t) - a sinh At - A cosh At U{-T' = A(a + 6 cosh A) '

2) if |a| > |b|, a + b cosh A = 0, b > 0, then

cosh A(1 - t) M(T) = A sinh A 5

3) if a = b, b = 0, then

6-1

4) if b > |a|, a + b cos A = 0, then

b sin A(1 - t) - a sin at - A cos At

u(t) = -^-^-;

A(a + b cos A)

5) if b > |a|, a + bcosA = 0, bsin A > 0, then

cos A(1 - t)

u

(r) = -

AA sin AA

In the remaining cases, the Lyapunov function u(t) does not exist. Proof. Let us differentiate the equation (9):

U(t) = aU(T) - bU(1 - t) = a(au(T) + bu(1 - t)) -

- b(au(1 - t) + bu(T)) = (a2 - b2)u(T) = A2u(t) = -A2u(t). (11)

Consider first the third case: a2 - b2 = 0. It is evident that the general solution of (11) has the form

u(t ) = cIt + C2. Substitution of this expression into (9) gives

Ci = a(CiT + C2) + b(Ci(1 - t) + C2),

hence,

(b - 1)Ci + (a + b)C2 =0, (a - b)C1 = 0.

The expression (10) takes the form

bCi + (a + b)C2 = -1.

The obtained system is consistent if and only if a = b = 0. In this case u(t) has the form given in the third item of the theorem.

If |a| > |b|, then A is real and the Lyapunov function belongs to the family

u(t) = Ci cosh At + C2 sinh At.

Substitution into (9) and (10) gives us the system for determination of Ci and C2:

(A + b sinh A)Ci - (a - b cosh A)C2 =0, (12)

(a + b cosh A)Ci - (A - b sinh A)C2 =0, (13)

(a + b cosh A)Ci + b sinh AC2 = -1. (14)

When a + b cosh A = 0,

A - b sinh A

Gi = —-

A(a + b cosh A)

These satisfy (12) and give the expression for u(t) of the first item of the theorem. The equality a + b cosh A = 0 implies a = -b cosh A. Hence,

A = \Ja2 - 52 = ^(cosh2 A - 1) = |5sinhA|.

If b sinh A < 0, the equation (13) is inconsistent with (14). If b sinh A > 0 (equivalently, b > 0, because sinh a > 0 for a > 0), then

cosh A

A sinh A

Consider now the case a2 - b2 < 0, i. e. |a| < |b|. Notice that A is real. The general solution of (11) is

u(t) = Ci cos At + C2 sin At.

The fourth theorem item is direct consequence of the first item, as A = iA.

But the fifth theorem item could not be obtained from the second item, because hyperbolic sine is positive function of the positive argument, in contrast to trigonometric sine.

In this case the condition A - b sinh A = 0 which follows immediately from equation (13), is equivalent to i\bsin A| - ibsin A = 0 or bsin A > 0. □

Denote the set of parameters (a, b), for which the Lyapunov function exists, by E.

5. The exponential stability criterion. In [9] some necessary stability conditions have been obtained for the single delay linear systems. Theorem 3. If the system

X(t) = Ax(t) +Bx(t - 1),

where A, B G Rnxn, is exponentially stable, and the matrix B is non-singular, then the following inequalities hold:

U(0) > 0,

U(°) UT(TM > 0 t G [0 1] U(t) U(0) J > 0 T G [0,1],

where U(t) is the Lyapunov delay matrix (see [7]).

The following theorem shows that these necessary conditions become sufficient for the case of scalar equation.

Theorem 4. The equation (1) is exponentially stable if and only if the Lyapunov matrix for (1) is well defined on [0,1], and

u(0) > |u(t)|, T e [0, 1],

which is equivalent to

u(0) > |u(t)|, T e (0,1]. (15)

If the equation (1) is non-exponentially stable, then the Lyapunov matrix is not well defined. P r o o f. It has been shown [7] that

• if (1) is non-exponentially stable, the Lyapunov matrix is not well defined;

• the equation (1) is not exponentially stable, if the Lyapunov matrix is not well defined. Therefore, it remains to show two following statements:

I. If (a, b) e Q, then u(0) > |u(t)| for any t e (0,1].

II. If (a, b) G A = E \ tt, then w(0) < \u(T)\ for some r G (0,1]. Let us prove the first item. Divide Q into a union of four domains:

Qi = {a< -b} n {a + b cosh A = 0} ,

Q2 = {a + b cosh A = 0}n{b > 0} , Q3 = {a = b}n{a < 0} ,

Q4 = ||a| + b < ^ ^a + bcosA < ^ n jA < ^ . 1. The domain Qi corresponds to the first item of theorem 2, and

A b sinh A

u

(0) = -

X(a + b cosh A)

Obviously, if b < 0, then u(0) > 0, because a < 0. Consider now the case b > 0. Notice that A + b sinh A = 0, therefore,

A2 b2 sinh2 A a b cosh A

w(0) = —

A(a + b cosh A)( A + b sinh A) A( A + b sinh A)

This expression is positive for every b > 0. As u(0) > 0, we can raise both sides of (15) to the second power. Consider the expression

(u2 (0) - u2 (t)) A2 (a + b cosh A)2 = (A - b sinh A)2 -— ((A — b sinh A) cosh At + (a + b cosh A) sinh At)2 = = — sinh At (2(A — b sinh A)(a + b cosh A) cosh At + + [(A — b sinh A)2 + (a + b cosh A)2] sinh At) =

= isinhAre-Ar ((A-a-5eA)2 - (A + a + be-xf e2Ar) >

> A sinh Atc-xt ((A — a) — 2beX — (a + A) e2X) . (16)

As a + A = — | a. | + Va2 -b2 < -|a| + |a| = 0, A - a > 0, and -y/(A — a)\a + A| = |6|, the chain of equalities can be continued:

(u2(0) — u2(t)) A2 (a + b cosh A)2 > > A sinh Atc-Xt ((A — a) — 2 sign(b) beX + \a + A| e2X) =

= A sinh Are~Ar (Va - a - sign(5) v/\a + A|eAj > 0.

Non-negativity of the last expression is obvious. Let us prove that the equality to zero is impossible. If b < 0, the inequality is evident. Consider the case b > 0. Let %/A — a — ■sf\a + A|eA = 0. Multiplication by a/A — a result in bex = A — a, while multiplication by

eA + e~A

■sf\a + A| gives be x = —A — a. As cosh A

A — a —A — a a + b cosh A = a -|-----1---— = 0.

But a + b cosh A = 0 in ^i. We arrive at a contradiction. It proves inequality (15) for ^i.

2. As cosh x is a positive and increasable function for x > 0, the inequality (15) holds for n2.

3. For Q3 the inequality is also obvious.

4. Consider

. . b sin A — A

u(0) = ^-

A(a + b cos A)

As b < 0, A < n, and a + b cos A < 0, then u(0) > 0. Hence, we can raise both sides of (15) to the second power. Consider the expression

(u2(0) — u2(t)) A2 (a + b cos A)2 = (A — b sin A)2 —

— ((A — b sin A) cos at +(a + b cos A) sin at)2 ^ > sin2 at ^(A — b sin A)2 — (a + b cos A)2 —

. , 2 ~ / ~ b + a cosA \

- 2(A - 6 sin A) (a + b cos A) cot A J = sin At A---— > 0.

sin AA

The last inequality is not so obvious. Therefore, we should show that b+a cos A < 0. Suppose a cos A ^ -b> 0, then a2 cos2 A ^ A2 + a2 or 0 ^ A2 + a2 sin2 A. We arrive at a contradiction. Prove the item II. The domain A can be divided into a union of domains:

Ai = {a> \b\} n {a + b cosh A = 0} ,

A2 = {a = b}n{b > 0} ,

A3 = { b> |a\ | n | a + b cos À = 0j ,

A4 = { b < -\a\j n ( |A > ^ U { a + b cos À > 0}) ,

As = {\b\ > |a\| n | a + b cos A = 0 j n |b sin À > 0j .

It remains to find a point r G (0,1] for each pair of parameters (a, b) G A, such that u{0) < |m(T)|.

1. Consider the set A1. Using the chain of conclusions (16), we obtain

(u2(0) - u2(1)) A2 (a + b cosh A)2 =

= Asinh Ae-X (-2bex - a (e2X + 1) - A (e2X - 1)) < < A sinh Ae-X (2aeX - a (e2X + 1) - A (e2X - 1)) < < A sinh Ae-X - (eX - 1)2 - A (e2X - < 0.

This implies that u2(0) < u2(1) and u(0) < \u(0)\ < \u(1)\.

2. On A2: u(0) + u( 1) = -i < 0. Hence, u(0) < -u{ 1) < |w(l)|.

3. Let us consider the set A3. Take the point f = \ — where a = arccos (7). This

Ab

point belongs to the interval (0,1), when either A ^ n or a - bcosA > 0. Introduce the function

g+(r ) = (u(0) + u(t ))A(a + b cos A).

The value at the point T is

g+(T) = (u(0) + u(T))A(a + b cos A) = b sin A - A + b sin a -

— asin(A — a) — XcosiX — a) = 5sinA — X + b— —

b

a

2

aA aA A2

— — sin X-\—— cos A--— cos A--— sin A = 0.

b b b b

The derivative of the function at T is

g+ (T) = (au(T) + bu(1 - T))A(a + bcos A) =

= ab sin a - a2 sin(A - a) - aA cos(A - a) + + b2 sin(A - a) - ab sin a - bA cos a = -A(a + b cos A) = 0.

This means that at the point f e (0,1) the function has no extremum, i. e. it changes sign. So, we can find a point r either from the right or from the left of the point r (it depends upon the sign of a + 6 cos A) to get w(0) < |w(r)|.

Consider the case with A < 7r and a — 6 cos A ^ 0. Take the point r = 1:

(u2(0) - w2(1))A2(a + b cos A)2 = b sin A — A ) — (a sin A + A cos A ]

= 2A sin A(A sin A — b — a cos A).

If 0 < A < n and b > |a|, then b + a cos A > 0. Show that A sin A < b + a cos A. Consider the difference

(b + a cos A)2 — (A sin A)2 = = b2 + a2 cos2 A + 2ab cos A — b2 sin2 A + a2 sin2 A = = b2 cos2 A + a2 + 2ab cos A = (a + b cos A)2 > 0.

4. Take now the point r = 1 — —, where a = arccos (—). In A4 this point belongs to

AA b

the interval (0,1). The function

g-(r) = (u(0) — u(t ))A(a + b cos A)

takes the value

g-(f) = (u(0) — u(f))A(a + b cos A) = b sin A — A — b sin a +

+ asin(A — a) + Acos(A — a) = 5sinA — X + b— —

b

a2 A aA A aA A A2 A — — sin A H--cos A--cos A--sin A = 0.

b b b b

The derivative at this point is equal to

g'_ (f) = —(au(f) + bu(1 — f))A(a + b cos A) =

= —ab sin a + a2 sin(A — a) + aA cos(A — a) — — b2 sin(A — a)+ ab sin a + bA cos a = — A(a + b cos A) = 0.

We can find the point r, for which w(0) < |w(r)|, like in the item 3.

5. In the domain A5

w2(0) -m2(1) = - j- < 0.

A2

The theorem is proved. □

Given theorem can be viewed as the generalization of the classical Lyapunov result for the scalar case.

6. Conclusion. A criterion of the exponential stability for the single delay equation is presented. The conditions of the criterion depend on the Lyapunov matrix-function of the

equation. In the future we plan to extend the result for a wider class of linear time-delay systems.

References

1. Krasovskii N. N. On the application of the second method of Lyapunov for equations with time delays // Prikl. Mat. Meh. 1956. Vol. 20. P. 315-327.

2. Repin M. Yu. Quadratic Lyapunov functionals for systems with delay // Prikl. Mat. Meh. 1965. Vol. 29. P. 564-566.

3. Infante E. F., Castelan W. B. A Liapunov functional for a matrix difference-differential equation // J. of Differential Eq. 1978. Vol. 29. P. 439-451.

4. Datko R. An algorithm for computing Liapunov functionals for some diffe-rential-difference equations // Ordinary Differential Equations / ed. by L. Weiss. New York: Academic Press. 1972. P. 387-398.

5. Huang W. Generalization of Liapunov's theorem in a linear delay system // J. of Mathematical Analysis and Applications. 1989. Vol. 142. P. 83-94.

6. Kharitonov V. L., Zhabko A. P. Lyapunov-Krasovskii approach for robust stability of time delay systems // Automatica. 2003. Vol. 39. P. 15-20.

7. Kharitonov V. L., Plischke E. Lyapunov matrices for time-delay systems // Syst. & Contr. Lett. 2006. Vol. 55. P. 697-706.

8. Jarlebring E., Vanbiervliet J., Michiels W. Characterizing and computing the H2 norm of time-delay systems by solving the delay Lyapunov equation // IEEE Trans. on Autom.Contr. 2011. Vol. 56(4). P. 814-825.

9. Mondie S., Egorov A. Some necessary conditions for the exponential stability of one delay systems // 8th Intern. Conference on Electrical Engineering, Computing Science and Automatic Control. Merida, Mexico, 2011. P. 103-108.

10. Mondie S. Assessing the exact stability region of the single-delay scalar equation via its Lyapunov function // IMA J. of Math. Contr. and Inf. 2012. URL: http://imamci.oxfordjournals.org.

11. Bellman R., Cooke K. Differential difference equations. New York: Academic Press, 1963. 465 p.

12. Hayes N. D. Roots of the transcendental equation associated with a certain difference-differential equation // J. London Mathem. Society. 1950. P. 226-232.

Статья рекомендована к печати проф. В. Л. Харитоновым Статья принята к печати 25 октября 2012 г.