Low rank approximate solutions to large Sylvester matrix equations

Applied Mathematics and Computation

Volumn 177, Issue 1, 2006, Pages 365-376

  Jbilou, K ^a  

^a UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

Author keywords

Arnoldi; Krylov subspaces; Low rank approximations; Sylvester equation

Indexed keywords

APPROXIMATION THEORY; BOUNDARY ELEMENT METHOD; ERROR ANALYSIS;

LOW-RANK APPROXIMATIONS; MATRIX KRYLOV SUBSPACE METHOD; SYLVESTER MATRIX EQUATIONS;

MATRIX ALGEBRA;

EID: 33744937558     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.11.014     Document Type: Article

References (22)

1. TXA - X = Q. IEEE Trans. Automat. Contr. AC-22 (1977) 883-885
2. Bartels R.H., and Stewart G.W. Algorithm 432: solution of the matrix equation AX + XB = C. Circ. Syst. Signal Proc. 13 (1994) 820-826
3. Calvetti D., and Reichel L. Application of ADI iterative methods to the restoration of noisy images. SIAM J. Matrix Anal. Appl. 17 (1996) 165-186
4. Datta B.N., and Datta K. Theoretical and computational aspects of some linear algebra problems in control theory. In: Byrnes C.I., and Lindquist A. (Eds). Computational and Combinatorial Methods in Systems Theory (1986), Elsevier, Amsterdam 201-212
5. Datta B. Numerical Methods for Linear Control Systems Design and Analysis (2003), Elsevier Press
6. De Souza E., and Bhattacharyya S.P. Controllability, observability and the solution of AX - XB = C. Linear Algebra Appl. 39 (1981) 167-188
7. El Guennouni A., Jbilou K., and Riquet A.J. Block Krylov subspace methods for solving large Sylvester equations. Numer. Algebra 29 (2002) 75-96
8. Epton M. Methods for the solution of AXD - BXC = E and its applications in the numerical solution of implicit ordinary differential equations. BIT 20 (1980) 341-345
9. Fernando K.V., and Nicholson H. On the structure of balanced and other principal representations of SISO systems. IEEE Trans. Automat. Contr. AC-28 (1983) 228-231
10. Golub G.H., Nash S., and Van Loan C. A Hessenberg-Schur method for the problem AX + XB = C. IEEC Trans. Automat. Contr. AC-24 (1979) 909-913
11. Hu D.Y., and Reichel L. Krylov subspace methods for the Sylvester equation. Linear Algebra Appl. 174 (1992) 283-314
12. Hyland C., and Bernstein D. The optimal projection equations for fixed-order dynamic compensation. IEEE Trans. Contr. AC-29 (1984) 1034-1037
13. Jbilou K., Messaoudi A., and Sadok H. Global FOM and GMRES algorithms for matrix equations. Appl. Numer. Math. 31 (1999) 49-63
14. Lancaster P., and Tismenetsky M. The Theory of Matrices (1985), Academic Press, London
15. Moler C., and Van Loan C. Nineteen dubious ways to compute the exponential of a matrix. SIAM Rev. 20 (1978) 801-836
16. C.T. Penzl, Algorithms for model reduction for large dynamical systems, Technical Report SFB393/99-40, TU Chemintz, 1999.
17. Saad Y. Numerical solution of large Lyapunov equations. In: Kaashoek M.A., van Schuppen J.H., and Ran A.C. (Eds). Proceedings of the International Symposium MTNS-89, Boston. Signal Processing, Scattering, Operator Theory and Numerical Methods vol. 3 (1990), Birkhauser 503-511
18. Saad Y. Iterative Methods for Sparse Linear Systems (1995), PWS Press, New York
19. Saad Y., and Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comp. 7 (1986) 856-869
20. Simoncini V. On the numerical solution of AX - XB = C. BIT 36 4 (1996) 814-830
21. Sorensen D.C., and Antoulas A.C. The Sylvester equation and approximate balanced reduction. Linear Algebra Appl. 351-352 (2002) 671-700
22. Stewart G.W., and Sun J.-G. Matrix Perturbation Theory (1990), Academic Press, New York