Cross-gramian based model reduction for datasparse systems

Electronic Transactions on Numerical Analysis

Volumn 31, Issue , 2008, Pages 256-270

  Baurt, Ulrike ^a   Benner, Peter ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Balanced truncation; CrossGramian; Hierarchical matrices; Model reduction; Sign function method

Indexed keywords

APPROXIMATION ALGORITHMS; BOUNDARY ELEMENT METHOD; DYNAMICAL SYSTEMS; HIERARCHICAL SYSTEMS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; SAILING VESSELS;

BALANCED TRUNCATION; CROSSGRAMIAN; HIERARCHICAL MATRICES; MODEL REDUCTION; SIGN FUNCTION;

ITERATIVE METHODS;

EID: 70349741655     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. R. Aldhaheri, Model order reduction via real Schur-form decomposition, Internat. J. Control, 53(1991),pp. 709-716.
2. A. Antoulas, Approximation of Large-Scale Dynamical Systems, SIAM, Philadelphia, 2005.
3. A. Antoulas, D. Sorensen, and S. Gugercin, A survey of model reduction methods for large-scale systems, Contemp. Math., 280(2001),pp. 193-219.
4. A. Antoulas, D. Sorensen, and Y. Zhou, On the decay rate of Hankel singular values and related issues, Systems Control Lett., 46(2002),pp. 323-342.
5. U. Baur, Low rank solution of data-sparse Sylvester equations, Numer. Linear Alg. Appl., 15(2008),pp. 837-851.
6. U. Baur and P. Benner, Gramian-based model reduction for data-sparse systems, SIAM J. Sci. Comput., 31(2008),pp. 776-798.
7. P. Benner, Factorized solution of Sylvester equations with applications in control, in B. De Moor, B. Motmans, J. Willems, P. Van Dooren, V. Blondel, eds., Proc. Sixteenth Intl. Symp. Math. Theory Networks and Syst. MTNS 2004, Leuven, Belgium, July 5-9, 2004. Available at http://www.mtns2004.be.
8. P. Benner, R. Li, and N. Truhar, On the ADI method for Sylvester equations. Submitted, 2008.
9. P. Benner, V. Mehrmann, V. Sima, S. V. Huffel, and A. Varga, SLICOT a subroutine library in systems and control theory, in Applied and Computational Control, Signals, and Circuits, B. Datta, ed., vol.1, Birkhauser, Boston, MA, 1999,ch. 10,pp. 499539.
10. P. Benner, V. Mehrmann, and D. Sorensen, eds., Dimension Reduction of LargeScale Systems, vol.45 of Lecture Notes in Computational Science and Engineering, Springer, Berlin and Heidelberg, 2005.
11. P. Benner and E. Quintanaorti, Model reduction based on spectral projection methods. Chapter 1 (pages 548) of [10].
12. P. Benner, E. Quintana-Ortí, and G. Quintana-Ortí, Solving stable Sylvester equations via rational iterative schemes, J. Sci. Comput., 28(2006),pp. 51-83.
13. C. Bischof and G. Quintana-Ortí, Algorithm 782: codes for rank-revealing QR factorizations of dense matrices, ACM Trans. Math. Software, 24 (1998), pp. 254-257.
14. S. Börm, L. Grasedyck, and W. Hackbusch, Introduction to hierarchical matrices with applications, Engineering Analysis with Boundary Elements, 27 (2003), pp. 405-422.
15. S. Börm, L. Grasedyck, and W. Hackbusch, HLib 1.3, 2004. Available at http://www.hlib.org.
16. K. Fernando and H. Nicholson, On the structure of balanced and other principal representations of SISO systems, IEEE Trans. Automat. Control, 28(1983),pp. 228-231.
17. On a fundamental property of the cross-Gramian matrix, IEEE Trans. Circuits Syst., CAS-31 (1984),pp. 504-505.
18. K. Gallivan, A. Vandendorpe, and P. Van Dooren, Sylvester equations and projectionbased model reduction, J. Comput. Appl. Math., 162(2004),pp.213-229.
19. ∞ norms, Internat. J. Control, 39(1984),pp.1115-1193.
20. L. Grasedyck, Theorie und Anwendungen Hierarchischer Matrizen, Dissertation, University ofKiel, Germany, 2001.
21. L. Grasedyck, Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation, Numer. Linear Alg. Appl., 11(2004),pp.371-389.
22. L. Grasedyck and W. Hackbusch, Construction and arithmetics of H-matrices, Computing, 70(2003),pp. 295-334.
23. W. Hackbusch, A sparse matrix arithmetic based on Hmatrices. I. Introduction to Hmatrices, Computing, 62(1999),pp. 89108.
24. W. Hackbusch and B. N. Khoromskij, A sparse Hmatrix arithmetic. II. Application to multidimensional problems, Computing, 64(2000),pp. 2147.
25. HAPACK. Available at http://www.tu-chemnitz.de/mathematik/hapack/.
26. HAPACK. Available at http://www.tu-chemnitz.de/mathematik/hapack/.
27. D. Kressner, Numerical Methods for General and Structured Eigenvalue Problems, vol. 46 of Lecture Notes in Computational Science and Engineering, Springer, Berlin and Heidelberg, 2005.
28. P. Lancaster and L. Rodman, The Algebraic Riccati Equation, Oxford University Press, Oxford, 1995.
29. A. Laub, L. Silverman, and M. Verma, A note on crossGrammians for symmetric realizations, Proceedings of the IEEE Trans. Circuits Syst., 71(1983),pp. 904-905.
30. B. C. Moore, Principal component analysis in linear systems: controllability, observability, and model reduction, IEEE Trans. Automat. Control, AC26(1981),pp. 17-32.
31. T. Penzl, A cyclic lowrank Smith method for large sparse Lyapunov equations, SIAM J. Sci. Comput., 21(1999),pp. 1401-1418.
32. J. D. Roberts, Linear model reduction and solution ofthe algebraic Riccati equation by use ofthe sign function, Internat. J. Control, 32(1980),pp. 677-687.
33. S. Sauter and C. Schwab, Randelementmethoden, B. G. Teubner, Stuttgart, Leipzig, Wiesbaden, 2004.
34. SLICOT. Available at http://www.slicot.org.
35. D. Sorensen and A. Antoulas, The Sylvester equation and approximate balanced reduction, Linear Algebra Appl., 351/352(2002),pp. 671-700.
36. A. Varga, Efficient minimal realization procedure based on balancing, in A. El Moudni, P. Borne, and S. G. Tzafestas, eds., Proc. of IMACS/IFAC Symp. on Modelling and Control of Technological Systems, vol. 2, Lille, France, 1991,pp. 42-47.
37. K. Zhou, J. Doyle, and K. Glover, Robust and Optimal Control, PrenticeHall, Upper Saddle River, NJ, 1996.