A Moment-Matching Scheme for the Passivity-Preserving Model Order Reduction of Indefinite Descriptor Systems with Possible Polynomial Parts
Author(s)Zhang, Zheng; Wang, Qing; Wong, Ngai; Daniel, Luca
MetadataShow full item record
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 MOR for 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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)
Institute of Electrical and Electronics Engineers (IEEE)
Zhang, Zheng, Qing Wang, Ngai Wong, and Luca Daniel. “A Moment-Matching Scheme for the Passivity-Preserving Model Order Reduction of Indefinite Descriptor Systems with Possible Polynomial Parts.” 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011) (January 2011).
Author's final manuscript