LMI approach to linear positive system analysis and synthesis

This paper is concerned with the analysis and synthesis of linear positive systems based on linear matrix inequalities (LMIs). We first show that the celebrated Perron–Frobenius theorem can be proved concisely by a duality-based argument. Again by duality, we next clarify a necessary and sufficient...

Full description

Saved in:
Bibliographic Details
Published in:Systems & control letters Vol. 63; pp. 50 - 56
Main Authors: Ebihara, Yoshio, Peaucelle, Dimitri, Arzelier, Denis
Format: Journal Article
Language:English
Published: Elsevier B.V 01.01.2014
Elsevier
Subjects:
ISSN:0167-6911, 1872-7956
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper is concerned with the analysis and synthesis of linear positive systems based on linear matrix inequalities (LMIs). We first show that the celebrated Perron–Frobenius theorem can be proved concisely by a duality-based argument. Again by duality, we next clarify a necessary and sufficient condition under which a Hurwitz stable Metzler matrix admits a diagonal Lyapunov matrix with some identical diagonal entries as the solution of the Lyapunov inequality. This new result leads to an alternative proof of the recent result by Tanaka and Langbort on the existence of a diagonal Lyapunov matrix for the LMI characterizing the H∞ performance of continuous-time positive systems. In addition, we further derive a new LMI for the H∞ performance analysis where the variable corresponding to the Lyapunov matrix is allowed to be non-symmetric. We readily extend these results to discrete-time positive systems and derive new LMIs for the H∞ performance analysis and synthesis. We finally illustrate their effectiveness by numerical examples on robust state-feedback H∞ controller synthesis for discrete-time positive systems affected by parametric uncertainties.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0167-6911
1872-7956
DOI:10.1016/j.sysconle.2013.11.001