{"title":"正LSS的多面体关节Lyapunov函数","authors":"N. Guglielmi, L. Laglia","doi":"10.1109/CDC.2013.6759965","DOIUrl":null,"url":null,"abstract":"We consider switched linear systems of odes, ẋ x(t)= A(u(t))x(t) where A(u(t)) ∈ A, a compact set of matrices. In this paper we propose a new method for the approximation of the upper Lyapunov exponent and lower Lyapunov exponent of the LSS when the matrices in A are Metzler matrices (or the generalization of them for arbitrary cone), arising in many interesting applications (see e.g. [9]). The method is based on the iterative construction of invariant positive polytopes for a sequence of discretized systems obtained by forcing the switching instants to be multiple of Δ(k)t where Δ(k)t → 0 as k → ∞. These polytopes are then used to generate a monotone piecewise-linear joint Lyapunov function on the positive orthant, which gives tight upper and lower bounds for the Lyapunov exponents. As a byproduct we detect whether the considered system is stabilizable or uniformly stable. The efficiency of this approach is demonstrated in numerical examples, including some of relatively large dimensions.","PeriodicalId":415568,"journal":{"name":"52nd IEEE Conference on Decision and Control","volume":"1099 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Polytope joint Lyapunov functions for positive LSS\",\"authors\":\"N. Guglielmi, L. Laglia\",\"doi\":\"10.1109/CDC.2013.6759965\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider switched linear systems of odes, ẋ x(t)= A(u(t))x(t) where A(u(t)) ∈ A, a compact set of matrices. In this paper we propose a new method for the approximation of the upper Lyapunov exponent and lower Lyapunov exponent of the LSS when the matrices in A are Metzler matrices (or the generalization of them for arbitrary cone), arising in many interesting applications (see e.g. [9]). The method is based on the iterative construction of invariant positive polytopes for a sequence of discretized systems obtained by forcing the switching instants to be multiple of Δ(k)t where Δ(k)t → 0 as k → ∞. These polytopes are then used to generate a monotone piecewise-linear joint Lyapunov function on the positive orthant, which gives tight upper and lower bounds for the Lyapunov exponents. As a byproduct we detect whether the considered system is stabilizable or uniformly stable. The efficiency of this approach is demonstrated in numerical examples, including some of relatively large dimensions.\",\"PeriodicalId\":415568,\"journal\":{\"name\":\"52nd IEEE Conference on Decision and Control\",\"volume\":\"1099 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"52nd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2013.6759965\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"52nd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2013.6759965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Polytope joint Lyapunov functions for positive LSS
We consider switched linear systems of odes, ẋ x(t)= A(u(t))x(t) where A(u(t)) ∈ A, a compact set of matrices. In this paper we propose a new method for the approximation of the upper Lyapunov exponent and lower Lyapunov exponent of the LSS when the matrices in A are Metzler matrices (or the generalization of them for arbitrary cone), arising in many interesting applications (see e.g. [9]). The method is based on the iterative construction of invariant positive polytopes for a sequence of discretized systems obtained by forcing the switching instants to be multiple of Δ(k)t where Δ(k)t → 0 as k → ∞. These polytopes are then used to generate a monotone piecewise-linear joint Lyapunov function on the positive orthant, which gives tight upper and lower bounds for the Lyapunov exponents. As a byproduct we detect whether the considered system is stabilizable or uniformly stable. The efficiency of this approach is demonstrated in numerical examples, including some of relatively large dimensions.