Krylov-subspace methods for the Sylvester equation

[1]  R. Varga,et al.  A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations , 1993 .

[2]  Lloyd N. Trefethen,et al.  A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems , 1992, SIAM J. Matrix Anal. Appl..

[3]  W. Niethammer,et al.  SOR for AX−XB=C , 1991 .

[4]  Eugene L. Wachspress,et al.  Alternating direction implicit iteration for systems with complex spectra , 1991 .

[5]  Dan Hu,et al.  An Implementation of the GMRES Method Using QR Factorization , 1991, SIAM Conference on Parallel Processing for Scientific Computing.

[6]  Peter N. Brown,et al.  A Theoretical Comparison of the Arnoldi and GMRES Algorithms , 1991, SIAM J. Sci. Comput..

[7]  Eugene L. Wachspress,et al.  The adi minimax problem for complex spectra , 1990 .

[8]  Y. Saad,et al.  Krylov Subspace Methods on Supercomputers , 1989 .

[9]  Y. Saad,et al.  Numerical solution of large Lyapunov equations , 1989 .

[10]  E. Wachspress.  Iterative solution of the Lyapunov matrix equation , 1988 .

[11]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[12]  Y. Saad,et al.  A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations , 1986 .

[13]  Shankar P. Bhattacharyya,et al.  Controllability, observability and the solution of AX - XB = C , 1981 .

[14]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[15]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[16]  Youcef Saad,et al.  Projection methods for solving large sparse eigenvalue problems , 1983 .

[17]  Y. Saad.  Krylov subspace methods for solving large unsymmetric linear systems , 1981 .

[18]  J. Hearon,et al.  Nonsingular solutions of TA−BT=C , 1977 .

[19]  David Young,et al.  Alternating Direction Implicit Methods , 1962, Adv. Comput..