×

The Minkowski-Lyapunov equation for linear dynamics: theoretical foundations. (English) Zbl 1297.93124

Automatica 50, No. 8, 2015-2024 (2014); corrigendum ibid. 106, 411-412 (2019).
Summary: We consider the Lyapunov equation for the linear dynamics, which arises naturally when one seeks for a Lyapunov function with a uniform, exact decrease. In this setting, a solution to the Lyapunov equation has been characterized only for quadratic Lyapunov functions. We demonstrate that the Lyapunov equation is a well-posed equation for strictly stable dynamics and a much more general class of Lyapunov functions specified via Minkowski functions of proper \(C\)-sets, which include Euclidean and weighted Euclidean vector norms, polytopic and weighted polytopic (\(1, \infty\))-vector norms as well as vector semi-norms induced by the Minkowski functions of proper \(C\)-sets. Furthermore, we establish that the Lyapunov equation admits a basic solution, i.e., the unique solution within the class of Minkowski functions associated with proper \(C\)-sets. Finally, we provide a characterization of the lower and upper approximations of the basic solution that converge pointwise and compactly to it, while, in addition, the upper approximations satisfy the classical Lyapunov inequality.

MSC:

93D05 Lyapunov and other classical stabilities (Lagrange, Poisson, \(L^p, l^p\), etc.) in control theory
93D30 Lyapunov and storage functions
93C05 Linear systems in control theory
Full Text: DOI

References:

[1] Artstein, Zvi, Stabilization with relaxed controls, Nonlinear Analysis, Theory, Methods & Applications, 7, 11, 1163-1173 (1983) · Zbl 0525.93053
[2] Artstein, Zvi; Raković, Saša V., Feedback and invariance under uncertainty via set iterates, Automatica, 44, 2, 520-525 (2008) · Zbl 1283.93167
[3] Bitmead, R., Explicit solutions of the discrete-time Lyapunov matrix equation and Kalman-Yakubovich equations, IEEE Transactions on Automatic Control, 26, 1291-1294 (1981) · Zbl 0465.93033
[4] Blanchini, F.; Miani, S., Set-theoretic methods in control, (Systems & control: foundations & applications (2008), Birkhauser: Birkhauser Boston, Basel, Berlin) · Zbl 1140.93001
[5] Boyd, S.; El Ghaoui, L.; Feron, E.; Balakrishnan, V., Linear matrix inequalities in system and control theory, (Studies in applied mathematics (1994), SIAM) · Zbl 0816.93004
[7] Gajić, Z.; Qureshi, M. T.J., Lyapunov matrix equation in system stability and control, (Dover books on engineering (2008), Dover Publications: Dover Publications Mineola, New York), reprint of the 1995 edition, published by Academic Press, San Diego, California · Zbl 1155.93300
[8] Gurvits, L., Stability of discrete linear inclusion, Linear Algebra and its Applications, 231, 47-85 (1995) · Zbl 0845.68067
[9] Hahn, W., Stability of motions (1967), Springer: Springer Berlin · Zbl 0189.38503
[10] Kiendl, H.; Adamy, J.; Stelzner, P., Vector norms as Lyapunov functions for linear systems, IEEE Transactions on Automatic Control, 37, 6, 839-842 (1992) · Zbl 0760.93070
[11] Kolmanovsky, I. V.; Gilbert, E. G., Theory and computation of disturbance invariant sets for discrete-time linear systems, Mathematical Problems in Egineering, 4, 317-367 (1998) · Zbl 0923.93005
[12] Kolmogorov, A. N.; Fomin, S. V., Introductory real analysis (1970), Dover Publications: Dover Publications New York · Zbl 0213.07305
[14] Lu, A.; Wachspress, E. L., Solution of Lyapunov equations by alternating direction implicit iteration, Computers and Mathematics with Applications, 21, 9, 43-58 (1991) · Zbl 0724.65041
[15] Lyapunov, A. M., The general problem of the stability of motion (1992), Taylor & Francis · Zbl 0786.70001
[16] Molchanov, A. P.; Pyatnitskii, E. S., Criteria of asymptotic stability of differential and difference inclusions encountered in control theory, Systems & Control Letters, 13, 59-64 (1989) · Zbl 0684.93065
[17] Norman, C. W., Resultants and Lyapunov matrix equations, Linear Algebra and its Applications, 116, 109-120 (1989) · Zbl 0695.15007
[18] Polański, A., Further comments on vector norms as Lyapunov functions for linear systems, IEEE Transactions on Automatic Control, 43, 2, 289-291 (1998) · Zbl 0899.93036
[20] Raković, S. V.; Lazar, M., Minkowski terminal cost functions for MPC, Automatica, 48, 10, 2721-2725 (2012) · Zbl 1308.93080
[21] Rawlings, J. B.; Mayne, D. Q., Model predictive control: theory and design (2009), Nob Hill Publishing: Nob Hill Publishing Madison
[22] Rockafellar, R. T., Convex analysis (1970), Princeton University Press: Princeton University Press USA · Zbl 0229.90020
[23] Rosenbrock, H. H., A Lyapunov function with applications to some nonlinear physical systems, Automatica, 1, 31-53 (1963) · Zbl 0137.28802
[24] Schneider, R., (Convex bodies: the Brunn-Minkowski theory. Convex bodies: the Brunn-Minkowski theory, Encyclopedia of mathematics and its applications, Vol. 44 (1993), Cambridge University Press: Cambridge University Press Cambridge, England) · Zbl 0798.52001
[25] Sontag, E. D., (Mathematical control theory: deterministic finite dimensional systems. Mathematical control theory: deterministic finite dimensional systems, Textbooks in applied mathematics, Vol. 6 (1998), Springer: Springer New York) · Zbl 0945.93001
[26] Sontag, E. D.; Sussmann, H. J., General classes of control-Lyapunov functions, (Stability theory. Stability theory, International series of numerical mathematics, Vol. 121 (1996), Birkhaüser: Birkhaüser Basel, Ascona), December · Zbl 0854.93131
[27] Tian, Z.; Gu, C., A numerical algorithm for Lyapunov equations, Applied Mathematics and Computation, 202, 44-53 (2008) · Zbl 1154.65027
[28] Zhou, B., Toward solution of matrix equation \(X = A f(X) B + C\), Linear Algebra and its Applications, 435, 1370-1398 (2011) · Zbl 1278.15021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.