At present there are no effective algorithms of computing the eigenvalues of linear systems with delays
in order to check its stability.In this section we discuss some methods for practical verification of stability of system (12.1) using computer simulation.
The fundamental matrix
is the solution of the matrix delay differential equation
under the condition
One can fomulate the following
stability criteria in terms of
fundamental matrix (12.2).
Theorem 12.1. System (12.1) is
The fundamental matrix can be found numerically
using fundmatr (as the solution of system
(12.3), (12.4)).
Remark 12.1. Thus, one can easily check stability (or instability)
of system (12.1) solving numerically system
(12.3), (12.4) and verifying
the corresponding properties (12.5) or
(12.6)
of the matrix F[t].
Note, if at least one of the coefficients of
the matrix F[t] is not uniformly bounded
then system (12.1) is unstable.
First of all it is necessary to note that, as it was emphasized by many authors, complete correct statement of a stability problem for a concrete system with delays should include description of a class of admissible initial functions (initial disturbances).
In this case it is sufficient to consider stability of
solution of specific time-delay system only with respect to
admissible initial disturbances.
Remark 12.2. In [32] one can find an example of time-delay
system which is unstable with respect to the class of all
continuous disturbances, but is stable with respect to more
narrow class of admissible initial functions.
Of course, classes of admissible initial disturbances
are different in different problems, so in general stability
theory usually the class of all continuous or
piece-wise continuous initial functions (disturbances)
is considered.
Nevertheless, in some problems such class of initial
functions can be superfluous.
Let be a subset (a system of functions)
of the space H.
Definition 12.1. System (12.1) is
stable with respect to a class of functions
if for any
h the corresponding
solution is bounded.
Definition 12.2. System (12.1) is asymptotically stable with respect to a class of functions if
for any h .Note, from linearity of system (12.1) it follows that if the system is (asymptotically) stable with respect to a class then the system will be also (asymptotically) stable with respect to the space L* = span{} spanned on , and, moreover, the system will be (asymptotically) stable with respect to the class
As we already mentioned, in many cases it is difficult
to prove stability of a system with respect to the class
all continuous initial functions.
In this case one can check stability of the system
with respect to a class of test initial functions
by computer simulation.
The corresponding class of functions can be chosen, for example, in the following way.
It is well known, that there exist orthogonal systems of continuous on the interval [- , 0] functions {( . )}i = 0 such that every function ( . ) C[- , 0] can be expanded in series 6
with some coefficients {}i = 0 .One can consider first k functions
as basic (test) functions, and investigate stability of system (12.1) with respect to this finite class of functions. In this case the system will be stable with respect to subspace of functions, which are linear combinations of "basic" functions (12.9).
From the linearity of system (12.1) it follows
that if for every basic function ,...,
the corresponding solution
x(t,) tends to zero
as
t, then for arbitrary constants
,..., the solution x(t,),
corresponding to an initial function (12.11), also
tends to zero.
So, it is sufficient to check convergence to zero only for
functions ,...,.
Definition 12.3. System (12.1) is asymptotic stable with respect to a class of functions (12.9) if
i = 1,..., k.Also it is necessary to note, though the series (12.8) contains infinite number of terms, nevertheless taking into account presence of some uncertainties at every specific (applied) problem one can consider a class of admissible initial disturbances as a finite sum
,..., , assuming that remainder part ( . ) of the series (12.8) corresponds to uncertainties.
Depending on concrete problem one can choose his own system
of (linear independent) test functions.
At present there are no effective criteria of positiveness for general quadratic functionals.
In this subsection we describe an approximate method of verifying positiveness of a quadratic functional
here is a constant n×n matrix, is n×n matrix with piece-wise continuous elements on [- , 0], is n×n matrix with piece-wise continuous elements on [- , 0]×[- , 0].Let us consider a finite number of elements
and their linear combinations ,..., .If we substitute (12.14) into quadratic functional (12.12) we obtain the quadratic function of variables ,...,
Definition 12.4.
Functional (12.12) is called positive definite with
respect to a class of functions (12.13) if the quadratic
function
(,...,) is positive
definite with respect to
,...,.
Representation (12.15) can be used for approximate
verification of positiveness of quadratic functionals.