File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: A moment-matching scheme for the passivity-preserving model order reduction of indefinite descriptor systems with possible polynomial parts
  • Basic View
  • Metadata View
  • XML View
TitleA moment-matching scheme for the passivity-preserving model order reduction of indefinite descriptor systems with possible polynomial parts
 
AuthorsZhang, Z1
Wang, Q2
Wong, N2
Daniel, L1
 
KeywordsBalanced truncation
Descriptor systems
Generalized algebraic riccati equations
Model order reduction
Moment-matching
 
Issue Date2011
 
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000194
 
CitationThe 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 49-54, paper 1C-1 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ASPDAC.2011.5722240
 
AbstractPassivity-preserving model order reduction (MOR) of descriptor systems (DSs) is highly desired in the simulation of VLSI interconnects and on-chip passives. One popular method is PRIMA, a Krylov-subspace projection approach which preserves the passivity of positive semidefinite (PSD) structured DSs. However, system passivity is not guaranteed by PRIMA when the system is indefinite. Furthermore, the possible polynomial parts of singular systems are normally not captured. For indefinite DSs, positive-real balanced truncation (PRBT) can generate passive reduced-order models (ROMs), whose main bottleneck lies in solving the dual expensive generalized algebraic Riccati equations (GAREs). This paper presents a novel moment-matching MORfor indefinite DSs, which preserves both the system passivity and, if present, also the improper polynomial part. This method only requires solving one GARE, therefore it is cheaper than existing PRBT schemes. On the other hand, the proposed algorithm is capable of preserving the passivity of indefinite DSs, which is not guaranteed by traditional moment-matching MORs. Examples are finally presented showing that our method is superior to PRIMA in terms of accuracy. ©2011 IEEE.
 
ISBN978-1-4244-7516-2
 
DOIhttp://dx.doi.org/10.1109/ASPDAC.2011.5722240
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorZhang, Z
 
dc.contributor.authorWang, Q
 
dc.contributor.authorWong, N
 
dc.contributor.authorDaniel, L
 
dc.date.accessioned2011-09-23T06:08:48Z
 
dc.date.available2011-09-23T06:08:48Z
 
dc.date.issued2011
 
dc.description.abstractPassivity-preserving model order reduction (MOR) of descriptor systems (DSs) is highly desired in the simulation of VLSI interconnects and on-chip passives. One popular method is PRIMA, a Krylov-subspace projection approach which preserves the passivity of positive semidefinite (PSD) structured DSs. However, system passivity is not guaranteed by PRIMA when the system is indefinite. Furthermore, the possible polynomial parts of singular systems are normally not captured. For indefinite DSs, positive-real balanced truncation (PRBT) can generate passive reduced-order models (ROMs), whose main bottleneck lies in solving the dual expensive generalized algebraic Riccati equations (GAREs). This paper presents a novel moment-matching MORfor indefinite DSs, which preserves both the system passivity and, if present, also the improper polynomial part. This method only requires solving one GARE, therefore it is cheaper than existing PRBT schemes. On the other hand, the proposed algorithm is capable of preserving the passivity of indefinite DSs, which is not guaranteed by traditional moment-matching MORs. Examples are finally presented showing that our method is superior to PRIMA in terms of accuracy. ©2011 IEEE.
 
dc.description.naturepublished_or_final_version
 
dc.description.otherThe 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 49-54, paper 1C-1
 
dc.identifier.citationThe 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 49-54, paper 1C-1 [How to Cite?]
DOI: http://dx.doi.org/10.1109/ASPDAC.2011.5722240
 
dc.identifier.doihttp://dx.doi.org/10.1109/ASPDAC.2011.5722240
 
dc.identifier.epage54
 
dc.identifier.hkuros192306
 
dc.identifier.isbn978-1-4244-7516-2
 
dc.identifier.scopuseid_2-s2.0-79952961899
 
dc.identifier.spage49
 
