Model-order reduction by dominant subspace projection: Error bound, subspace computation, and circuit applications

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 52, Issue 5, 2005, Pages 975-993

  Shi, Guoyong ^a   Shi, C J Richard ^a  

^a University of Washington   (United States)

Author keywords

Circuit simulation; Dominant subspace; Error bound; Krylov subspace; Model order reduction; Moment matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ERROR ANALYSIS; FREQUENCY DOMAIN ANALYSIS; HEURISTIC METHODS; INTEGRAL EQUATIONS; LYAPUNOV METHODS; MATHEMATICAL MODELS; TIME DOMAIN ANALYSIS;

CIRCUIT SIMULATION; DOMINANT SUBSPACE; ERROR BOUND; KRYLOV SUBSPACE; MODEL ORDER REDUCTION; MOMENT MATCHING;

VLSI CIRCUITS;

EID: 20144370997     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2005.846217     Document Type: Article

References (36)

1. A. Antoulas, D. Sorensen, and S. Gugercin, "A survey of model reduction methods for large-scale systems," in Structured Matrix in Operator Theory, Numerical Analysis, Control, Signal, and Image Processing. Providence, RI: AMS Pub., 2001.
2. Z. Bai, "Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems," Appl. Numer. Math., vol. 43, pp. 9-44, 2002.
3. S. Gugercin and A. Antoulas, "A comparative study of 7 algorithms for model reduction," in Proc. 39th IEEE Conf. on Decision and Control, Sydney, NSW, Australia, 2000, pp. 2367-2372.
4. B. Moore, "Principal component analysis in linear systems: Controllability, observability, and model reduction," IEEE Trans. Autom. Contr., vol. AC-26, no. 1, pp. 17-32, Feb. 1981.
5. K. Glover, "All optimal Hankel-norm approximations of linear multivariable systems and their L∞ error bounds," Int. J. Contr., vol. 39, no. 6, pp. 1115-1193, 1984.
6. M. Safonov and R. Chiang, "A Schur method for balanced-truncation model reduction," IEEE Trans. Autom. Contr., vol. AC-34, no. 7, pp. 729-733, July 1989.
7. C. Villemagne and R. Skelton, "Model reduction using a projection formulation," Int. J. Control, vol. 46, pp. 2141-2169, 1987.
8. L. Pillage and R. Rohrer, "Asymptotic waveform evaluation for timing analysis," IEEE Trans. Computer-Aided Design, vol. 9, no. 4, pp. 352-366, Apr. 1990.
9. P. Feldmann and R. Freund, "Efficient linear circuit analysis by Padé approximation via the Lanczos process," IEEE Trans. Computer-Aided Design, vol. 14, no. 5, pp. 639-649, May 1995.
10. A. Odabasioglu, M. Celik, and L. Pileggi, "PRIMA: Passive reduced-order interconnect macromodeling algorithm," IEEE Trans. Computer-Aided Design, vol. 17, no. 8, pp. 645-554, Aug. 1998.
11. E. Grimme, D. Sorensen, and P. Dooren, "Model reduction of state space systems via an implicitly restarted Lanczos method," Numer. Algor., vol. 12, pp. 1-31, 1996.
12. K. Gallivan and E. Grimme, "A rational Lanczos algorithm for model reduction," Numer. Algor., vol. 12, pp. 33-63, 1996.
13. I. Jalmoukha and E. Kasenally, "Implicitly restarted Krylov subspace methods for stable partial realizations," SIAM J. Matrix Anal. Appl., vol. 18, no. 3, pp. 633-652, 1997.
14. V. Balakrishnan, Q. Su, and C.-K. Koh, "Efficient balance-and-truncate model reduction for large-scale systems," in Proc. 2001 IEEE American Control Conf., Arlington, VA, 2001, pp. 4746-4751.
15. T. Gudmundsson and A. Laub, "Approximate solution of large spase Lyapunov equations," IEEE Trans. Autom. Contr., vol. 39, no. 5, pp. 1110-1114, Oct. 1994.
16. J.-R. Li, F. Wang, and J. White, "An efficient Lyapunov equation-based approach for generating reduced-order models of interconnect," in Proc. 36th ACM/IEEE Design Automation Conf., New Orleans, LA, 1999.
17. P. Rabiei and M. Pedram, "Model-order reduction of large circuits using balanced truncation" in Proc. IEEE Asia South Pacific Design Automation Conf. (ASPDAC), Feb. 1999, pp. 237-240.
18. S. Lall, J. Marsden, and S. Glavaski, "A subspace approach to balanced truncation for model reduction of nonlinear control systems," Int. J. Robust Nonlinear Contr., vol. 12, no. 5, pp. 519-535, 2002.
19. A. Hodel and K. Poolla, "Heuristic approaches to the solution of very large sparse Lyapunov and algebraic Riccati equations," in Proc. 27th IEEE Conf. Decision and Control, Austin, TX, 1988, pp. 2217-2222.
20. Y. Saad, "Numerical solution of large Lyapunov equations," in Signal Processing, Scattering, Operator Theory, and Numerical Methods, M. Kaashoek, J. Schuppen, and A. Ran, Eds. Boston, MA, 1990, pp. 503-511.
21. I. Jaimoukha and E. Kasenally, "Krylov subspace methods for solving large Lyapunov equations," SIAM J. Numer. Anal., vol. 31, no. 1, pp. 227-251, 1994.
22. A. Hodel, B. Tenison, and K. Poolla, "Numerical solution of the Lyapunov equation by approximate power iteration," Linear Algebra Appl., vol. 236, pp. 205-230, 1996.
23. T. Penzl, "A cyclic low-rank Smith method for large sparse Lyapunov equations," SIAM J. Sci. Comput., vol. 21, no. 4, pp. 1401-1418, 2000.
24. J.-R. Li and J. White, "Low rank solution of Lyapunov equations," SIAM J. Matrix Anal. Appl., vol. 24, no. 1, pp. 260-280, 2002.
25. V. Klema and A. Laub, "The singular value decomposition: Its computation and some applications," IEEE Trans. Autom. Contr., vol. AC-25, no. 2, pp. 164-176, Apr. 1980.
26. D. Boley and G. Golub, "The Lanczos-Arnoldi algoithm and controllability," Syst. Contr. Lett., vol. 4, pp. 317-324, 1984.
27. K. Zhou, Essentials of Robust Control. Upper Saddle River, NJ: Prentice-Hall, 1998.
28. Z. Bai, R. Slone, W. Smith, and Q. Ye, "Error bound for reduced system model by Padé approximation via the Lanczos process," IEEE Trans. Computer-Aided Design, vol. 18, no. 2, pp. 133-141, Feb. 1995.
29. E. Grimme, "Krylov Projection methods for model reduction," Ph.D. thesis, ECE Dept., Univ. of Illinoise at Urbana-Champaign, 1997.
30. A. Lu and E. Wachspress, "Solution of Lyapunov equations by ADI iteration," Comp. Math. Appl., vol. 21, no. 9, pp. 43-58, 1991.
31. A. Greenbaum, Iterative Methods for Solving Linear Systems. Philadelphia, PA: SIAM, 1997.
32. R. Smith, "Matrix equation XA + BX = C," SIAM J. Appl. Math., vol. 16, pp. 198-201, 1968.
33. E. Chiprout and M. Nakhla, "Analysis of interconnect networks using complex frequency hopping (CFH)," IEEE Trans. Computer-Aided Design, vol. 14, no. 2, pp. 186-200, Feb. 1995.
34. A. Varga, "Model reduction software in the SLICOT library," in Proc. IEEE Int. Symp. on Computer Aided Control System Design (CACSD), Anchorage, AK, 2000, pp. 183-198.
35. C.-W. Ho, A. E. Ruehli, and P. A. Brennan, "The modified nodal approach to network analysis," IEEE Trans. Circuits Syst., vol. CAS-22, no. 6, pp. 504-509, 1975.
36. R. Bartels and G. Stewart, "Algorithm 432: Solution of the matrix equation AX + XB = C," Commun. ACM, vol. 15, pp. 820-826, 1972.