Fast balanced stochastic truncation via a quadratic extension of the alternating direction implicit iteration

Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT procedure that provides a general, structure-independent MOR framework to preserve both passivity and stability of original models. Its application toward large scale systems, however, has been limited by the complexity of solving large size continuous time algebraic Riccati equations (CAREs). This paper introduces a novel quadratic extension of the alternating direction implicit (ADI) iteration, called QADI, that efficiently solves a CARE. A Cholesky factor variant of QADI, called CFQADI, further exploits low rank matrices and and produces solution in factor form that greatly accelerates BST. Remarkable efficiency of the proposed BST/(CF)QADI integration is demonstrated with numerical examples.

[1]  Zhaojun Bai,et al.  Reduced-Order Modeling , 2005 .

[2]  J. Doyle,et al.  Robust and optimal control , 1995, Proceedings of 35th IEEE Conference on Decision and Control.

[3]  Thilo Penzl,et al.  A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations , 1998, SIAM J. Sci. Comput..

[4]  A. Laub,et al.  Generalized eigenproblem algorithms and software for algebraic Riccati equations , 1984, Proceedings of the IEEE.

[5]  Kishore Singhal,et al.  Computer Methods for Circuit Analysis and Design , 1983 .

[6]  Lawrence T. Pileggi,et al.  PRIMA: passive reduced-order interconnect macromodeling algorithm , 1998, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[7]  K. Glover All optimal Hankel-norm approximations of linear multivariable systems and their L, ∞ -error bounds† , 1984 .

[8]  Andrew T. Yang,et al.  Stable and efficient reduction of large, multiport RC networks by pole analysis via congruence transformations , 1996, DAC '96.

[9]  Xin Chen,et al.  Positive realness preserving model reduction with H/sub /spl infin norm error bounds , 1995 .

[10]  Tung-Sang Ng,et al.  A fast Newton/Smith algorithm for solving algebraic Riccati equations and its application in model order reduction , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[11]  Sabine Van Huffel,et al.  SLICOT—A Subroutine Library in Systems and Control Theory , 1999 .

[12]  Michael Green,et al.  Balanced stochastic realizations , 1988 .

[13]  Roland W. Freund,et al.  Efficient linear circuit analysis by Pade´ approximation via the Lanczos process , 1994, EURO-DAC '94.

[14]  John T. Wen,et al.  Positive realness preserving model reduction with Hα norm error bounds , 1995 .

[15]  Jacob K. White,et al.  Low-Rank Solution of Lyapunov Equations , 2004, SIAM Rev..

[16]  Venkataramanan Balakrishnan,et al.  Efficient balance-and-truncate model reduction for large scale systems , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[17]  Eugene L. Wachspress,et al.  Solution of lyapunov equations by alternating direction implicit iteration , 1991 .

[18]  Cheng-Kok Koh,et al.  Passivity-preserving model reduction via a computationally efficient project-and-balance scheme , 2004, Proceedings. 41st Design Automation Conference, 2004..

[19]  Cheng-Kok Koh,et al.  Efficient approximate balanced truncation of general large-scale RLC systems via Krylov methods , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[20]  V. Mehrmann The Autonomous Linear Quadratic Control Problem: Theory and Numerical Solution , 1991 .

[21]  Lawrence T. Pileggi,et al.  PRIMA: passive reduced-order interconnect macromodeling algorithm , 1997, ICCAD 1997.

[22]  V. Mehrmann The Autonomous Linear Quadratic Control Problem , 1991 .

[23]  Luís Miguel Silveira,et al.  Guaranteed passive balancing transformations for model order reduction , 2002, DAC '02.