Guaranteed passive balancing transformations for model order reduction

The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the models, and preservation of system properties such as passivity. Algorithms such as PRIMA generate guaranteed-passive models, for systems with special internal structure, using numerically stable and efficient Krylov-subspace iterations. Truncated Balanced Realization (TBR) algorithms, as used to date in the design automation community, can achieve smaller models with better error control, but do not necessarily preserve passivity. In this paper we show how to construct TBR-like methods that guarantee passive reduced models and in addition are applicable to state-space systems with arbitrary internal structure. Categories & Subject Descriptors: B.7.2 Simulation, B.8.2 Performance Analysis & Design Aids, I.6 Simulation & Modeling. General Terms: Algorithms, Performance, Design,

• Type: Conference
• Year: 2002
• Where: DAC
• Authors: Joel R. Phillips, Luca Daniel, Luis Miguel Silveira
• Keywords: Arbitrary Internal Structure, DAC 2002, Design Automation, Model Reduction Algorithms, Passive Reduced Models