File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0167-6911(02)00279-7
- Scopus: eid_2-s2.0-0037440977
- WOS: WOS:000180617100005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: H∞ model reduction for discrete-time singular systems
Title | H∞ model reduction for discrete-time singular systems |
---|---|
Authors | |
Keywords | Discrete-Time Systems H∞ Model Reduction Linear Matrix Inequality Singular Systems |
Issue Date | 2003 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/sysconle |
Citation | Systems And Control Letters, 2003, v. 48 n. 2, p. 121-133 How to Cite? |
Abstract | This paper investigates the problem of H∞ model reduction for linear discrete-time singular systems. Without decomposing the original system matrices, necessary and sufficient conditions for the solvability of this problem are obtained in terms of linear matrix inequalities (LMIs) and a coupling non-convex rank constraint set. When these conditions are feasible, an explicit parametrization of the desired reduced-order models is given. Particularly, a simple LMI condition without rank constraint is derived for the zeroth-order H∞ approximation problem. Finally, an illustrative example is provided to demonstrate the applicability of the proposed approach. © 2002 Elsevier Science B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/156663 |
ISSN | 2023 Impact Factor: 2.1 2023 SCImago Journal Rankings: 1.503 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xu, S | en_US |
dc.contributor.author | Lam, J | en_US |
dc.date.accessioned | 2012-08-08T08:43:26Z | - |
dc.date.available | 2012-08-08T08:43:26Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Systems And Control Letters, 2003, v. 48 n. 2, p. 121-133 | en_US |
dc.identifier.issn | 0167-6911 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/156663 | - |
dc.description.abstract | This paper investigates the problem of H∞ model reduction for linear discrete-time singular systems. Without decomposing the original system matrices, necessary and sufficient conditions for the solvability of this problem are obtained in terms of linear matrix inequalities (LMIs) and a coupling non-convex rank constraint set. When these conditions are feasible, an explicit parametrization of the desired reduced-order models is given. Particularly, a simple LMI condition without rank constraint is derived for the zeroth-order H∞ approximation problem. Finally, an illustrative example is provided to demonstrate the applicability of the proposed approach. © 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/sysconle | en_US |
dc.relation.ispartof | Systems and Control Letters | en_US |
dc.subject | Discrete-Time Systems | en_US |
dc.subject | H∞ Model Reduction | en_US |
dc.subject | Linear Matrix Inequality | en_US |
dc.subject | Singular Systems | en_US |
dc.title | H∞ model reduction for discrete-time singular systems | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lam, J:james.lam@hku.hk | en_US |
dc.identifier.authority | Lam, J=rp00133 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S0167-6911(02)00279-7 | en_US |
dc.identifier.scopus | eid_2-s2.0-0037440977 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0037440977&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 48 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.spage | 121 | en_US |
dc.identifier.epage | 133 | en_US |
dc.identifier.isi | WOS:000180617100005 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Xu, S=7404438591 | en_US |
dc.identifier.scopusauthorid | Lam, J=7201973414 | en_US |
dc.identifier.issnl | 0167-6911 | - |