Low rank solution of data-sparse Sylvester equations

Numerical Linear Algebra with Applications

Volumn 15, Issue 9, 2008, Pages 837-851

  Baur, U ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Hierarchical matrices; Matrix sign function; Sylvester equation

Indexed keywords

EID: 55749093820     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.605     Document Type: Article

References (35)

1. Lancaster P, Tismenetsky M. The Theory of Matrices (2nd edn). Academic Press: Orlando, 1985.
2. Lancaster P. Explicit solutions of linear matrix equation. SIAM Review 1970; 12:544-566.
3. Benner P, Mehrmann V; Sorensen D (eds). Dimension Reduction of Large-scale Systems. Lecture Notes in Computational Science and Engineering, vol. 45. Springer: Berlin, Heidelberg, Germany, 2005.
4. Moore B. Principal component analysis in linear systems: controllability, observability, and model reduction. IEEE Transactions on Automatic Control 1981; AC-26:17-32.
5. Fernando K, Nicholson H. On the structure of balanced and other principal representations of SISO systems. IEEE Transactions on Automatic Control 1983; 28(2):228-231.
6. Bartels RH, Stewart GW. Solution of the matrix equation AX+XB=C: algorithm 432. Communications of the ACM 1972; 15:820-826.
7. Enright W. Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Transactions on Mathematical Software 1978; 4:127-136.
8. Golub GH, Nash S, Van Loan C.F. A Hessenberg-Schur method for the problem AX + X B =C. IEEE Transactions on Automatic Control 1979; AC-24:909-913.
9. Golub GH, Van Loan CF. Matrix Computations (3rd edn). Johns Hopkins University Press: Baltimore, 1996.
10. Grasedyck L, Hackbusch W. A multigrid method to solve large scale Sylvester equations. Preprint 48, Max-Planck Institut für Mathematik in den Naturwissenschaften, Leipzig, Gemmany, 2004.
11. Hu DY, Reichel L. Krylov-subspace methods for the Sylvester equation. Linear Algebra and its Applications 1992; 172:283-313.
12. Wachspress E. Iterative solution of the Lyapunov matrix equation. Applied Mathematics Letters 1988; 107:87-90.
13. Roberts JD. Linear model reduction and solution of the algebraic Riccati equation by use of the sign function. International Journal of Control 1980; 32:677-687. Reprint of Technical Report No. TR-13, CUED/B-Control, Engineering Department, Cambridge University, 1971.
14. Benner P. Factorized solution of Sylvester equations with applications in control. Proceedings of International Symposium on Mathematical Theory of Networks and Systems, MTNS 2004, Leuven, Belgium, 2004. Available from: http://www.mtns2004.be.
15. Antoulas A, Sorensen D, Zhou Y. On the decay rate of Hankel singular values and related issues. Systems and Control Letters 2002; 46(5):323-342.
16. Grasedyck L. Existence of a low rank or H-matrix approximant to the solution of a Sylvester equation. Numerical Linear Algebra with Applications 2004; 11:371-389.
17. Penzl T. A cyclic low rank Smith method for large sparse Lyapunov equations. SIAM Journal on Scientific Computing 2000; 21(4):1401-1418.
18. Grasedyck L. Theorie und Anwendungen Hierarchischer Matrizen. Dissertation, University of Kiel, Kiel, Germany, 2001 (in German). Available from: http://e-diss.uni-kiel.de/diss_454.
19. Grasedyck L, Hackbusch W. Construction and arithmetics of ℋ-matrices. Computing 2003; 70(4):295-334.
20. Hackbusch W. A sparse matrix arithmetic based on .ℋ-matrices. I. Introduction to ℋ-matrices. Computing 1999; 62(2):89-108.
21. Hackbusch W, Khoromskij BN. A sparse ℋ-matrix arithmetic. II. Application to multi-dimensional problems. Computing 2000; 64(1):21-47.
22. Grasedyck L, Hackbusch W, Khoromskij BN. Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices. Computing 2003; 70:121-165.
23. Baur U, Benner P. Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic. Computing 2006; 78(3):211-234.
24. Benner P, Quintana-Ortí E. Solving stable generalized Lyapunov equations with the matrix sign function. Numerical Algorithms 1999; 20(1):75-100.
25. Bai Z, Demmel J. Design of a parallel nonsymmetric eigenroutine toolbox, part i. In Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Sincovec RF et al. (eds). SIAM: Philadelphia, PA, 1993; 391-398.
26. See also Technical Report CSD-92-718, Computer Science Division, University of California, Berkeley, CA.
27. Byers R. Solving the algebraic Riccati equation with the matrix sign function. Linear Algebra and its Applications 1987; 85:267-279.
28. Higham N. Computing the polar decomposition-with applications. SIAM Journal on Scientific and Statistical Computing 1986; 7:1160-1174.
29. Benner P, Quintana-Ortí ES, Quintana-Ortí G. Solving stable Sylvester equations via rational iterative schemes. Journal of Scientific. Computing 2006; 28(1):51-83.
30. Anderson E, Bai Z, Bischof C, Demmel J, Dongarra J, Du Croz J, Greenbaum A, Hammarling S, McKenney A, Sorensen D. LAPACK Users' Guide (3rd edn). SIAM: Philadelphia, PA, 1999.
31. Lawson C, Hanson R, Kincaid D, Krogh F. Basic linear algebra subprograms for FORTRAN usage. ACM Transactions on Mathematical Software 1979; 5:303-323.
32. Bischof C, Quintana-Ortí G. Algorithm 782: codes for rank-revealing QR factorizations of dense matrices. ACM Transactions on Mathematical Software 1998; 24(2):254-257.
33. Börm S, Grasedyck L, Hackbusch W. HLib 1.2, 2004. Available from: http://www.hlib.org.
34. Higham N. Accuracy and Stability of Numerical Algorithms. SIAM: Philadelphia, PA, 1996.
35. Benner P, Quintana-Ortí E. Model reduction based on spectral projection methods. In Dimension Reduction of Large-scale Systems, Benner P, Mehrmann V, Sorensen D (eds). Lecture Notes in Computational Science and Engineering, vol. 45. Springer: Berlin, Heidelberg, Germany, 2005; 5-45.