1. Introduction
Since the time of A.M. Lyapunov, the problem of stability of solutions remains one of the most important problems in the study of any dynamical systems. In this respect, delay differential equations are no exception. The basic concepts and definitions of the classical stability theory for ordinary differential equations (ODEs) were actually transferred without changes to functional differential equations (FDEs), for which ODEs are the most studied special case. The study of stability of FDEs initially followed the schemes developed for ODEs. Analogues of the Lyapunov function method were found, the place of characteristic polynomials was taken by quasipolynomials, and generalizations of theorems on differential inequalities appeared. However, the direct transfer of known approaches to FDEs, first, was never a simple task, and always led to the appearance of additional restrictions, and second, it was rarely possible to achieve such beautiful exactness that could be achieved when working with ODEs. Thus, the new object required new ideas and methods that would take into account the features of equations with deviating argument.
Consider the known methods for studying the stability of FDEs. There are general methods which can be successfully applied to a very wide class of equations. Apparently, the most famous of them is the method of Lyapunov–Krasovsky functionals, the foundations of which were laid in monograph [
1]. Over several decades of development of this method, many new ideas have been proposed (see [
2,
3]). Nowadays, the method continues to be applied to different classes of equations, and these classes are expanded (see, for example, works [
4,
5,
6,
7,
8]). Another well-known method is the Razumikhin function method, the foundations of which are outlined in [
9,
10,
11]. Although this method is not so widely used today, new modifications periodically appear, including its use in combination with the Lyapunov–Krasovsky method [
12,
13]. We should also note the younger Azbelev
W-method, the foundations of which were developed in the 1980s–1990s [
14,
15,
16,
17,
18,
19], and which continues to be actively developed in the works of a number of researchers today [
20,
21].
However, these methods are “semi-effective”: the stability conditions obtained on their basis depend on some auxiliary function, functional, or model equation, the good choice of which requires a special skill. Thus, the listed methods cannot guarantee the exactness of the obtained stability conditions.
On the other hand, there are methods that make it possible to obtain necessary and sufficient conditions for stability: for example, the study of an autonomous FDE can be replaced by the study of zeros of its characteristic function (as shown in the classic works [
22,
23,
24,
25,
26]), and the study of FDEs with periodic parameters can be reduced to the problem of the spectrum of the monodromy operator (ideas from classic works [
27,
28,
29] continue to be developed in the 21st century [
30,
31]). These methods provide exact stability tests; however, they are applicable to a relatively narrow classes of equations.
Thus, the choice of a research method is always the choice between generality and exactness; there are no methods that provide both at the same time. However, in this work, we try to combine some advantages of the both approaches: on the one hand, to cover a sufficiently wide class of equations, and on the other, to achieve the exactness of stability conditions comparable to that of stability tests for autonomous and periodic equations. Our approach may be corresponded to the so-called “Lyapunov’s first method”, that is estimating the growth or decay exponent of solutions, but within the framework of this formulation of the question, we propose a specific algorithm for obtaining the required estimates. To do this, we identify the “worst-behavior equation” in the class of equations under study. This idea in itself is not new: Myshkis used it in an implicit form when, using their examples, he showed the sharpness of the famous constant in the stability conditions he found. However, we are apparently the first to systematically develop this idea as applied to certain classes of equations.
Since we set the goal to obtain exact stability criteria for FDEs with parameters of a general form (in the study of which the construction of effective necessary and sufficient conditions is apparently impossible), we come to the question of giving a clear meaning to the very concept of exactness. In the absence of a definition, this concept can be interpreted too broadly; as experience shows, for almost any stability test one can find grounds to claim its “exactness”, or “sharpness”.
We consider, instead of an individual equations, families of equations defined by a certain finite set of numerical parameters. We will call sufficient stability conditions of an equation exact, if they provide a stability criterion for some prescribed family of equations. If exact conditions are satisfied, then all equations of the family are stable; if they are broken, then there is a representative of the family that is not stable. At first glance, checking the conditions not for one, but for many equations seems to be a much more difficult task, but it is possible that among the equations of the family, there are a small number of test equations, the stability of which guarantees the stability of the entire family.
Thus, in this work we present the method for studying the stability of FDEs, the test method, based on the approach described above. For specific classes of FDEs, we indicate a set of parameters characterizing the family, and for this family we construct a test equation by studying the asymptotic properties, from which we obtain information about the stability of the entire family. The test equation has a quite simple structure and can be studied analytically; checking the stability of the test equation is also possible using computer methods. For some families of delay differential equations with small number of parameters, we construct the stability region in the parameter space.
The test method made it possible to find a simple proof of the famous Myshkis “-theorem”. The example constructed by Myshkis to show the unimprovability of the constant turns out to be nothing else but a (brilliantly guessed) test equation! This example suggested the form of test equations for FDEs with arbitrary number of concentrated and distributed delays. Of course, as the original equation becomes more complex, the construction of the test equation becomes more complicated, and its study turns into a separate task. Solving it may not be easy, but the result is justified: the obtained stability test, if interpreted as a definition of a set in the parameter space, gives the region of stability with the boundary sharp in each point.
The paper is organized as follows. In
Section 2, we formulate the problem. In
Section 3, we define the main object of our study, a
semi-autonomous equation, and obtain general results that justify our research method. On the basis of these results, combined in the form of several theorems in
Section 3.4, we obtain, in
Section 4, a number of new stability tests expressed in terms of parameters of a given equation, for several classes of linear delay differential equation with a small number of parameters; these tests are exact in some precisely defined sense.
4. Effective Stability Tests
In this section, on the basis of the results of
Section 2, we obtain effective stability conditions for several classes of equations described by a small number of parameters.
Section 4.1 is dedicated to the case
,
, in which family (
1) turns into a family of equations having a one-dimensional stability region. Next, we study in detail the cases when the stability regions of family (
1) are two- and three-dimensional.
The boundaries of the regions are represented as a union of a finite or countable set of curves or surfaces defined analytically. Stability regions are constructed in coordinate systems defined by parameters of equations.
4.1. One Term, One Delay
Set
and
in Equation (
1), and denote
. Thus, we consider a family of equations of the form
where
,
is nondecreasing,
,
is locally integrable.
If
, then family (
31) is unstable, since the equation
, which is a special case of (
31), is unstable.
In case
, we have
, hence family (
31) is uniformly (but not asymptotically) stable.
Investigate the case on the basis of Theorem 10.
On the segment
, the solution of the test problem of family (
31)
has the form
Suppose l, which is the point of the first minimum of the function y, is on the segment ; then and .
If
, then
. By Theorem 10, family (
31) is exponentially stable.
If
, then
and
. By Theorem 10, family (
31) is uniformly stable, but is not asymptotically stable.
If
, then
and
. By Theorem 10, family (
31) is not uniformly stable.
Suppose now that
. Then,
, and by Theorem 10, family (
31) is exponentially stable.
Combining the results in a single statement, we obtain the following theorem.
Theorem 13. Exponentially stable, if and only if ;
Uniformly stable, if and only if .
Consider a special case of family (
31) that is the family of equations with one concentrated delay
where
and
. Since the equation in test problem (
33) is a special case of Equation (
34), where
it follows that Theorem 13 remains valid if family (
31) is replaced by family (
34); thus, it presents a generalization of the famous “
-theorem” by Myshkis [
41]. Note that Theorem 13 was also obtained by a different method in [
42].
4.2. Properties of the Solution to the Simplest Initial Value Problem
In this section, we obtain a number of results that is used later to describe stability regions of some equations explicitly.
Denote the solution to problem (
35), with coefficient
p, by
.
The equation in problem (
35) belongs to the class of equations whose solution can be obtained explicitly by integrating “step by step”, sequentially on the intervals
,
, …,
, …
Proposition 1 ([
43]).
The solution to problem (35) is determined by the formulawhere χ is the characteristic function of the set . Solutions of scalar FDEs, unlike ODEs, do not necessarily preserve sign on
. The existence of zeros of solutions to Equation (
35) is determined by the value of
p.
Proposition 2 ([
41] (Th. 39, p. 190) and [
44]).
If , then the function is positive on ; if , then it is oscillating (that is it has an unbounded on the right sequence of zeros). Consider the case . Denote the smallest of zeros of the function by .
Lemma 14. If for all and , then for all .
Proof. By virtue of the Cauchy formula, Equation (
35) with the coefficient
q is equivalent to the equation
It follows from the conditions of the lemma that for all .
Suppose
for all
, where
n is a natural number such that
. Then, it follows from (
36) that
for all
.
It remains to note that for . □
Lemma 15. If for all and , then for all .
Proof (Proof). It follows from (
36) and Lemma 14. □
Lemma 16. Suppose the functions and have zeros on . Then, the inequality holds if and only if .
Proof. Assume that
and
. Then, for
, the inequalities
and
are true. From Equality (
36) we obtain:
that is, we have arrived at a contradiction.
Conversely, assume that and . Then, if , then ; if , then, by what was proved above, , that is again we have arrived at a contradiction. □
Lemma 17. Suppose , the functions and have zeros on , and . Then, the function also has zeros on , and .
Proof. Suppose that for all . Then, . Since , then by Lemma 15, we have , and we arrive at a contradiction. The second statement of the lemma follows from Lemma 16. □
Lemma 18. Suppose the function has zeros on , and . Then, there exists a unique such that .
Proof. Divide the proof of the existence of the number q into two stages.
1. Assume that
. Denote
and consider the function
on the interval
. Obviously,
. Let us show that
. To do this, consider the function
on the interval
. Since
for
, and
, then
is decreasing monotonically on
. But
, therefore
. It follows from Proposition 1 that the function
is continuous on the set
. Using this, find
for which
. Make sure that
. Indeed, if
, then by Rolle’s theorem, there is a point
such that
, and then it follows from Equation (
35) that
. But
, and this contradicts the definition of
.
2. Assume that
, where
. First, set
and find, taking into account the statement proved at the first stage, a number
such that
. Further, set
and find, by the same statement, a number
such that
. Repeating this procedure
n times, we reach the set
to which it remains to apply once again the statement proved at the first stage and find
such that
.
The uniqueness of q follows from Lemma 16. □
We see from Proposition 1 that for each fixed
, the quantity
as a function of the argument
p defined on the set
is a polynomial of
nth degree in the variable
:
Denote . Note that .
The following statements associates roots of the polynomials with roots of the functions .
Theorem 14. For any :
The polynomial has at least one positive real root;
If p is the smallest positive root of the polynomial , then .
Proof. It is obvious that all polynomials of odd degrees have at least one root on . Let denote the smallest root of a polynomial . Assume that . Then, by Lemma 18 there is such that , i.e., , contrary to the definition of . The statement is proven for polynomials of odd degrees.
Now consider a polynomial . Since , by Lemma 18 there is such that , which implies, by virtue of , that the polynomial has roots on . Let be its smallest root. If , then from Lemma 18, we obtain , therefore, . But then , which leads to a contradiction. Therefore, , that is the statement is also true for polynomials of even degrees. □
Denote by the smallest positive root of the polynomial and establish some properties of the sequence .
The numbers
can be found with any degree of accuracy;
Table 1 shows the first 12 of them (accurate to
).
Theorem 15. The sequence decreases monotonically; .
Proof. By Theorem 14 we have , . Since , it follows that , and then by Lemma 18. Moreover, the sequence is bounded below. Indeed, the polynomials do not have zeros for , hence .
From the above, it follows that the sequence converges to a limit, which is its infimum. Next, prove that .
Assume that
for some
. Obviously, the first zero of the polynomial
is
. Thus,
; therefore, by virtue of Lemma 17 and Theorem 14, the solution to problem (
35) for
has a root on the interval
, which contradicts Proposition 2. Therefore, for any
, the estimate
is valid; that is,
.
Assume now that
. By virtue of Proposition 2, the solution to problem (
35) for
has an infinite number of zeros on
. If
, then by Lemma 18 and Theorem 14, we obtain
, which is not true. Therefore,
. □
Let us combine results obtained above in a single statement.
Theorem 16. Suppose is the solution to problem (35) with coefficient p, and is the first zero of the function . Then: If , then for all ;
If , then for all ;
If , then ;
If , then for all .
Now, we describe for p belonging sequentially to the intervals , , setting .
Let us start with the first, semi-infinite, interval: suppose
. Since
, then
. By virtue of (
35), for
we have
, therefore,
.
Consider the second interval: suppose
. The number
can also be found exactly as the smaller root of the equation
We have
. From Theorem 16, it follows that
,
whence
.
For intervals with , there is no point in representing numbers through radicals: it is more convenient to use numerical methods to determine the boundaries of intervals with any degree of accuracy. An explicit analytical representation of as a function of p also becomes impossible, so we replace it with an implicit one.
Lemma 19. For any , the equalitydefines on the set a unique, continuous, monotonically decreasing function mapping the segment onto the segment . Proof. Suppose that for a given , there exist for which . Then, by Rolle’s theorem, there is a point at which , and therefore . But , which contradicts Theorem 16. Consequently, on the interval , the equation has a unique root, and it is equal to . Thus, . The remaining statements of the lemma follow from Lemma 17 and Theorem 14. □
From Theorem 16 and Lemma 19, we obtain the following statement.
Theorem 17. The function is a continuous monotonically decreasing mapping of the set onto the set .
Figure 1 shows the graph of the function
.
4.3. Two Terms, One Delay
Set in Equation (
1)
, denote
and consider a family of equations of the form
where
and the operator
T is determined by formula (
32). The most common case of Equation (
38) is the equation with concentrated delay
where
,
.
In this subsection, we obtain a complete description of the stability region of family (
38) for each
and
.
4.3.1. The Test Problem and its Properties
We start with the case .
The test problem for the family (
38) is the problem
As above, denote the solution of problem (
40) by
, and the first minimum of the function
y by
l.
Make a change of variables in (
40), which is similar to the change (
12) used in the proof of Lemma 3 and makes delay equal to 1:
Substituting (
41) into (
40), we see that
z is the solution to problem (
35), where
. Since
the problem of finding
l is equivalent to that of determining the first zero of the solution
of problem (
35) for a given
p. Obviously,
.
To find the stability region of family (
38), use Theorem 9. First, construct the surface
F.
According to formula (
13), the parametric equation of the surface
F for family (
38) has the form
Eliminating the parameter
and passing to the coordinates
,
, we obtain that
F is the curve
. Now the concepts
above and
below used in Theorem 9 are geometrically obvious for
F.
Express the curve
in terms of parameters of family (
38). Consider the sequence
of roots of the polynomials
. From Theorem 16 and formula (
42), taking account of Lemma 3, we obtain the following result.
Theorem 18. Let y be the solution to problem (40), and l, the point of its first minimum. Then: If , then the function is positive and monotonically decreases for all ;
If , then y has the first minimum at the point for all ;
If , then ;
If , then for all .
Let us give a graphical interpretation of Theorem 18. Divide the region lying above
F with curves
to an infinite number of areas. It follows from Theorem 15 that the sequence of curves converges to the curve
, which is
F.
In
Figure 2, on the left, the curves
,
, are indicated by dashed lines, and the “limit” curve
by the solid thin line. When moving from one region to another, the curve
change the form; therefore, it also consists of a countable set of links.
Let us describe the curve
sequentially in each of the regions shown in
Figure 2 on the left.
Lemma 20. Suppose . Then, for , the following equality holds: Proof. Transforming the right-hand side of the equality (
41), with regard to Equation (
35), we obtain
therefore, for
we have
It is easy to see that for
, the solution to Equation (
40) has the form
applying Formula (
44)
n times, we obtain that for
If
, then, setting
in the last equality and taking into account that
, we obtain the required formula (
43). □
Construct the curve
in the case that
. We have
, and from (
43), for
, we obtain the boundary equation
Equation (
40) for
was considered in
Section 4.1, where it was shown that
.
Use the coordinate system
. Define the function
in the domain
. By direct calculation, we can establish that
therefore,
is continuous in the considered domain. Further, it is easy to verify that for
the equality
defines a unique, continuous and monotonically decreasing function
.
Consider the remaining part of the plane
. For each
, define the function
in the domain
. Recall that here
is the fundamental solution to problem (
35) for
, and the properties of the sequence
and the functions
are defined by Theorems 15–17.
By Lemma 19, equality (
37) for each
uniquely defines the function
on
, from which it follows that the equation
defines for
a single-valued, continuous, and monotonically decreasing function
. Moreover, the curves
and
have a common point lying on the curve
; denote this point
. Since the functions
are monotonically decreasing, then the sequence
increases monotonically and the sequence
decreases as
n increases. Further, since the points
belong to the region of the uniform stability of Equation (
40), it follows from Theorem 9 that
. On the other hand, for
, we have
. This means that both the sequences
and
of coordinates converge; therefore, the sequence
also converges. Let us find its limit.
Theorem 19. The sequence of points converges to the point with respect to the norm of the space .
Proof. Denote the coordinates of the limit point by . Since by Theorem 15, , then the sequence of curves converges to the curve ; therefore, point lies on this curve.
Correspond the points
and
in the following test equations:
where
and
where
Denote by
and
the solutions to Equations (
45) and (
46), respectively, with initial values
. As noted above,
, which means
.
Suppose that
. Then, it follows from Lemma 10 that Equation (
46) is exponentially stable and its Cauchy function
satisfies the estimate
It follows from properties of the solution to the test equation and the choice of points
that
for all
and
. Using the fact that
and
, we choose
such that
and consider Equation (
45) for
on the interval
. By virtue of the Cauchy formula (
3), the function
is a solution to the following integral equation
It follows from properties of the solution to the test equation and the definition of the points
that
for all
. By virtue of the choice of
m and
, we obtain
But by Lemma 10,
, and by the choice of point
, we have
. The resulting contradiction means that
, and since
, it follows that
. □
For
, the equation
defines a single-valued monotonically decreasing function, the graph of which lies entirely above
F. This graph has an asymptote
as
(see
Figure 2, on the right). At points
, the links of the curve are continuously joined, and
, which means that the required curve is defined at the point
by continuity. For
, it is not determined.
4.3.2. Stability Tests
First, prove a simple stability test, which is valid for all delays .
Lemma 21. Suppose that and . Then, Equation (38) is exponentially stable for all . Proof. Consider Equation (
38) with the initial condition
and a right-hand side
. Using the Cauchy formula (
3) for the ODE, rewrite the equation in the equivalent form
where
Since
, we have
, the operator
K acts from
to
, and
Therefore, with regard to the conditions of the lemma,
, hence the operator
is boundedly invertible, and the solution to Equation (
38) belongs to
. To complete the proof, it remains to refer to the Bohl–Perron theorem [
19] (Theorem 3.3.1). □
Theorem 20. Family (38) is exponentially stable if and only if , and . Proof. Suppose . Applying Theorem 9, compose the stability region of two parts. If , then the point does not lie above the surface F. From the conditions of the theorem, it follows that the conditions and are satisfied for the point . Hence, by virtue of item of Theorem 9, the point belongs to the region of exponential stability. If , then the point lies above F, and, by virtue of item of Theorem 9, the criterion of exponential stability is the condition , which is equivalent to the condition .
Suppose now
. Lemma 21 implies that if the point
belongs to the interior of the angle
, then it belongs to the region of the exponential stability of family (
38). However, if
, then there is a representative of family (
38),
, that is not uniformly exponentially stable. □
Thus, the region of the exponential stability of family (
38) is the interior of the infinite “angle”, whose boundaries are the straight line
and the curve
(see
Figure 2).
To prove the criterion for the uniform stability of family (
38), we prove one more auxiliary statement.
Lemma 22. For the Cauchy function of the equationwhere the function is nondecreasing, , the function is measurable and , for all , the estimate is valid. Proof. The positiveness of the Cauchy function follows from Lemma 3. Prove the required estimate. Denote by
the set of
such that
for all
. Since
, the set
is not empty for all
and
. If for all
and
, we have
, then the estimate
is valid. Assume that there exists
and
such that
. Set
. For all
, we have
. Choose
such that
, and find
It is obvious that
. Since the function
x is absolutely continuous, there is a point
such that
On the other hand, the Cauchy function of Equation (
47) is a solution to a homogeneous equation; therefore, it follows from the choice of the points
and
that
Contradiction. □
Corollary 2. If , then family (38) is uniformly stable for all . Proof. If
, then Equation (
38) is reduced to Equation (
47) by the change of variables
. By virtue of Lemma 22, this proves the uniform stability of family (
38). If
, the uniform stability is obvious. □
Theorem 21. Family (38) is uniformly stable if and only if , and . Proof. Suppose . If , then, by item of Theorem 9, the criterion for uniform stability is that and hold, which is true according to the conditions of the theorem. If , then by virtue of item of Theorem 9, the criterion for uniform stability is the condition , which is equivalent to .
Suppose now
. If
, then uniform stability follows from Theorem 20. If
, then the family is not uniformly stable, since there is a representative of the family (
38),
, that is not uniformly stable. It remains to consider the case
. If
, then Equation (
38) is reduced to Equation (
47) by the change of variables
. This, by Lemma 22, proves the uniform stability of family (
38). If
, uniform stability is obvious. □
In
Figure 2, the stability region of family (
38) is shaded on the right. The region of exponential stability is the interior of the infinite curvilinear angle bounded by the straight line
and the curve
, the region of uniform stability is the closure of this angle excluding the point
.
For family (
39), Theorems 20 and 21 are valid, as well as all their corollaries, since Equation (
39) is a special case of Equation (
38), and, on the other hand, the test Equation (
40) is a special case of Equation (
39).
As stated above, the boundary of the stability region of family (
38), which is defined by the function
, consists of an infinite number of links; however, for
, it is given by the single equality
, and this makes it possible to set the boundaries of the stability region in a more convenient form.
Introduce the function
as follows,
Corollary 3. Suppose , . Then:
Family (38) is exponentially stable if and only if ; Family (38) is uniformly stable if and only if .
Proof. When the replacement
,
is made in the inequality
, it becomes equivalent to the inequality
. Suppose
. Then, since
for all
, the required inequality is satisfied automatically. Suppose
. Then, the required inequality is equivalent to
from which the first statement of the corollary follows. The reasoning is similar for the case of nonstrict inequality. □
Figure 3 shows the graph of the function
. The stability region is shaded: for family (
38) to be stable in the case that
and
, it is necessary and sufficient that the point with coordinates
belongs to this region.
Below, we present some other convenient sufficient criteria for the stability of family (
38), which are easy to obtain using the form of the stability domain.
Corollary 4. If and , then family (38) is exponentially stable. One may find the abscissa of the point from the equation . Numerical methods give .
Corollary 5. If , and , then family (38) is exponentially stable. Corollary 6. If , and , then family (38) is uniformly stable. The above obtained results can be compared with the best known results on stability regions for Equation (
38).
In paper [
45], for the equation
in the case
,
, and
, the following stability conditions were obtained.
Suppose
is a domain on the plane
for
,
, bounded by the line
and the curve
, consisting of two links:
In
Figure 4, on the left, the curve
is shown in red. The boundaries of the domain
are not included in it.
Proposition 3 ([
45]).
Equation (48) is exponentially stable if . This result was refined in paper [
46], where the boundary of the region
was replaced by the more exact boundary
, also consisting of two links:
In
Figure 4, on the left, the curve
is shown in blue. Together with the line
, it bounds the set
; in [
46], it was proven that for
, Equation (
48) is uniformly stable.
In
Figure 4, on the left, the boundary of the stability region of Equation (
48), which is given by Theorems 20 and 21 is shown in black; it is obvious that the sets
and
are included in it.
In [
46], Equation (
48) was considered for
,
, and the following proposition was given.
Proposition 4. Let , . If the point lies either not above the line , or not above the curvethen Equation (48) is uniformly stable. If lies below the curve (49), then Equation (48) is asymptotically stable. The exponential stability of Equation (
48) in the case
is obvious, therefore we apply Proposition 4 to the case
. Then, equality (
49) should be considered for
; it can be simplified and takes the form
In
Figure 4 on the right, this curve is shown in red, the exact stability boundary of family (
48) is indicated in black, and the line
is indicated by the dashed line. It is clear from
Figure 4 that the red line goes above the black one, therefore, it does not belong to the stability region of Equation (
48). Therefore, Proposition 4 is false.
In paper [
47], the stability of nonlinear delay equations was studied; the linear case of equations have the form
where
,
,
.
By a known change of variables [
48], Equation (
50) is reduced to the form (
48). The result of paper [
47] takes the following form.
Proposition 5. Equation (50) is asymptotically stable, if ,
,
, .
For
, the boundary
coincides with the boundary of the domain
D; for
, the curve
consists of two links and is defined implicitly by the following equations:
where
. The curve
goes below the boundary of the domain
D (in
Figure 4 on the right, it is shown in green).
Theorems 20 and 21 cover a wider class of equations: the delay in (
38) can be variable and distributed, the stability region is wider, and the estimate of the Cauchy function provides more information than about asymptotic stability. The advantage of the result of [
47] is that it is applicable to nonlinear equations whose coefficients satisfy the conditions of the Yorke type [
49].
4.4. Two and Three Delays
Consider the family of equations with three delays
where
and the integrable functions
,
,
are subjected to the inequalities
construct a stability region for this family in the three-dimensional coefficient space
.
It follows from Theorem 13 that the stability region of family (
51) is situated in the first octant not above the plane
.
The test problem (
5) for family (
51) has the form
Let us find the point
of the first zero of problem (
52). In the considered example, we have
, therefore, by virtue of Theorem 10, we are interested only in the case
.
Construct the solution of problem (
52) in the segment
:
- :
, ;
- :
, ;
- :
, ;
- :
, ;
- :
,
;
- :
,
;
- :
,
.
Since , the solution does not have zeros on ; hence, .
Construct four surfaces – that determine intervals contained in , to which l can belong.
- The surface
is defined by the equation
, which is
- The surface
is defined by the equation
, which is
- The surface
is defined by the equation
, which is
- The surface
is defined by the equation
, which is
The surfaces
–
are represented in
Figure 5.
The points
that are not above
correspond to those coefficients of Equation (
52), for which
; the points
between
and
(including
) correspond to the case
; the points between
and
(including
), to the case
; the points between
and
(including
), to the case
; and the points below
correspond to the situation
and, by Theorem 10, belong to the stability region.
Thus, we should construct the boundaries of the stability region in the four domains bounded by the surfaces
–
. Denote these boundaries by
,
,
,
. All of them are defined by the two equalities
their specific form depends on intervals to which
l belongs.
Denote . Obviously, for all , the function is expressed through .
Let
. Then, the first of equalities (
53) has the form
Since
the second equality in (
53) is written in the form
Denote
. We see that the surface
is defined by the equation
Let
. Arguing similarly, we obtain the surface
:
Let
. Obtain the equation of the surface
:
Finally, for
we obtain the equation of the surface
:
The surfaces
–
, forming the boundary of the stability region of family (
51), are represented in
Figure 6. The points placed in the first octant not above the boundary compose the region of uniform stability. By excluding the surfaces
–
and the point
from it, we obtain the region of exponential stability.
In
Figure 7,
Figure 8 and
Figure 9, the sections of the stability region by the planes
,
and
are represented, which are the stability regions for the three families of equations with two delays. The stability of the family
where
and
, and the form of its stability region, are studied in detail in paper [
50].
5. Discussion
The method presented in the article for studying the stability of solutions to FDEs, in contrast to the known ones, makes it possible to obtain exact stability criteria for a given family of equations. Such exactness was previously achieved only in classical Myshkis stability conditions and their refinements. The method is based on the construction and study of a test equation, which is the “worst-behavior” equation of a given family.
The applications of the method give effectively verifiable necessary and sufficient conditions for uniform and exponential stability of families of linear semi-autonomous delay differential equations. For equations specified by a small number of parameters, exact and effectively verifiable stability criteria are obtained, presented in analytical and geometric form. The new approach made it possible
To obtain a simple proof of the Myshkis theorem on
, as well as to clarify it and generalize it to a wider class of Equations (
31);
To find the stability region with the sharp boundary for equations of the form (
38); thereby to improve the best known stability regions found in works [
47,
51,
52,
53] (see
Section 4.3.2);
To construct the sharp three-dimensional stability region for Equation (
51) with three non-zero delays; similar results have not yet been obtained in the literature.
Theorem 9 can be viewed as an algorithm suitable for computer implementation. It becomes especially simple when all the coefficients of Equation (
51) have the same sign. In this case, as follows from Theorem 10, it is enough to construct the solution to the test equation on the segment,
, where
is the largest delay. If the solution graph does not take values less than
on this segment, then family (
51) is uniformly stable; if the graph does not reach the value
, then family (
51) is exponentially stable.
The test method allows to find the exact boundary of the stability region for Equation (
1) with the coefficient
a of arbitrary sign. The most difficult case to study is
: since the ODE
is unstable, stability can be achieved due to the delay term. The obtained result complements works that study FDEs with coefficients of different signs [
45,
54,
55], and makes it possible to effectively calculate the exponent in the estimate (
20) [
56,
57].
The authors admit that the idea of the test method can be implemented for equations of neutral type: one can try to construct an equation of the worst behavior, without inverting the operator at the derivative, using the methods of differential inequalities.
There is also an interesting and difficult problem to find a multidimensional analogue of the test equation for FDE systems. For a semi-autonomous system , where the matrix A has a real spectrum, the result is obvious. Fundamental difficulties arise if A has complex eigenvalues.