H∞ Norm Computation for Descriptor Symmetric Systems
MetadataShow full item record
Copyright © 2009 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
This paper deals with the problem of H∞ norm computation for general symmetric systems and descriptor symmetric systems. The computation of H∞ norm for state-space symmetric systems is extended to descriptor symmetric systems. An explicit expression is given based on the bound real lemma (BRL), and the generalized bound real lemma (GBRL). The results have obvious computational advantages, especially for large scale descriptor symmetric systems. Additionally, two numerical examples are presented to demonstrate the feasibility and effectiveness of the results.
Showing items related by title, author, creator and subject.
Xing, W.; Yan, W.; Liu, Wan-quan (2009)In this paper, the rank stability radius problem is proposed for a real matrix under structured scalar perturbations and some interesting results are achieved based on polynomial analysis. In addition, a computable formula ...
Xu, Honglei (2009)Switched systems belong to a special class of hybrid systems, which consist of a collection of subsystems described by continuous dynamics together with a switching rule that specifies the switching between the subsystems. ...
Ferrante, A.; Ntogramatzidis, Lorenzo (2017)Passivity theory and the positive real lemma have been recognised as two of the cornerstones of modern systems and control theory. As digital control is pervasive in virtually all control applications, developing a general ...