ACM Home Page
Please provide us with feedback. Feedback
Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods
Full text Publisher SitePublisher Site PdfPdf (209 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2002 Asia and South Pacific Design Automation Conference table of contents
Page: 311  
Year of Publication: 2002
ISBN:0-7695-1441-3
Authors
Q. Su  School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
V. Balakrishnan  School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
C-K. Koh  School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 12,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

We present an efficient implementation of an approximate balanced truncation model reduction technique for general large-scale RLC systems, described by a state-space model where the "C" matrix in the time-domain modified nodal analysis (MNA) circuit equation "C\dot{x}=-Gx+Bu" is not necessarily invertible. The large sizes of the models that we consider make most implementations of the balance-and-truncate method impractical from the points of view of computational load and numerical conditioning. This motivates our use of Krylov subspace methods to directly compute approximate low-rank square roots of the Gramians of the original system. The approximate low-order general balanced and truncated model can then be constructed directly from these square roots. We demonstrate using three practical circuit examples that our new approach effectively gives approximate balanced and reduced order coordinates with little truncation error.


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
[1] X. Huang. Padé Approximation of Linear(ized) Circuit Responses. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1990.
 
2
[2] L. T. Pillage and R. A. Rohrer. Asymptotic wave-form evaluation for timing analysis. IEEE Trans. Computer-Aided Design, 9:352-366, 1990.
 
3
[3] P. Feldmann and R. W. Freund. Efficient linear circuit analysis by Padé approximation via the Lanczos process. IEEE Trans. Computer-Aided Design, 14:639-649, May 1995.
 
4
[4] E. Grimme and K. Gallivan. Approximate solves in Krylov-based modeling methods. In Proc. IEEE Conf. on Decision and Control, pages 3849-3854, December 1997.
 
5
[5] A. Odabasioglu, M. Celik, and L. T. Pileggi. PRIMA: Passive reduced-order interconnect macromodeling algorithm. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 17(8):645-654, 1998.
 
6
 
7
[7] K. Glover. All optimal Hankel-norm approximations of linear multivariable systems and their L¿- error bound s. Int. J. Control, 39(6):1115-1193, 1984.
 
8
[8] R. A. Smith. Matrix equation XA+BX =C. SIAM Journal on Applied Mathematics, 16(1):198-201, 1968.
 
9
[9] A. Lu and E. L. Wachspress. Solution of Lyapunov equations by alternating direction implicit iteration. Computers Math. Appl., 21(9):43-58, 1991.
 
10
[10] G. Golub and C. Van Loan. Matrix Computations. John Hopkin Univ. Press, Baltimore, second edition, 1989.
11
 
12
 
13
[13] C. S. Hsu, U. B. Desai, and R. J. Darden. Reduction of large-scale systems via generalized gramians. In Proc. IEEE Conf. on Decision and Control, pages 1409-1410, 1983.
 
14
[14] V. Balakrishnan, Q. Su, and C-K. Koh. Efficient balance-and-truncate model reduction for large scale systems. In Proc. American Control Conf., pages 4746-4751, Arlington, VA, June 2001.


Collaborative Colleagues:
Q. Su: colleagues
V. Balakrishnan: colleagues
C-K. Koh: colleagues

Peer to Peer - Readers of this Article have also read: