A new projection method for solving large Sylvester equations

Applied Numerical Mathematics

Volumn 57, Issue 5-7 SPEC. ISS., 2007, Pages 521-532

  Bao, Liang ^a   Lin, Yiqin ^b   Wei, Yimin ^a  

^a FUDAN UNIVERSITY   (China)

^b HUNAN UNIVERSITY OF SCIENCE AND ENGINEERING   (China)

Author keywords

Block Arnoldi; Block Krylov subspace; Generalized Sylvester equation; Global Arnoldi; Matrix Krylov subspace; Sylvester equation

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; NUMERICAL METHODS;

BLOCK ARNOLDI; BLOCK KRYLOV SUBSPACE; GENERALIZED SYLVESTER EQUATION; GLOBAL ARNOLDI; MATRIX KRYLOV SUBSPACE; SYLVESTER EQUATION;

PROBLEM SOLVING;

EID: 34147177796     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2006.07.005     Document Type: Article

References (20)

1. Bao L., Lin Y., and Wei Y. Krylov subspace methods for the generalized Sylvester equation. Appl. Math. Comput. 175 (2006) 557-573
2. Bartels R.H., and Stewart G.W. Algorithm 432: Solution of the matrix equation A X + X B = C. Comm. ACM 15 (1972) 820-826
3. Calvetti D., Lewis B., and Reichel L. On the solution of large Sylvester-observer equation. Numer. Linear Algebra Appl. 8 (2001) 435-451
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.N. Numerical Methods for Linear Control Systems: Design and Analysis (2004), Elsevier Academic Press, Amsterdam
6. Demmel J.W. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia, PA
7. de Souza E., and Bhattacharyya S.P. Controllability, observability and solution of A X - X B = C. Linear Algebra Appl. 39 (1981) 167-188
8. Golub G.H., Nash S., and Van Loan C. A Hessenberg-Schur method for the problem A X + X B = C. IEEE Trans. Automat. Control 24 (1979) 909-913
9. El Guennouni A., Jbilou K., and Riquet J. Block Krylov subspace methods for solving large Sylvester equations. Numer. Algorithms 29 (2002) 75-96
10. Hearon J.Z. Nonsingular solutions of T A - B T = C. Linear Algebra Appl. 16 (1997) 57-63
11. Higham N.J. Accuracy and Stability of Numerical Algorithms. second ed. (2002), SIAM, Philadelphia, PA
12. Hu D.Y., and Reichel L. Krylov-subspace methods for the Sylvester equation. Linear Algebra Appl. 172 (1992) 283-313
13. Hyland C., and Bernstein D. The optimal projection equations for fixed-order dynamic compensation. IEEE Trans. Automat. Control 29 (1984) 1034-1037
14. Jaimoukha I.M., and Kasenally E.M. Krylov subspace methods for solving large Lyapunov equations. SIAM J. Numer. Anal. 31 (1994) 227-251
15. Jbilou K., Messaoudi A., and Sadok H. Global FOM and GMRES algorithms for matrix equations. Appl. Numer. Math. 31 (1999) 49-63
16. Jbilou K., and Riquet A.J. Projection methods for large Lyapunov matrix equations. Linear Algebra Appl. 415 (2006) 344-358
17. Laub A.J., Heath M.T., Paige C.C., and Ward R.C. Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms. IEEE Trans. Automat. Control 32 (1987) 115-122
18. Li J.-R., and White J. Low rank solution of Lyapunov equations. SIAM J. Matrix Anal. Appl. 24 (2002) 260-280
19. Robbe M., and Sadkane M. A convergence analysis of GMRES and FOM methods for Sylvester equations. Numer. Algorithms 30 (2002) 71-84
20. Wang G., Wei Y., and Qiao S. Generalized Inverses: Theory and Computations (2004), Science Press, Beijing