Raković, Saša V.; Lazar, Mircea Corrigendum to “The Minkowski-Lyapunov equation for linear dynamics: theoretical foundations” [automatica, 50(8)(2014) 2015-2024]. (English) Zbl 1429.93271 Automatica 106, 411-412 (2019). Summary: Theorem 1 of the authors [ibid. 50, No. 8, 2015–2024 (2014; Zbl 1297.93124)] accidentally misquotes Theorem 1.7.1 of R. Schneider [Convex bodies: the Brunn-Minkowski theory. Cambridge: Cambridge University Press (1993; Zbl 0798.52001)]. This corrigendum rectifies this misquotation, and it points out that the results developed in [the authors, loc. cit.] are not affected by this misquotation. Since Theorem 1.7.1 of Schneider [loc. cit.] is utilized in two places in [the authors, loc. cit.], the corrigendum also clarifies its utilization so as to avoid any ambiguity. 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 Keywords:stability theory; Lyapunov functions; Minkowski algebra; linear dynamical systems Citations:Zbl 1297.93124; Zbl 0798.52001 PDFBibTeX XMLCite \textit{S. V. Raković} and \textit{M. Lazar}, Automatica 106, 411--412 (2019; Zbl 1429.93271) Full Text: DOI References: [1] Raković, S. V.; Lazar, M., The Minkowski-Lyapunov equation for linear dynamics: Theoretical foundations, Automatica, 50, 8, 2015-2024 (2014) · Zbl 1297.93124 [2] 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 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.