Abstract
Based on the eigenvalue idea and the time-varying weighted vector norm in the state space we construct here the lower and upper bounds of the solutions of uniformly asymptotically stable linear systems. We generalize the known results for the linear time-invariant systems to the linear time-varying ones.
Keywords:
linear time-varying system; uniformly asymptotically stable system; lower and upper bound on the solutions; time-varying vector norm; simulation MSC:
34A30; 34L15; 34D23; 37M05
1. Introduction
In addition to the Lyapunov stability criteria for the linear system of ordinary differential equations other types of conditions guaranteeing the stability often are useful. Typically these are sufficient conditions that are proved by application of the Lyapunov stability theorems [1], or the Gronwall–Bellman inequality [2], though sometimes either technique can be used, and sometimes both are used in the same proof of a stability criterion. One of these useful results for stability analysis of the linear systems is the following theorem ([3], p. 132, Theorem 8.2).
Theorem 1.
For the linear system denote the largest and smallest point-wise eigenvalues of by and Then for any and the solution satisfies
Throughout the whole paper it is assumed that a matrix function is continuous.
This theorem belongs, as a special case, to the wider family of sufficient conditions for stability of the linear systems based on the “logarithmic measure” of the system matrices ([4], p. 58, Theorem 3) taking into account the fact that for the Euclidean norm the “logarithmic measure” of a real matrix A is just the largest eigenvalue of ([4], p. 41).
Our aim in this paper is to prove more useful theorem based on the eigenvalues idea for estimating asymptotics of the solutions of uniformly asymptotically stable linear systems. The theory is illustrated by two examples.
Notations, Definitions and Preliminary Results
Let denotes n-dimensional vector space over the real numbers, is a column vector and the symbol refers to any (real) vector norm on Specifically, for a symmetric, positive definite real matrix we define the weight H vector norm Obviously, for ( the identity matrix) we obtain the Euclidean norm, For the matrices as an operator norm we will use an induced norm. Particularly, for weight H vector norm in the norm where as was proved in [5]. Further, denotes the eigenvalues of the matrix and, analogously,
In this paper we will deal solely with the uniformly asymptotically (⇔ uniformly exponentially) stable linear systems ([1], Theorem 4.11), ([3], Theorem 6.13); for the different types of stability and their relation, see e.g., [6].
Definition 1
([1,3]). The linear system is called uniformly asymptotically stable (UAS) if there exist finite positive constants λ such that for any and the corresponding solution satisfies
We recall that the transition matrix of the linear system is where is a fundamental matrix of the system. In particular, if is an constant matrix, then the transition matrix is
For the following theorem see, e.g., ([1], p. 156, Theorem 4.11) or ([3], p. 102, Theorem 6.7).
Theorem 2.
The linear system is uniformly asymptotically stable if and only if there exist finite positive constants λ such that
for all such that
Theorem 1 leads to proof of some simple criterion based on the eigenvalues of ([3], p. 133, Corollary 8.4); for a wider context in connection with so called “logarithmic measure” of the matrices see also, e.g., [7,8,9].
Corollary 1.
If there exist real positive constants such that the largest point-wise eigenvalue of satisfies
for all such that then the linear system is UAS.
This criterion is quite conservative in the sense that many UAS linear systems do not satisfy the condition (2) as demonstrated by the following example.
Example 1.
The system with
is UAS because Because there does not exist a pair of positive constants such that the inequality (2) holds for all and so Corollary 1 is not applicable in this particular case. A straightforward computation by Theorem 1 gives
for all
Despite such examples the eigenvalue idea is not to be completely rejected. In Theorem 3 below we prove for the UAS linear systems the stronger result, generalizing Theorem 1 in such a way as to be meaningfully applicable to every UAS system.
2. Main Results
The main results of this paper are summarized in the following theorem generalizing ([5], Theorem 3.1) to the linear time-varying systems. Recall that although its claims are mainly of theoretical relevance, providing the necessary conditions for exponential stability, within its framework without giving details and exact mathematical explanation the important results regarding convergent systems were derived in [10]; for the definitions and comparisons with the notion of incremental stability see also [11]. Moreover, this theorem provides also the lower bound on the solutions generally classified as difficult to obtain.
Theorem 3.
If the linear system is UAS, where is a continuous matrix function, then there exists a continuous, symmetric and positive definite matrix function such that every solution of the system satisfies
and there exist two positive real constant such that
In particular, if is bounded, for all , then
Proof.
Set
In particular, if is a constant matrix, we have
We begin with the analysis of the properties of the matrix function Observe that is symmetric and positive definite because such is the integrand ([12], Corollary 14.2.10). The use of
- The Rayleigh–Ritz ratio [13],
- The fact that because every matrix and its transpose have the same characteristic polynomial ([12], Lemma 21.1.2),
- The fact that spectral radius of the matrix is less or equal to any induced matrix norm and
- Theorem 2
yields for every fixed and that
where are the constants given by Theorem 2. As a consequence, because there is equality for x equal to the eigenvector corresponding to To prove the left inequality in (4) we will need the following result.
Lemma 1.
If for all then the solution of the satisfies
Observe that the right-hand side inequality is uninteresting for UAS systems, every estimate of would grow exponentially as
Proof.
Arguing analogously as above, and the inequality (4) is proved.
Now we are ready to prove the remaining part of the theorem, namely the inequality (3). Suppose is a solution of corresponding to a given and nonzero Let us formally consider a time-varying weighted vector norm of the solutions Then
Now we show that the function satisfies time-varying Lyapunov equation (e.g., [1,3,14])
Using the Equations ([15], p. 70) and ([3], p. 62)
and
we obtain that
Returning to (6), Dividing through by which is positive at each the Rayleigh–Ritz ratio yields
Integrating from to any one gets
Exponentiation followed by taking the nonnegative square root gives for all the inequality
Finally using “norm conversion rule” between different weight and (recall are symmetric and positive definite matrices)
we obtain the inequality (3). □
Remark 1.
Combining ([5], Lemma 2.3, Theorem 2.1) and ([4], p. 58, Theorem 3) we obtain
which is a special case of (7) if Observe that in [5] satisfies the Lyapunov equation Thus, Theorem 3 represents generalization to the time-varying systems. Moreover, because and from the properties of induced matrix norm we have
for The general idea of the proof follows, e.g., the proof of ([3], p. 100, Theorem 6.4) and so the proof is omitted here. The last inequality generalizes ([5], Theorem 3.1) to the linear time-varying systems. Moreover, we get also the lower bound on the solutions.
3. Simulation Results
Example 2 (Example 1 revisited).
Let us consider again the system from Example 1. One gets
and
Since the eigenvalues of H are the inequality (7) for becomes
where The result of simulation in the Matlab environment demonstrating effectiveness of the developed approach is depicted in Figure 1.
Figure 1.
Solution of the linear time-invariant system from Example 1 and 2 with an initial state(the solid line) and the lower and upper bound given by (8) (the dashed lines).
Example 3.
For the linear time-varying system with
the fundamental matrix of the system (see [6]) is
The eigenvalues of satisfy
as
as for all and (monotonically) as and therefore the constant L in (4) is equal to (Figure 2).
Figure 2.
Time development of the.
The transition matrix is
and the matrix function from Theorem 3 is
with the eigenvalues
as (Figure 3).
Figure 3.
Time development of the functionsand.
The result of simulation—the solution of system and the lower and upper bounds—are depicted in the Figure 4.
Analyzing the properties of matrix function it is obvious that
and
for every Thus we obtain more readable approximate estimate of the solutions
and Theorem 2 is satisfied for
and
4. Conclusions
In this paper we established the lower and upper bounds of all solutions to uniformly asymptotically stable linear time-varying systems from the knowledge of one fundamental matrix solution. Our approach is based on the eigenvalue idea and a time-varying metric on the state space The simulation experiments demonstrates the effectiveness of the proposed method for estimating solutions, generally classified as “difficult to obtain”, especially in the case of the lower bounds.
Funding
The research was supported by the project VEGA 1/0272/18: “Holistic approach of knowledge discovery from production data in compliance with Industry 4.0 concept” and by Research and Development Operational Program (ERDF) [“University Scientific Park: Campus MTF STU—CAMBO”, grant number 26220220179].
Conflicts of Interest
The author declares no conflict of interest.
References
- Khalil, H.K. Nonlinear Systems, 3rd ed.; Prentice-Hall: Englewood Cliffs, NJ, USA, 2002. [Google Scholar]
- Chicone, C. Ordinary Differential Equations with Applications; (Texts in Applied Mathematics); Springer: New York, NY, USA, 1999; Volume 34. [Google Scholar]
- Rugh, W.J. Linear System Theory, 2nd ed.; Prentice-Hall, Inc.: Upper Saddle River, NJ, USA, 1996. [Google Scholar]
- Coppel, W.A. Stability and Asymptotic Behavior of Differential Equations; D. C. Heath and Company: Boston, MA, USA, 1965. [Google Scholar]
- Hu, G.-D.; Liu, M. The weighted logarithmic matrix norm and bounds of the matrix exponential. Linear Algebra Appl. 2004, 390, 145–154. [Google Scholar] [CrossRef]
- Zhou, B. On asymptotic stability of linear time-varying systems. Automatica 2016, 68, 266–276. [Google Scholar] [CrossRef]
- Afanas’ev, V.N.; Kolmanovskii, V.B.; Nosov, V.R. Mathematical Theory of Control Systems Design; Originally published by Kluwer Academic Publishers in 1996; Springer Science+Business Media: Dordrecht, The Netherlands, 1996. [Google Scholar]
- Dekker, K.; Verwer, J.G. Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations; North-Holland: Amsterdam, The Netherlands, 1984. [Google Scholar]
- Desoer, C.A.; Haneda, H. The Measure of a Matrix as a Tool to Analyze Computer Algorithms for Circuit Analysis. IEEE Trans. Circuits Theory 1972, 19, 480–486. [Google Scholar] [CrossRef]
- Lohmiller, W.; Slotine, J.-J.E. On contraction analysis for non-linear systems. Automatica 1998, 34, 683–696. [Google Scholar] [CrossRef]
- Rüffer, B.S.; van de Wouw, N.; Mueller, M. Convergent systems vs. incremental stability. Syst. Control Lett. 2013, 62, 277–285. [Google Scholar]
- Harville, D.A. Matrix Algebra From a Statistician’s Perspective; Springer: New York, NY, USA, 2008. [Google Scholar]
- Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
- Goh, B.S. Global stability in many-species systems. Am. Nat. 1977, 111, 135–143. [Google Scholar] [CrossRef]
- Coddington, E.A.; Levinson, N. Theory of Ordinary Differential Equations; McGraw-Hill: New York, NY, USA, 1955. [Google Scholar]
© 2020 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).