Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations

Applied Mathematics and Computation

Volumn 181, Issue 1, 2006, Pages 487-499

  Lin, Yiqin ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Augmented Arnoldi process; Generalized Sylvester equation; Krylov subspace; Minimal residual method; Ritz value; Ritz vector; Sylvester equation

Indexed keywords

AUGMENTED ARNOLDI PROCESS; GENERALIZED SYLVESTER EQUATION; KRYLOV SUBSPACE; MINIMAL RESIDUAL METHOD; RITZ VALUE; RITZ VECTOR; SYLVESTER EQUATION;

COMPUTATIONAL METHODS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

EIGENVALUES AND EIGENFUNCTIONS;

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

References (20)

1. Bao L., Lin Y., and Wei Y. Krylov subspace methods for the generalized Sylvester equation. Appl. Math. Comp. 175 1 (2006) 557-573
2. Bartels R.H., and Stewart G.W. Algorithm 432: solution of the matrix equation AX + XB = C. Circ. Systems Signal Process. 13 (1994) 820-826
3. 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
4. Demmel J.W. Applied Numerical Linear Algebra. SIAM (1997)
5. de Souza E., and Bhattacharyya S.P. Controllability, observability and solution of AX - XB = C. Linear Algebra Appl. 39 (1981) 167-188
6. El Guennouni A., Jbilou K., and Riquet A.J. Block Krylov subspace methods for solving large Sylvester equations. Numer. Algorith. 29 (2002) 75-96
7. Golub G.H., Nash S., and Van Loan C. A Hessenberg-Schur method for the problem AX + XB = C. IEEE Trans. Automat. Control AC 24 (1979) 909-913
8. Hearon J.Z. Nonsingular solutions of TA - BT = C. Linear Algebra Appl. 16 (1997) 57-63
9. Hu D.Y., and Reichel L. Krylov-subspace methods for the Sylvester equation. Linear Algebra Appl. 172 (1992) 283-313
10. Hyland C., and Bernstein D. The optimal projection equations for fixed-order dynamic compensation. IEEE Trans. Automat. Control 29 (1984) 1034-1037
11. Jaimoukha I.M., Kasenally E.M., and Ebrahim M. Krylov subspace methods for solving large Lyapunov equations. SIAM J. Numer. Anal. 31 (1994) 227-251
12. Jbilou K., Messaoudi A., and Sadok H. Global FOM and GMRES algorithms for matrix equations. Appl. Numer. Math. 31 (1999) 49-63
13. K. Jbilou, A.J. Riquet, Projection methods for large Lyapunov matrix equations, Linear Algebra Appl., in press.
14. Laub J., Heath M.T., Paige 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
15. Lin Y. Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations. Appl. Math. Comp. 167 (2005) 1004-1025
16. Morgan R.B. A restarted GMRES method augmented with eigenvectors. SIAM J. Matrix Anal. Appl. 16 (1995) 1154-1171
17. Morgan R.B., and Zeng M. Harmonic projection methods for nonsymmetric eigenvalues problems. Numer. Linear Algebra Appl. 5 (1998) 33-55
18. Saad Y. Krylov subspaces methods for solving large unsymmetric linear systems. Math. Comp. 37 (1981) 105-126
19. Saad Y., and Schultz M.H. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7 (1986) 856-869
20. Starke G., and Niethammer W. SOR for AX - XB = C. Linear Algebra Appl. 154 (1991) 355-375