ACM Home Page
Please provide us with feedback. Feedback
Guaranteed passive balancing transformations for model order reduction
Full text PdfPdf (248 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: Passive model order reduction table of contents
Pages: 52 - 57  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Joel Phillips  Cadence Design Systems, San Jose
Luca Daniel  University of California Berkeley, Berkeley, CA
L. Miguel Silveira  Tech. U. Lisbon, Portugal
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 28,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513918.513933
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Mattan Kamon, Frank Wang, and Jacob White. Generating nearly optimally compact models from krylov-subspace based reduced-order models. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 47(4):239--248, April 2000.
3
 
4
Bruce Moore. Principal Component Analysis in Linear Systems: Controllability, Observability, and Model Reduction. IEEE Transactions on Automatic Control, AC 26(1):17--32, February 1981.
 
5
Keith Glover. All optimal Hankel-norm approximations of linear multivariable systems and their L∞-error bounds. International Journal on Control, 39(6):1115--1193, June 1984.
 
6
 
7
 
8
 
9
L. Miguel Silveira, Nuno Marques, Mattan Kamon, and Jacob White.
 
10
B. D. Anderson and S. Vongpanitlerd. Network Analysis and Synthesis. Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
 
11
A. J. Laub, M. T. Heath, C. C. Paige, and R. C. Ward. Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms. IEEE Transactions on Automatic Control, 32:115--122, 1987.
 
12
X. Chen and J. T. Wen. Positive realness preserving model reduction with h∞ norm error bounds. IEEE Transactions on Circuits and Systems I, 42:23--29, 1995.
 
13
W. F. Arnold and A. J. Laub. Generalized eigenproblem algorithms and software for algebraic Riccati equations. Proc. IEEE, 72:1746--1754, 1984.
 
14
C. Oara and A. Varga. Computation of general inner-outer and spectral factorizations. IEEE Transactions on Automatic Control, 45:2307--2325, 2000.
 
15
Y. Liu and B.D.O Anderson. Singular perturbation approximation of balanced systems. In Proceedings of the 28th IEEE Conference on Decision and Control, pages 1355--1360, 1989.


Collaborative Colleagues:
Joel Phillips: colleagues
Luca Daniel: colleagues
L. Miguel Silveira: colleagues