Algorithms for model reduction of large dynamical systems

作者: Thilo Penzl

DOI: 10.1016/J.LAA.2006.01.007

关键词:

摘要: Three algorithms for the model reduction of large-scale, continuous-time, time-invariant, linear, dynamical systems with a sparse or structured transition matrix and small number inputs outputs are described. They rely on low rank approximations to controllability observability Gramians, which can efficiently be computed by ADI based iterative methods. The first two methods closely related well-known square root method Schur method, balanced truncation techniques. third is heuristic, balancing-free technique. performance studied in numerical experiments.

参考文章(49)
Elizabeth Cuthill, Several Strategies for Reducing the Bandwidth of Matrices Springer, Boston, MA. pp. 157- 166 ,(1972) , 10.1007/978-1-4615-8675-3_14
A. C. M. Ran, M. A. Kaashoek, J. H. van Schuppen, Signal processing, scattering and operator theory, and numerical methods Birkhäuser. ,(1990)
M. Huhtanen, Iterative Model Reduction of Large State-Space Systems International Journal of Applied Mathematics and Computer Science. ,vol. 9, pp. 245- 263 ,(1999)
Franklin F. Kuo, Network Analysis and Synthesis ,(1962)
Sparse matrices and their applications International Business Machines Corporation. ,(1972) , 10.1007/978-1-4615-8675-3
L. Rodman, Peter Lancaster, Algebraic Riccati equations ,(1995)