- Research
- Open access
- Published:
Exponential stability of perturbed linear discrete systems
Advances in Difference Equations volume 2016, Article number: 2 (2016)
Abstract
The paper considers the problem of exponential stability and convergence rate to solutions of perturbed linear discrete homogeneous systems. New criteria on exponential stability are derived by using the second method of Lyapunov. We consider non-delayed systems as well as systems with a single delay. Simultaneously, explicit exponential estimates of the solutions are derived. The results are illustrated by examples.
1 Introduction
The dynamics of discontinuous transition states of dynamic systems is most naturally described by difference equations and investigating the properties of difference equations is a very important area of research (we mention at least the monographs [1–6]). If processes are modeled by systems of equations, in general, some of the model parameters may be uncertain and we have to deal with systems with inaccurately specified parameters.
In the paper, we consider the exponential stability of systems of perturbed linear homogeneous difference equations and give explicit exponential estimates of solutions. In such systems, it is usually appropriate to describe the inaccurately specified parameters as perturbations of some initial systems. Investigated are non-delayed homogeneous systems of difference equations and homogeneous systems of difference equations with a single delay.
Let \({\mathcal{A}}\) be a symmetric positive definite matrix. Denote by \(\lambda_{\mathrm{max}} ( {\mathcal{A}} )\), \(\lambda _{\mathrm{min}} ({\mathcal{A}} )\) its maximum and minimum eigenvalues and let
Throughout the paper, for an arbitrary matrix \({\mathcal{B}}\), we use the matrix norm
This norm reduces to the Euclidean norm
if \({\mathcal{B}}=x=(x_{1},\ldots,x_{n})^{T}\).
Now we describe the problems solved in the paper and the methods frequently used to investigate stability.
1.1 Non-delayed systems
The simplest class of systems of difference equations is that of linear autonomous systems
where \(A=(a_{ij})_{i,j=1}^{n}\) is a real constant matrix and x is an n-dimensional unknown vector. In the paper, we consider systems
where the norm \(|B(k)|\) of the real matrix \(B(k)=(b_{ij}(k))_{i,j=1}^{n}\) is small in a certain sense specified below. System (2) can be viewed as a perturbation of system (1). Recall that the solution of (1) or (2) is uniquely determined by the given initial value \(x(0)\).
Definition 1
The zero solution \(x ( k )=0\), \(k=0,1,\ldots\) of (2) is called (Lyapunov) stable if, for an arbitrary \(\varepsilon>0\), there exists a \(\delta ( \varepsilon )>0\) such that, for any solution \(x^{*} ( k )\) of system (2), we have \(\vert {x^{*} ( k )} \vert <\varepsilon\) for \(k=0,1,\ldots\) , provided that \(\vert {x^{*} ( 0 )} \vert <\delta ( \varepsilon )\). If, moreover,
the zero solution is called asymptotically stable. The zero solution of (2) is called exponentially stable if there exist constants \(N>0\) and \(\theta\in (0,1)\) not depending on \(x^{*}\) such that
For the basic notions, properties, and results we refer, e.g., to [1, 4, 6, 7] and to the references therein. For linear systems, all solutions are simultaneously stable (exponentially stable) if the zero solution is stable (exponentially stable). Therefore, in contrast to nonlinear systems, for linear systems, the concept of a stable system (exponentially stable system) is meaningful.
The stability of system (1) is often analyzed through the characteristic equation
where I is an \(n\times n\) identity matrix and λ is a suitable complex constant. Expanding (4), we obtain
with real \(p_{i}\), \(i=1,2,\ldots,n\). Necessary and sufficient for the exponential stability of the linear system (1) is the condition \(\rho(A)<1\) (see, e.g., [4, 6]) where \(\rho(A)\) is the spectral radius of the matrix A. For discrete equations, unfortunately, such a simple and effective tool of investigation of the roots of the characteristic equation for the differential systems, as the Hurwitz criterion giving the necessary and sufficient condition for \(\operatorname{Re} \lambda _{i}<0\), \(i=1,2,\ldots, n\), is not available. The well-known Schur-Cohn criterion [4, 8, 9], to verify \(\rho(A)<1\), is not easily applicable because the higher the order of the characteristic equation (5), the more difficult the computation becomes.
An alternative to studying the stability by algebraic methods is the method of Lyapunov functions (described, e.g., in [4, 6]). For linear stationary systems (1), the Lyapunov function is sought in the form of a quadratic form \(V ( x )=x^{T}Hx\) where a symmetric positive definite \(n\times n\) matrix H is the solution of the matrix Lyapunov equation
System (1) is exponentially stable if and only if, for an arbitrary positive definite symmetric \(n\times n\) matrix C, the matrix equation (6) is solvable and has a unique solution - a positive definite symmetric matrix H [4].
The parameters of mathematical models of dynamic systems are, generally speaking, determined experimentally and are known with some degree of adequacy. The stability of such systems can be investigated as the stability of a perturbed system to a given initial system.
The investigation of the stability of system (2) is, in essence, close to the investigation of what is called interval stability of linear differential equations. Such an investigation was carried out by Haritonov, we refer at least to one of his founding papers [10] where the necessary and sufficient conditions for stability were formulated.
1.2 Systems with a single delay
In Section 3, we study linear homogeneous difference systems with a single delay,
where \(A=(a_{ij})_{i,j=1}^{n}\) and \(D=(d_{ij})_{i,j=1}^{n}\) are real constant matrices, \(m\in\mathbb{N}\), and norms \(|B(k)|\), \(|E(k)|\) of the real matrices \(B(k)=(b_{ij}(k))_{i,j=1}^{n}\), \(E(k)=(e_{ij}(k))_{i,j=1}^{n}\) are small in a sense. System (7) can be viewed as a perturbation of the system
Recall that the initial problem \(x ( k )=x_{k}^{*}\), \(k=-m,-m+1,\ldots,0\) for (7) or (8) where \(x_{k}^{*}\in\mathbb {R}^{n}\) is uniquely solvable. Below, we utilize the norm
Definition 2
The zero solution \(x(k)=0\), \(k=-m,-m+1,\ldots\) of system (7) is called (Lyapunov) stable if, for an arbitrary \(\varepsilon>0\), there exists a \(\delta ( \varepsilon )>0\) such that, for any solution \(x^{*} ( k )\) of system (7), we have \(\vert {x^{*} ( k )} \vert <\varepsilon\) for \(k=0,1,\ldots\) , provided that \(\Vert {x^{*} ( 0 )} \Vert _{m} <\delta ( \varepsilon )\). If, moreover,
the zero solution is called asymptotically stable. The zero solution of system (7) is called exponentially stable if there exist constants \(N>0\) and \(\theta\in(0,1)\) not depending on \(x^{*}\) such that
To establish the fact of the asymptotic stability of system (8), we consider the associated characteristic equation
Expanding the determinant on the right-hand side, we obtain, in general, an algebraic equation of degree \(( {m+1} )n\) and we are facing an even greater difficulty than in the case of equation (5). Recently, for the asymptotic stability of special classes of linear discrete equations with constant complex coefficients and with delay, simple criterions have been derived in [11–17] (the criteria derived in [11] are fully explicit with respect to the delay).
The paper is organized as follows. Sufficient conditions for the exponential stability and explicit exponential estimates of solutions of non-delayed systems (2) are derived in Section 2 by the second method of Lyapunov. For systems with a single delay (7), such an investigation is performed in Section 3. The investigations of both classes of systems (2) and (7) differ. The difference is caused by the presence of delay in (7). The difficulty caused by the Lyapunov function being estimated was overcome by using what is called Razumikhin condition while applying of several auxiliary inequalities. The applicability of the results is illustrated by examples and concluding remarks are included in Section 4.
2 Exponential stability of non-delayed systems
Theorem 1 below gives sufficient conditions for exponential stability of the perturbed system (2), and suitable parameters N and θ in the definition of exponential stability (3) of solutions are explicitly defined. In the proof, Lyapunov function \(V(x)=x^{T}Hx\) is used where H solves the matrix Lyapunov equation (6). With respect to the matrix of perturbation \(B(k)\), \(k=0,1,\ldots\) we assume that there exists a number \({\mathcal{D}}\) such that, for every \(k=0,1,\ldots\) , we have
First, we need auxiliary lemmas. Denote
and
Lemma 1
Let \(\rho(A)<1\). Let C be a fixed positive definite matrix and let matrix H solve matrix equation (6). Then \({\mathcal{D}}^{*}>0\) and, if \({\mathcal{D}}<{\mathcal{D}}^{*}\), then \(\xi>0\).
Proof
Inequality \({\mathcal{D}}^{*}>0\) is obvious. Solve the quadratic equation \(\xi=0\) with respect to \({\mathcal{D}}\). Its roots \({\mathcal{D}}_{1,2}\) are
and \(\xi>0\) if \({\mathcal{D}}\in({\mathcal{D}}_{2},{\mathcal {D}}_{1})=({\mathcal{D}}_{2},{\mathcal{D}}^{*})\), \({\mathcal{D}}_{2}<0\). Since, by its definition, \({\mathcal{D}}\ge0\), we conclude that \(\xi >0\) if \({\mathcal{D}}\in[0,{\mathcal{D}}^{*})\). □
The following result is taken from Chapter 7, Section 4 in [18].
Lemma 2
Let \(A_{1}\) and \(A_{2}\) be positive definite matrices. Then
In the Russian translation of [18], it is noted that (10) holds even for arbitrary Hermitian matrices \(A_{1}\), \(A_{2}\).
Theorem 1
Let \(\rho(A)<1\). Let C be a fixed positive definite matrix and let matrix H solve the matrix Lyapunov equation (6). If
then system (2) is exponentially stable and, for any of its solutions \(x=x(k)\), the inequality
holds where
Proof
Recall that H is a symmetric positive definite matrix and, by Lemma 1, \(\xi>0\) since (11) is assumed. Define a Lyapunov function
For the first difference of \(V ( x )\) along the trajectories of system (2), we have (\(k\ge0\))
We transform the last difference to
Consequently, \(\Delta V ( {x ( k )} )\le0\), and the zero equilibrium (and, therefore, system (2)) is stable. Now we derive an explicit estimate (12) of the exponential type. Since
from inequality (14) we get
or
Below we solve this difference inequality, but first we show that the coefficient
on the right-hand side of (16) satisfies estimates (13). The right-hand side of inequality (13) is a simple consequence of inequality \(\xi>0\).
To prove the left-hand side of inequality (13), we use Lemma 2 with matrices \(A_{1}\), \(A_{2}\) defined as \(A_{1}:=H-A^{T}HA\) and \(A_{2}:=A^{T}HA\). Then
and
Therefore,
and the left-hand side of inequality (13) holds.
Solving the difference inequality (16), we obtain
Using (15) together with the obtained inequality, we get
and, consequently,
or
i.e., we get inequality (12). □
Example 1
Let \(n=2\) and
be specified in system (2). Let
The matrix
solves the matrix Lyapunov equation (6), \(\lambda_{\mathrm{min}}(C)=0.36\), \(\lambda_{\mathrm{min}}(H)=\lambda_{\mathrm{max}}(H)=\varphi(H)=1\), \(|H|=1\), \(|A^{T}H|=0.8\) and \({\mathcal{D}}^{*}=0.2\). If \(|B(k)|\le{\mathcal{D}}<{\mathcal{D}}^{*}=0.2\), \(k=0,1,\ldots\) , then system (2) is exponentially stable. For, say, \({\mathcal{D}}=0.19\), we have \(\xi=0.0199\) and (12) becomes
3 Exponential stability and estimation of convergence of linear systems with delay
In this part we study linear difference systems with single delay (7) by the second Lyapunov method. A short survey of the use of the second Lyapunov method for the investigation of stability of discrete systems with delay now follows. Often, two modifications are used. The first is what is called the method of finite-dimensional Lyapunov functions, and the second one is the method of functionals of Lyapunov-Krasovskii. Strictly speaking, the latter method is called the method of functionals only because it is a discrete analog of the method of functionals for functional differential equations with delay. In the following, we use the former method.
If the method of Lyapunov functions is to be applied to systems of differential equations with delay \(\dot{x} ( t )=f ( {x ( t ),x ( {t-\tau } )} ) \) where \(f\colon{\mathbb {R}}^{n}\times{\mathbb {R}}^{n}\to{\mathbb {R}}^{n}\) and \(\tau>0\), it is necessary to find a positive definite and continuously differentiable function \(V(x)\) such that its total derivative along solutions of the system is negative definite provided that a so-called Razumikhin condition holds, i.e., that the solutions approach the surface level
where α is a positive constant from the domain
Formally, the Razumikhin condition can be written as \(V ( {x ( s )} )< V ( {x ( t )} ) \) where \(t-\tau\le s < t\). For quadratic Lyapunov functions \(V(x)=x^{T}Hx\) with a symmetric positive definite matrix H, this inequality implies \(\vert {x ( {s} )} \vert <\sqrt{\varphi ( H )} \vert {x ( t )} \vert \) where \(t-\tau\le s< t\). Below, we consider a similar approach for studying the stability of difference systems with delay.
3.1 Auxiliary inequalities
First we derive three lemmas related to auxiliary inequalities. Such inequalities are used in the proof of Theorem 2 in Section 3.2.
Lemma 3
Let \(L_{0}>0\), \(a_{0}\ge0\), \(b_{0}\ge0\), \(c_{0}>0\), \(d_{0}\ge0\), and \(e_{0}>0\) be constants. If there exist positive constants ξ and η such that
and \(\xi<\xi_{0}\), \(\eta<\eta_{0}\) where
then
Proof
If
then (20) holds. Let ξ be such that
The above inequality holds if \(0<\xi<\xi_{0}\) where \(\xi_{0}\) is defined by (18). Now we find η such that
The last inequality is valid if \(0<\eta<\eta_{0}\) where \(\eta_{0}\) is defined by (19). Therefore, (20) will be valid for \(0<\xi<\xi_{0}\), \(0<\eta<\eta _{0}\) and \(k\ge0\). □
Lemma 4
Let \(L_{1}>0\), \(a_{1}\ge0\), \(b_{1}\ge0\), \(c_{1}>0\), and \(d_{1}>0\) be constants. If there exist positive constants ξ and η such that
and \(\xi<\xi_{1}\), \(\eta<\eta_{1}\) where
then
Proof
If
then (24) holds. Assume that ξ satisfies
This inequality holds if \(0<\xi<\xi_{1}\) where \(\xi_{1}\) is defined by (22). Now we find η satisfying
This inequality is valid if \(0<\eta<\eta_{1}\) where \(\eta_{1}\) is defined by (23). Therefore, (24) will be valid for \(0<\xi<\xi_{1}\), \(0<\eta<\eta _{1}\), and \(k\ge0\). □
Lemma 5
Let \(L_{2}>0\), \(a_{2}\ge0\), \(b_{2}\ge0\), \(d_{2}>0\), and \(e_{2}>0\) be constants. If there exist positive constants ξ and η such that
and \(\xi<\xi_{2}\), \(\eta<\eta_{2}\) where
then
Proof
If
then (28) holds. We find η such that
The last inequality will hold if \(0<\eta<\eta_{2}\) where \(\eta_{2}\) is defined by (26). Now we choose ξ such that inequality
holds, i.e., only inequality \(0<\xi<\xi_{2}\) needs to be satisfied where \(\xi_{2}\) is defined by (27). Therefore, (28) will be valid for \(0<\xi<\xi_{2}\), \(0<\eta<\eta _{2}\), and \(k\ge0\). □
3.2 Exponential stability and estimation of solutions
Let \(\gamma>1\). To apply the auxiliary lemmas from the previous part in the proof of Theorem 2, the following quantities are needed:
Moreover, we set
with
-
\(\xi_{0}\), \(\eta_{0}\) defined by equations (18), (19) where \(L_{0}\), \(a_{0}\), \(b_{0}\), \(c_{0}\), \(d_{0}\) and \(e_{0}\) are defined by (29)-(31),
-
\(\xi_{1a}\), \(\eta_{1a}\) defined by equations (22), (23) for \(\xi_{1}\), \(\eta_{1}\) (in (23) is \(\xi_{1}\) replaced by \(\xi_{1a}\)) where \(L_{1}=L_{11}\), \(a_{1}=a_{11}\), \(b_{1}=b_{11}\), \(c_{1}=c_{11}\), \(d_{1}=d_{11}\) and \(L_{11}\), \(a_{11}\), \(b_{11}\), \(c_{11}\), \(d_{11}\) are defined by the right-hand sides of (32), (33),
-
\(\xi_{1b}\), \(\eta_{1b}\) defined by equations (22), (23) for \(\xi_{1}\), \(\eta_{1}\) (in (23) is \(\xi_{1}\) replaced by \(\xi_{1b}\)) where \(L_{1}=L_{12}\), \(a_{1}=a_{12}\), \(b_{1}=b_{12}\), \(c_{1}=c_{12}\), \(d_{1}=d_{12}\) and \(L_{12}\), \(a_{12}\), \(b_{12}\), \(c_{12}\), \(d_{12}\) are defined by the right-hand sides of (34), (35),
-
\(\eta_{2}\), \(\xi_{2}\) defined by equations (26), (27) where \(L_{2}\), \(a_{2}\), \(b_{2}\), \(d_{2}\) and \(e_{2}\) are defined by (36), (37).
The following theorem provides us with sufficient conditions for the exponential stability and an estimate of the exponential rate of convergence of solutions.
Theorem 2
Let \(\rho(A)<1\), C be a fixed positive definite matrix and let matrix H solve the corresponding Lyapunov matrix equation (6). Assume that, for a fixed \(\gamma>1\), the inequalities \(L_{0}>0\), \(L_{11}>0\), \(L_{12}>0\), and \(L_{2}>0\) hold. If
where \({\mathcal{D}}_{1}^{*} < {\mathcal{D}}_{1}\), \({\mathcal{D}}_{2}^{*} < {\mathcal{D}}_{2}\), then system (7) is exponentially stable and, for an arbitrary solution \(x(k)\) of (7), an exponential convergence estimate
holds.
Proof
We use the Lyapunov function \(V(x,k)=\gamma^{k} x^{T}Hx\). Obviously,
For an arbitrary \(\varepsilon>0\), we choose \(\delta( \varepsilon):= {\varepsilon}/{\sqrt{\varphi(H)}}\). If a solution \(x ( k )\) of (7) satisfies \(\Vert {x ( 0 )} \Vert _{m} =\delta ( \varepsilon )\), then, for \(k=-m,-m+1,\ldots,0\),
or
We show that (42) holds for all \(k\ge1\) as well. Suppose this is not the case. Then there exists \(k=k_{0}\ge0\), such that
i.e., at \(k=k_{0}+1\) for the first time, the function value \(x(k_{0}+1)\) lies outside the area
where \(\alpha=\varepsilon ^{2}\lambda_{\mathrm{min}} ( H )\). The first difference of \(V(x,k)\) along the trajectories of system (7) has the form
We rewrite this expression as follows:
A further reorganization of the right-hand side of the last expression leads to
Using the Lyapunov matrix equation (6) and estimating the right-hand side, we get, for \(k=k_{0}\),
and, applying inequality \(x(k_{0})x(k_{0}-m)\le(x^{2}(k_{0})+x^{2}(k_{0}-m))/2\),
Since the chain of inequalities
holds for \(k=-m,-m+1,\ldots,k_{0}\), we deduce
Applying (44) in the last expression of the estimate of the first difference of the Lyapunov function \(V(x(k),k)\) at \(k=k_{0}\) to terms with the argument \(k_{0}-m\), i.e., putting \(k=k_{0}-m\) in (44), we get
We can rewrite this inequality, adding up the multiples of \(|x(k_{0})|^{2}\) and of \(|x(k_{0}+1)|^{2}\), as
We derive sufficient conditions for the positivity of the first coefficient in the round brackets in (45), i.e., for
We apply Lemma 4 with \(L_{1}:=L_{11}\), \(a_{1}:=a_{11}\), \(b_{1}:=b_{11}\), \(c_{1}:=c_{11}\), \(d_{1}:=d_{11}\) where \(L_{11}\), \(a_{11}\), \(b_{11}\), \(c_{11}\), and \(d_{11}\) are defined by (32), (33) (obviously \(c_{11}=d_{11}>0\)). It is sufficient to satisfy inequality (21), i.e.,
Both inequalities are valid due to assumptions (38), (39).
Therefore, we can continue to estimate the first difference of the Lyapunov function. Using (41), from (45), we get
The resulting inequality can be rewritten in the form
We derive sufficient conditions for the positivity of coefficients in the big square brackets, i.e., for
and
Consider inequality (46). We apply Lemma 5 with \(L_{2}\), \(a_{2}\), \(b_{2}\), \(d_{2}\), and \(e_{2}\) defined by (36), (37) (obviously \(d_{2}=e_{2}>0\)). It is sufficient to satisfy the inequalities (25), i.e.,
Both inequalities are valid due to assumptions (38), (39).
Consider inequality (47). We apply Lemma 4 with \(L_{1}:=L_{12}\), \(a_{1}:=a_{12}\), \(b_{1}:=b_{12}\), \(c_{1}:=c_{12}\), \(d_{1}:=d_{12}\) where \(L_{12}\), \(a_{12}\), \(b_{12}\), \(c_{12}\), and \(d_{12}\) are defined by (34), (35) (obviously \(c_{12}=d_{12}>0\)). It is sufficient to satisfy inequality (21), i.e.,
Both inequalities are valid due to assumptions (38), (39).
Then for an estimate of the Lyapunov function we get the inequality
where
We show that
The left-hand side of (49) holds due to the above arguments. The inequality
is a sufficient condition for the right-hand side of (49) to be valid, i.e. (after a minor rearrangement),
or
As follows from (29), (30), and (31), inequality (50) can be rewritten as
We apply Lemma 3 with \(L_{0}\), \(a_{0}\), \(b_{0}\), \(c_{0}\), \(d_{0}\), and \(e_{0}\) defined by (29)-(31) (obviously \(c_{0}>0\), \(e_{0}>0\)). It is sufficient to satisfy inequality (17), i.e.,
Both inequalities are valid due to assumptions (38), (39). Consequently, (49) holds and, from (43), we get
Therefore, assumption (43) is false and (42) holds for every \(k\ge-m\). From (41) and (42) we get
where \(k\ge0\), and
i.e., equation (40) holds. □
Example 2
Let \(n=2\), \(m=10\),
and, for simplicity, D be a \(2\times2\) null matrix specified in system (7). Let
The matrix
solves the matrix Lyapunov equation (6). As in Example 2, we get \(\lambda_{\mathrm{min}}(C)=0.36\), \(\lambda_{\mathrm{min}}(H)=\lambda_{\mathrm{max}}(H)=\varphi(H)=1\), \(|H|=1\) and \(|A^{T}H|=0.8\). Moreover, let \(\gamma=1.01\). Then
and
Let
and
If \(|B(k)|\le{\mathcal{D}}_{1}^{*}\), \(|E(k)|\le{\mathcal{D}}_{2}^{*}\), \(k=0,1,\ldots\) , then system (7) is exponentially stable. From (40), we get
4 Concluding remarks
The paper investigates the exponential stability assuming, without loss of generality, that the initial point is always defined for the value of the independent variable k being equal to 0 in the case of the non-delayed equation (2), and that the initial functions in the case of the delayed systems (7) are always defined for \(k=-m,-m+1,\ldots,0\). Obviously, our investigation can easily be modified for an arbitrary integer value of independent variable \(k=k_{0}\) in the case of the non-delayed equation (2) or if the initial functions, in the case of the delayed systems (7) are defined for the values of \(k=k_{0}-m,k_{0}-m+1,\ldots,k_{0}\). To this end, some minor changes in Definitions 1 and 2 are necessary. We omit the details as well as the relevant reformulation of the results.
Carefully tracing the proof of Theorem 1 we note that system (2) will be exponentially stable if condition (11) is replaced by a more general assumption:
Nevertheless, in such a case, inequality (12) is, in general, not preserved because the constant \(N:=\sqrt{\varphi(H)}\) in (12) (see Definition 1) can be different. Similarly, the exponential stability of system (7) will be preserved if inequalities (38), (39) in Theorem 2 are replaced by
In such a case, inequality (40) will be valid if, in general, the constant \(N:=\sqrt{\varphi(H)}\) in (9) (see Definition 2) is different. An open problem arises if we discuss inequalities (53) and (54), (55) concerning their further improvement. Particularly, is it possible to replace (9) by the weaker condition
and (54), (55) by the weaker conditions
where ρ is the spectral radius of a matrix?
The admissible values of the parameter γ used in the proof of Theorem 2 are \(\gamma>1\). Setting \(\gamma=1\) and tracing all steps of the proof, we conclude that the assertion of exponential stability is not true. It can be seen, e.g., from (52), that, in such a case, only the stability is proved since, for \(\Vert {x ( 0 )} \Vert _{m} =\delta ( \varepsilon )\) and \(k\ge0\), from (52) we get
Let K be a set of consecutive integers such that \(k\ge r\) for every \(k\in K\) (r is an integer). In [7] an exponential estimate of solutions of linearly perturbed linear systems
is studied assuming that matrices \(A_{1}(k)\) and \(B_{1}(k)\) are defined on K, \(\|B_{1}(k)\|\le\beta\), \(k\in K\), \(\|\cdot\|\) is a norm, and all solutions of the non-perturbed linear system
satisfy the estimate
for some positive constants q and α.
Then, by Theorem 2, part (i) in [7] any (forward) solution \(y(k)\) of (56) satisfies
To compare our results with those described above we assume \(\alpha<1\) in (58) (in the case of constant matrix \(A_{1}\), this inequality is equivalent to the assumption \(\rho(A)<1\) in Theorem 1).
Compare estimate (59) with estimation (12) in Theorem 1. The first one gives a qualitative result (since an estimate for q is not given and, therefore, it is not clear how small β should be to guarantee the inequality \(\alpha+\beta q<1\) and we cannot use (59) for numerical computations). The constants
in (12) play the roles of the constants \(q(\alpha+\beta q)^{-r}\) and \((\alpha+\beta q)^{2}\) in (59). We conclude that inequality (12) gives, together with qualitative information, a quantitative result as well and can be used for computational purposes.
Let \(B(k)=\Theta\) for every \(k=1,2,\ldots\) , where Θ is a \(n\times n\) null matrix. Then we can set \({\mathcal{D}}:=0\) and \(\xi=\lambda_{\mathrm{min}}(C)\). In such a case, Theorem 1 becomes the following theorem.
Theorem 3
Let \(\rho(A)<1\). Let C be a fixed positive definite matrix, and let matrix H solve matrix equation (6). Then system (1) is exponentially stable and, for any of its solutions \(x=x(k)\), the inequality
holds where
Comparing inequality (60) with (58) (and assuming, for simplicity, that \(A_{1}(k)\) in (57) is a constant matrix) we can explain the differences between both inequalities in a way similar to the one we used above.
Let us discuss the relationship between Theorem 1 and Theorem 2. It is obvious that they are independent since, in the case of system (7), we assume \(m\ge1\). Moreover, setting \(D=\Theta\) and \(E(k)\equiv\Theta\) in system (7), where Θ is the zero matrix, in order to turn it into system (1), does not turn the conclusion of Theorem 2 to the conclusion of Theorem 1. A direct comparison leads to a conclusion that the latter is sharper. The reason for this is that the auxiliary inequalities (Lemmas 3, 4, and 5), used in the proof of Theorem 2, are rather imprecise and cannot imply the same result.
The authors have recently published papers [19, 20] on a similar topic where further related results can be found, including their application to scalar equations and their comparison with known results. In [21] the boundedness character of positive solutions is studied. Let us refer as well to [22] where some exact stability results are derived. Although our results cannot give such exact results, the advantage of our approach is that the estimates of the norms of the solutions are given by inequalities. Such estimates are not derived in [22].
References
Agarwal, RP: Difference Equations and Inequalities: Theory, Methods and Applications, 2nd edn. Monographs and Textbooks in Pure and Applied Mathematics. Dekker, New York (2000)
Agarwal, RP, Wong, PJY: Advanced Topics in Difference Equations. Kluwer Academic, Dordrecht (1997)
Aulbach, B: Continuous and Discrete Dynamics near Manifolds of Equilibria. Lecture Notes in Mathematics, vol. 1058. Springer, Berlin (1984)
Elaydi, SN: An Introduction to Difference Equations. Undergraduate Texts in Mathematics. Springer, Berlin (2005)
Kelly, WG, Peterson, AC: Difference Equations. Academic Press, San Diego (2001)
Laksmikantham, V, Trigiante, D: Theory of Difference Equations: Numerical Methods and Applications, 2nd edn. Dekker, New York (2002)
Aulbach, B: On linearly perturbed linear system. J. Math. Anal. Appl. 112, 317-327 (1985)
Jones, WB, Thorn, WJ: Continued Fractions: Analytic Theory and Applications. Addison-Wesley, Reading (1980)
Marden, M: Geometry of Polynomials. Am. Math. Soc., Providence (1966)
Haritonov, VL: The asymptotic stability of the equilibrium state of a family of systems of linear differential equations. Differ. Uravn. 14, 2086-2088 (1978) (in Russian) (English translation: Differ. Equ. 14, 1483-1485 (1979))
Čermák, J, Jánský, J: Stability switches in linear delay difference equations. Appl. Math. Comput. 243, 755-766 (2014)
Čermák, J, Jánský, J, Kundrát, P: On necessary and sufficient conditions for the asymptotic stability of higher order linear difference equations. J. Differ. Equ. Appl. 18, 1781-1800 (2012)
Čermák, J, Tomášek, P: On delay-dependent stability conditions for a three-term linear difference equation. Funkc. Ekvacioj 57, 91-106 (2014)
Kaslik, E: Stability results for a class of difference systems with delay. Adv. Differ. Equ. 2009, Article ID 938492 (2009)
Kipnis, MM, Nigmatullin, RM: Stability of the trinomial linear difference equations with two delays. Autom. Remote Control 65(11), 1710-1723 (2004)
Kuruklis, SA: The asymptotic stability of \(x_{n+1}-ax_{n} + bx_{n-k} = 0\). J. Math. Anal. Appl. 188, 719-731 (1994)
Levin, SA, May, R: A note on difference delay equations. Theor. Popul. Biol. 9, 178-187 (1976)
Bellman, R: Introduction to Matrix Analysis. McGraw-Hill, New York (1960) (Russian translation: Nauka, Moscow (1976))
Diblík, J, Khusainov, DY, Baštinec, J, Sirenko, AS: Stability and exponential stability of linear discrete systems with constant coefficients and single delay. Appl. Math. Comput. 269, 9-16 (2015)
Diblík, J, Khusainov, DY, Baštinec, J, Sirenko, AS: Exponential stability of linear discrete systems with constant coefficients and single delay. Appl. Math. Lett. 51, 68-73 (2016)
Stević, S: Boundedness character of the recursive sequence \(x_{n} = \alpha + \prod_{j=1}^{k} x_{n-j}^{a_{j}}\). Appl. Math. Lett. 50, 83-90 (2015)
Kipnis, M, Komissarova, D: Stability of a delay difference system. Adv. Differ. Equ. 2006, Article ID 31409 (2006)
Acknowledgements
The first author has been supported by the project No. LO1408, AdMaS UP - Advanced Materials, Structures and Technologies (supported by Ministry of Education, Youth and Sports of the Czech Republic under the National Sustainability Programme I). The second author has been supported by the project RP9051800400 (3.5 Support of International Mobility of Academic Staff, Faculty of Civil Engineering, Brno University of Technology) as a part of developing programme guaranteed by Ministry of Education, Youth and Sports of the Czech Republic). The third author has been supported by the Grant FEKT-S-14-2200 of Faculty of Electrical Engineering and Communication, Brno University of Technology.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Diblík, J., Khusainov, D.Y., Baštinec, J. et al. Exponential stability of perturbed linear discrete systems. Adv Differ Equ 2016, 2 (2016). https://doi.org/10.1186/s13662-015-0738-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-015-0738-6