dc.identifier.urihttp://hdl.handle.net/10722/140206
 
dc.languageeng
 
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000194
 
dc.publisher.placeUnited States
 
dc.relation.ispartofAsia and South Pacific Design Automation Conference Proceedings
 
dc.relation.referencesReferences in Scopus
 
dc.rightsAsia and South Pacific Design Automation Conference Proceedings. Copyright © IEEE.
 
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
 
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
 
dc.subjectBalanced truncation
 
dc.subjectDescriptor systems
 
dc.subjectGeneralized algebraic riccati equations
 
dc.subjectModel order reduction
 
dc.subjectMoment-matching
 
dc.titleA moment-matching scheme for the passivity-preserving model order reduction of indefinite descriptor systems with possible polynomial parts
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Zhang, Z</contributor.author>
<contributor.author>Wang, Q</contributor.author>
<contributor.author>Wong, N</contributor.author>
<contributor.author>Daniel, L</contributor.author>
<date.accessioned>2011-09-23T06:08:48Z</date.accessioned>
<date.available>2011-09-23T06:08:48Z</date.available>
<date.issued>2011</date.issued>
<identifier.citation>The 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 49-54, paper 1C-1</identifier.citation>
<identifier.isbn>978-1-4244-7516-2</identifier.isbn>
<identifier.uri>http://hdl.handle.net/10722/140206</identifier.uri>
<description.abstract>Passivity-preserving model order reduction (MOR) of descriptor systems (DSs) is highly desired in the simulation of VLSI interconnects and on-chip passives. One popular method is PRIMA, a Krylov-subspace projection approach which preserves the passivity of positive semidefinite (PSD) structured DSs. However, system passivity is not guaranteed by PRIMA when the system is indefinite. Furthermore, the possible polynomial parts of singular systems are normally not captured. For indefinite DSs, positive-real balanced truncation (PRBT) can generate passive reduced-order models (ROMs), whose main bottleneck lies in solving the dual expensive generalized algebraic Riccati equations (GAREs). This paper presents a novel moment-matching MORfor indefinite DSs, which preserves both the system passivity and, if present, also the improper polynomial part. This method only requires solving one GARE, therefore it is cheaper than existing PRBT schemes. On the other hand, the proposed algorithm is capable of preserving the passivity of indefinite DSs, which is not guaranteed by traditional moment-matching MORs. Examples are finally presented showing that our method is superior to PRIMA in terms of accuracy. &#169;2011 IEEE.</description.abstract>
<language>eng</language>
<publisher>IEEE. The Journal&apos;s web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000194</publisher>
<relation.ispartof>Asia and South Pacific Design Automation Conference Proceedings</relation.ispartof>
<rights>Asia and South Pacific Design Automation Conference Proceedings. Copyright &#169; IEEE.</rights>
<rights>&#169;2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<subject>Balanced truncation</subject>
<subject>Descriptor systems</subject>
<subject>Generalized algebraic riccati equations</subject>
<subject>Model order reduction</subject>
<subject>Moment-matching</subject>
<title>A moment-matching scheme for the passivity-preserving model order reduction of indefinite descriptor systems with possible polynomial parts</title>
<type>Conference_Paper</type>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/ASPDAC.2011.5722240</identifier.doi>
<identifier.scopus>eid_2-s2.0-79952961899</identifier.scopus>
<identifier.hkuros>192306</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-79952961899&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.spage>49</identifier.spage>
<identifier.epage>54</identifier.epage>
<publisher.place>United States</publisher.place>
<description.other>The 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011), Yokohama, Japan, 25-28 January 2011. In Proceedings of the 16th ASP-DAC, 2011, p. 49-54, paper 1C-1</description.other>
<bitstream.url>http://hub.hku.hk/bitstream/10722/140206/1/Content.pdf</bitstream.url>
</item>
Author Affiliations
  1. Massachusetts Institute of Technology
  2. The University of Hong Kong