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...

Full description

Saved in:
Bibliographic Details
Published inAnnual ACM IEEE Design Automation Conference: Proceedings of the 39th conference on Design automation : New Orleans, Louisiana, USA; 10-14 June 2002 pp. 52 - 57
Main Authors Phillips, Joel, Daniel, Luca, Silveira, L. Miguel
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 10.06.2002
SeriesACM Conferences
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1581134614
9781581134612
ISSN:0738-100X
DOI:10.1145/513918.513933