On the Measurement of Lower Solution Bounds of the Discrete Algebraic Lyapunov Equation
In this paper, the estimation problem of lower solution bounds for the discrete algebraic Lyapunov equation (the DALE) is addressed. By utilizing linear algebraic techniques, several new lower solution bounds of the DALE are presented. We also propose a numerical algorithm to develop sharper solution bounds. The obtained bounds can give a supplement to those appeared in the literature.
KeywordsDiscrete algebraic Lyapunov equation Lower solution bound Linear algebraic technique
- 2.Gajic, Z., & Qureshi, M. (1995). Lyapunov matrix equation in system stability and control. New York: Academic Press.Google Scholar
- 12.Mori, T., & Kokame, H. (2002). On the solution bounds for three types of Lyapunov matrix equations: continuous, discrete and unified equations. IEEE Transactions on Automatic Control, 19, 1767–1770 (issue: 10).Google Scholar
- 14.Penzl, T. (2000). Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case. Systems & Control Letters, 40, 130–144 (issue: 2).Google Scholar
- 16.Truhar, N., & Veselic, K. (2007). Bounds on the trace of a solution to the Lyapunov equation with a general stable matrix. Systems & Control Letters, 56, 493–503 (issue: 7-8).Google Scholar