Joel Phillips
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.
- Altan Odabasioglu, Mustafa Celik, and Lawrence Pileggi. Prima: Passive reduced-order interconnect macromodeling algorithm. In International Conference on Computer Aided-Design, pages 58--65, San Jose, California, November 1997. Google Scholar
Digital Library
- 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.Google ScholarCross Ref
- Nuno Marques, Mattan Kamon, Jacob White, and L. Miguel Silveira. A mixed nodal-mesh formulation for efficient extraction and passive reduced-order modeling of 3d interconnects. In 35th ACM/IEEE Design Automation Conference, pages 297--302, San Francisco, CA, USA, June 1998. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- Jing-Rebecca Li, F. Wang, and J. White. Efficient model reduction of interconnect via approximate system grammians. In International Conference on Computer Aided-Design, pages 380--383, SAN JOSE, CA, November 1999. Google ScholarDigital Library
- I. M. Jaimoukha and E. M. Kasenally. Krylov subspsace methods for solving large Lyapunov equations. SIAM Journal on Numerical Analysis, 31:227--251, 1994. Google ScholarDigital Library
- Carlos~P. Coelho, Joel R. Phillips, and L. Miguel Silveira. A convex programming approach to positive real rational approximation. In International Conference on Computer Aided-Design, pages 245--251, San Jose, CA, November 2001. Google ScholarDigital Library
- L. Miguel Silveira, Nuno Marques, Mattan Kamon, and Jacob White.Google Scholar
- B. D. Anderson and S. Vongpanitlerd. Network Analysis and Synthesis. Prentice-Hall, Englewood Cliffs, New Jersey, 1973.Google Scholar
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- W. F. Arnold and A. J. Laub. Generalized eigenproblem algorithms and software for algebraic Riccati equations. Proc. IEEE, 72:1746--1754, 1984.Google ScholarCross Ref
- C. Oara and A. Varga. Computation of general inner-outer and spectral factorizations. IEEE Transactions on Automatic Control, 45:2307--2325, 2000.Google ScholarCross Ref
- 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.Google ScholarCross Ref
Index Terms
- Guaranteed passive balancing transformations for model order reduction
Recommendations
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, ...
A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks
ICCAD '97: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided designRecent work in the area of model-order reduction for RLC interconnect networks has been focused on building reduced-order models that preserve the circuit-theoretic properties of the network, such as stability, passivity, and synthesizability. Passivity ...
Model Reduction of Uncertain Systems with Multiplicative Noise Based on Balancing
This paper investigates the problem of model reduction based on balancing for uncertain discrete-time systems with multiplicative noise. Such systems can be considered as linear systems with both deterministic and stochastic uncertainties. Two linear ...
Comments