- Research Article
- Open Access
Trace Inequalities for Matrix Products and Trace Bounds for the Solution of the Algebraic Riccati Equations
© Jianzhou Liu et al. 2009
- Received: 25 February 2009
- Accepted: 6 November 2009
- Published: 10 November 2009
By using diagonalizable matrix decomposition and majorization inequalities, we propose new trace bounds for the product of two real square matrices in which one is diagonalizable. These bounds improve and extend the previous results. Furthermore, we give some trace bounds for the solution of the algebraic Riccati equations, which improve some of the previous results under certain conditions. Finally, numerical examples have illustrated that our results are effective and superior.
- System Matrice
- Unit Sphere
- Matrix Product
- Riccati Equation
- Symmetric Case
As we all know, the Riccati equations are of great importance in both theory and practice in the analysis and design of controllers and filters for linear dynamical systems (see [1–5]). For example, consider the following linear system (see ):
with the cost
with and being positive definite and positive semidefinite matrices, respectively. To guarantee the existence of the positive definite solution to (1.4), we will make the following assumptions: the pair is stabilizable, and the pair is observable.
In practice, it is hard to solve the ARE, and there is no general method unless the system matrices are special and there are some methods and algorithms to solve (1.4); however, the solution can be time-consuming and computationally difficult, particularly as the dimensions of the system matrices increase. Thus, a number of works have been presented by researchers to evaluate the bounds and trace bounds for the solution of the ARE (see [6–16]). Moreover, in terms of [2, 6], we know that an interpretation of is that is the average value of the optimal cost as varies over the surface of a unit sphere. Therefore, considering its applications, it is important to discuss trace bounds for the product of two matrices. In symmetric case, a number of works have been proposed for the trace of matrix products ([2, 6–8, 17–20]), and  is the tightest among the parallel results.
In 1995, Lasserre showed  the following given any matrix then the following.
This paper is organized as follows. In Section 2, we propose new trace bounds for the product of two general matrices. The new trace bounds improve the previous results. Then, we present some trace bounds for the solution of the algebraic Riccati equations, which improve some of the previous results under certain conditions in Section 3. In Section 4, we give numerical examples to demonstrate the effectiveness of our results. Finally, we get conclusions in Section 5.
In the following, let denote the set of real matrices and let denote the subset of consisting of symmetric matrices. For , we assume that , denote the trace, the inverse, the transpose, the diagonal elements, the singular values of , respectively, and define . If is an arbitrary symmetric matrix, then and denote the eigenvalues and the real part of eigenvalues of . Suppose is a real -element array such as which is reordered, and its elements are arranged in nonincreasing order; that is, . The notation ( ) is used to denote that is a symmetric positive definite (semidefinite) matrix.
The following lemmas are used to prove the main results.
Lemma 2.1 (see [21, Page 92, H.2.c]).
Lemma 2.2 (see [21, Page 218, B.1]).
Lemma 2.3 (see [21, Page 240, F.4.a]).
Lemma 2.4 (see ).
This completes the proof.
This completes the proof.
Komaroff (1994) in  obtained the following. Let be the positive semidefinite solution of the ARE (1.4). Then the trace of has the upper bound given by
In this section, by appling our new trace bounds in Section 2, we obtain some lower trace bounds for the solution of the algebraic Riccati equations. Furthermore, we obtain some upper trace bounds which improve (3.1) under certain conditions.
By (1.5), (2.6), and (3.8), we have
From Remark 2.6 and Theorem 3.1, we have the following results.
Then we can also obtain (3.20).
Note that the right-hand side of (3.20) is (3.1), which implies that Theorem 3.1 improves (3.1).
In this section, firstly, we will give an example to illustrate that our new trace bounds are better than those of the recent results. Then, to illustrate that the application in the algebraic Riccati equations of our results will have different superiority if we choose different and , we will give two examples.
where both lower and upper bounds are better than those of the main result of , that is, (1.5).
where the upper bound is better than that of the main result of , that is, (3.1).
where the lower and upper bounds are better than those of (4.8).
In this paper, we have proposed lower and upper bounds for the trace of the product of two real square matrices in which one is diagonalizable. We have shown that our bounds for the trace are the tightest among the parallel trace bounds in symmetric case. Then, we have obtained some trace bounds for the solution of the algebraic Riccati equations, which improve some of the previous results under certain conditions. Finally, numerical examples have illustrated that our bounds are better than those of the previous results.
The authors would like to thank Professor Jozef Banas and the referees for the very helpful comments and suggestions to improve the contents and presentation of this paper. The work was also supported in part by the National Natural Science Foundation of China (10971176).
- Kwakernaak K, Sivan R: Linear Optimal Control Systems. John Wiley & Sons, New York, NY, USA; 1972.MATHGoogle Scholar
- Kleinman DL, Athans M: The design of suboptimal linear time-varying systems. IEEE Transactions on Automatic Control 1968, 13: 150–159. 10.1109/TAC.1968.1098852MathSciNetView ArticleGoogle Scholar
- Davies R, Shi P, Wiltshire R: New upper solution bounds for perturbed continuous algebraic Riccati equations applied to automatic control. Chaos, Solitons and Fractals 2007,32(2):487–495. 10.1016/j.chaos.2006.06.096MATHMathSciNetView ArticleGoogle Scholar
- Ogata K: Modern Control Engineering. 3rd edition. Prentice-Hall, Englewood Cliffs, NJ, USA; 1997.MATHGoogle Scholar
- Ni M-L: Existence condition on solutions to the algebraic Riccati equation. Acta Automatica Sinica 2008,34(1):85–87.MathSciNetView ArticleGoogle Scholar
- Wang SD, Kuo T-S, Hsü C: Trace bounds on the solution of the algebraic matrix Riccati and Lyapunov equation. IEEE Transactions on Automatic Control 1986,31(7):654–656. 10.1109/TAC.1986.1104370MATHView ArticleMathSciNetGoogle Scholar
- Saniuk JM, Rhodes IB: A matrix inequality associated with bounds on solutions of algebraic Riccati and Lyapunov equations. IEEE Transactions on Automatic Control 1987, 32: 739–740. 10.1109/TAC.1987.1104700MATHView ArticleGoogle Scholar
- Mori T: Comments on A matrix inequality associated with bounds on solutions of algebraic Riccati and Lyapunov equations. IEEE Transactions on Automatic Control 1988, 33: 1088–1091. 10.1109/9.14428MATHView ArticleGoogle Scholar
- Kang T, Kim BS, Lee JG: Spectral norm and trace bounds of algebraic matrix Riccati equations. IEEE Transactions on Automatic Control 1996,41(12):1828–1830. 10.1109/9.545751MATHMathSciNetView ArticleGoogle Scholar
- Kwon WH, Moon YS, Ahn SC: Bounds in algebraic Riccati and Lyapunov equations: a survey and some new results. International Journal of Control 1996,64(3):377–389. 10.1080/00207179608921634MATHMathSciNetView ArticleGoogle Scholar
- Kim SW, Park PG: Matrix bounds of the discrete ARE solution. Systems & Control Letters 1999,36(1):15–20. 10.1016/S0167-6911(98)00061-9MathSciNetView ArticleMATHGoogle Scholar
- Kouikoglou VS, Tsourveloudis NC: Eigenvalue bounds on the solutions of coupled Lyapunov and Riccati equations. Linear Algebra and Its Applications 1996, 235: 247–259.MATHMathSciNetView ArticleGoogle Scholar
- Lee C-H: Eigenvalue upper bounds of the solution of the continuous Riccati equation. IEEE Transactions on Automatic Control 1997,42(9):1268–1271. 10.1109/9.623090MATHView ArticleMathSciNetGoogle Scholar
- Lee C-H: New results for the bounds of the solution for the continuous Riccati and Lyapunov equations. IEEE Transactions on Automatic Control 1997,42(1):118–123. 10.1109/9.553695MATHView ArticleMathSciNetGoogle Scholar
- Lee C-H: On the upper and lower bounds of the solution for the continuous Riccati matrix equation. International Journal of Control 1997,66(1):105–118. 10.1080/002071797224847MATHMathSciNetView ArticleGoogle Scholar
- Komaroff N: Diverse bounds for the eigenvalues of the continuous algebraic Riccati equation. IEEE Transactions on Automatic Control 1994,39(3):532–534. 10.1109/9.280751MATHMathSciNetView ArticleGoogle Scholar
- Fang YG, Loparo KA, Feng X: Inequalities for the trace of matrix product. IEEE Transactions on Automatic Control 1994,39(12):2489–2490. 10.1109/9.362841MATHMathSciNetView ArticleGoogle Scholar
- Lasserre JB: A trace inequality for matrix product. IEEE Transactions on Automatic Control 1995,40(8):1500–1501. 10.1109/9.402252MATHMathSciNetView ArticleGoogle Scholar
- Park P: On the trace bound of a matrix product. IEEE Transactions on Automatic Control 1996,41(12):1799–1802. 10.1109/9.545717MATHView ArticleMathSciNetGoogle Scholar
- Lasserre JB: Tight bounds for the trace of a matrix product. IEEE Transactions on Automatic Control 1997,42(4):578–581. 10.1109/9.566673MATHMathSciNetView ArticleGoogle Scholar
- Marshall AW, Olkin I: Inequalities: Theory of Majorization and Its Applications, Mathematics in Science and Engineering. Volume 143. Academic Press, New York, NY, USA; 1979:xx+569.Google Scholar
- Wang CL: On development of inverses of the Cauchy and Hölder inequalities. SIAM Review 1979,21(4):550–557. 10.1137/1021096MATHMathSciNetView ArticleGoogle Scholar
- Horn RA, Johnson CR: Matrix Analysis. Cambridge University Press, Cambridge, UK; 1986.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.